default search action
Ronen Gradwohl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Ronen Gradwohl, Artyom Jelnov:
Partial credence goods on review platforms. Games Econ. Behav. 148: 517-534 (2024) - [c18]Yotam Gafni
, Ronen Gradwohl
Prediction-Sharing During Training and Inference. SAGT 2024: 425-442 - [i14]Yotam Gafni, Ronen Gradwohl, Moshe Tennenholtz:
Prediction-sharing During Training and Inference. CoRR abs/2403.17515 (2024) - 2023
- [j11]Ronen Gradwohl, Moshe Tennenholtz:
Coopetition Against an Amazon. J. Artif. Intell. Res. 76: 1077-1116 (2023) - [c17]Ronen Gradwohl
Informationally Robust Cheap-Talk. EC 2023: 813 - [c16]Ronen Gradwohl, Moshe Tennenholtz:
Selling Data to a Competitor (Extended Abstract). TARK 2023: 318-330 - [i13]Itai Arieli, Ronen Gradwohl, Rann Smorodinsky:
Informationally Robust Cheap-Talk. CoRR abs/2302.00281 (2023) - [i12]Ronen Gradwohl, Moshe Tennenholtz:
Selling Data to a Competitor. CoRR abs/2302.00285 (2023) - 2022
- [j10]Ronen Gradwohl
Algorithms for Persuasion with Limited Communication. Math. Oper. Res. 47(3): 2520-2545 (2022) - [c15]Ronen Gradwohl
Pareto-Improving Data-Sharing✱. FAccT 2022: 197-198 - [c14]Ronen Gradwohl
Coopetition Against an Amazon. SAGT 2022: 347-365 - [c13]Yiding Feng
Bias-Variance Games. EC 2022: 328-329 - [c12]Itai Arieli, Ronen Gradwohl
Herd Design. EC 2022: 871-872 - [i11]Ronen Gradwohl
Pareto-Improving Data-Sharing. CoRR abs/2205.11295 (2022) - [i10]Ronen Gradwohl
Social Media and Democracy. CoRR abs/2206.14430 (2022) - 2021
- [j9]Ronen Gradwohl
Privacy, Patience, and Protection. Dyn. Games Appl. 11(4): 759-784 (2021) - [c11]Ronen Gradwohl, Niklas Hahn, Martin Hoefer, Rann Smorodinsky:
Algorithms for Persuasion with Limited Communication. SODA 2021: 637-652 - 2020
- [i9]Ronen Gradwohl, Moshe Tennenholtz:
Coopetition Against an Amazon. CoRR abs/2005.10038 (2020) - [i8]Ronen Gradwohl, Niklas Hahn, Martin Hoefer, Rann Smorodinsky:
Reaping the Informational Surplus in Bayesian Persuasion. CoRR abs/2006.02048 (2020) - [i7]Ronen Gradwohl, Niklas Hahn, Martin Hoefer, Rann Smorodinsky:
Algorithms for Persuasion with Limited Communication. CoRR abs/2007.12489 (2020)
2010 – 2019
- 2019
- [i6]Yiding Feng, Ronen Gradwohl, Jason D. Hartline, Aleck C. Johnsen, Denis Nekipelov:
Bias-Variance Games. CoRR abs/1909.03618 (2019) - 2018
- [j8]Ronen Gradwohl
Privacy in implementation. Soc. Choice Welf. 50(3): 547-580 (2018) - 2017
- [j7]Ronen Gradwohl
Perception games and privacy. Games Econ. Behav. 104: 293-308 (2017) - [c10]Ronen Gradwohl
Voting in the Limelight. EC 2017: 285 - [c9]Ronen Gradwohl
Information Sharing and Privacy in Networks. EC 2017: 349-350 - 2014
- [j6]Ronen Gradwohl
Fault tolerance in large games. Games Econ. Behav. 86: 438-457 (2014) - [i5]Ronen Gradwohl, Rann Smorodinsky:
Subjective Perception Games and Privacy. CoRR abs/1409.1487 (2014) - 2013
- [j5]Ronen Gradwohl
Sequential rationality in cryptographic protocols. ACM Trans. Economics and Comput. 1(1): 2:1-2:38 (2013) - 2010
- [j4]Ronen Gradwohl
Partial exposure in large games. Games Econ. Behav. 68(2): 602-613 (2010) - [c8]Ronen Gradwohl
Sequential Rationality in Cryptographic Protocols. FOCS 2010: 623-632 - [c7]Ronen Gradwohl
Rationality in the Full-Information Model. TCC 2010: 401-418 - [i4]Ronen Gradwohl, Noam Livne, Alon Rosen:
Sequential Rationality in Cryptographic Protocols. CoRR abs/1008.3123 (2010) - [i3]Ronen Gradwohl, Noam Livne, Alon Rosen:
Sequential Rationality in Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2010: 448 (2010)
2000 – 2009
- 2009
- [j3]Ronen Gradwohl
Players' Effects Under Limited Independence. Math. Oper. Res. 34(4): 971-980 (2009) - [j2]Ronen Gradwohl
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. Theory Comput. Syst. 44(2): 245-268 (2009) - 2008
- [j1]Ronen Gradwohl
t-Wise independence with local dependencies. Inf. Process. Lett. 106(5): 208-212 (2008) - [c6]Ronen Gradwohl
Price Variation in a Bipartite Exchange Network. SAGT 2008: 109-120 - [c5]Ronen Gradwohl
Fault tolerance in large games. EC 2008: 274-283 - [c4]Ronen Gradwohl
Fault Tolerance in Distributed Mechanism Design. WINE 2008: 539-547 - 2007
- [c3]Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum:
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. FUN 2007: 166-182 - 2006
- [c2]Ronen Gradwohl, Salil P. Vadhan, David Zuckerman:
Random Selection with an Adversarial Majority. CRYPTO 2006: 409-426 - [i2]Ronen Gradwohl, Salil P. Vadhan, David Zuckerman:
Random Selection with an Adversarial Majority. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c1]Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma
On the Error Parameter of Dispersers. APPROX-RANDOM 2005: 294-305 - [i1]Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma:
On the Error Parameter of Dispersers. Electron. Colloquium Comput. Complex. TR05 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-11 21:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: