Yakov Babichenko

J. Econ. Theory, January, 2024

Persuading while Learning.

[BibT_eX]

[DOI]

CoRR, 2024

Robust Price Discrimination.

[BibT_eX]

[DOI]

CoRR, 2024

Fair Division via Quantile Shares.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Information Design in the Principal-Agent Problem.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Algorithmic Cheap Talk.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

2023

Universally Robust Information Aggregation for Binary Decisions.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

The Hazards and Benefits of Condescension in Social Learning.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022

Naive Learning Through Probability Overmatching.

[BibT_eX]

[DOI]

Manuel Mueller-Frank

Oper. Res., November, 2022

Regret-minimizing Bayesian persuasion.

[BibT_eX]

[DOI]

Games Econ. Behav., 2022

Communication complexity of approximate Nash equilibria.

[BibT_eX]

[DOI]

Games Econ. Behav., 2022

Bayesian Persuasion with Mediators.

[BibT_eX]

[DOI]

Fedor Sandomirskiy

CoRR, 2022

Persuasion as Transportation.

[BibT_eX]

[DOI]

Fedor Sandomirskiy

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Multi-Channel Bayesian Persuasion.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Golden games.

[BibT_eX]

[DOI]

Urban Larsson

Theor. Comput. Sci., 2021

Feasible joint posterior beliefs (through examples).

[BibT_eX]

[DOI]

SIGecom Exch., 2021

Robust learning in social networks via matrix scaling.

[BibT_eX]

[DOI]

Segev Shlomov

Oper. Res. Lett., 2021

Learning Optimal Forecast Aggregation in Partial Evidence Environments.

[BibT_eX]

[DOI]

Dan Garber

Math. Oper. Res., 2021

Virtually additive learning.

[BibT_eX]

[DOI]

Segev Shlomov

J. Econ. Theory, 2021

Settling the complexity of Nash equilibrium in congestion games.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Sequential Naive Learning.

[BibT_eX]

[DOI]

Manuel Mueller-Frank

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Bayesian Persuasion under Ex Ante and Ex Post Constraints.

[BibT_eX]

[DOI]

Inbal Talgam-Cohen

Konstantin Zabarnyi

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Identifiable information structures.

[BibT_eX]

[DOI]

Rann Smorodinsky

Games Econ. Behav., 2020

Communication complexity of Nash equilibrium in potential games.

[BibT_eX]

[DOI]

CoRR, 2020

Incentive-Compatible Selection Mechanisms for Forests.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Optimal Persuasion via Bi-Pooling.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Feasible Joint Posterior Beliefs.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Communication complexity of Nash equilibrium in potential games (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Incentive-Compatible Classification.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Informational bounds on equilibria (a survey).

[BibT_eX]

[DOI]

SIGecom Exch., 2019

Private Bayesian persuasion.

[BibT_eX]

[DOI]

J. Econ. Theory, 2019

Sequential Voting with Confirmation Network.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge, 2019

Stable Secretaries.

[BibT_eX]

[DOI]

Algorithmica, 2019

The communication complexity of local search.

[BibT_eX]

[DOI]

Shahar Dobzinski

Noam Nisan

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Robust Non-Bayesian Social Learning.

[BibT_eX]

[DOI]

Segev Shlomov

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Naive Learning Through Probability Matching.

[BibT_eX]

[DOI]

Manuel Mueller-Frank

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Fast Convergence of Best-Reply Dynamics in Aggregative Games.

[BibT_eX]

[DOI]

Math. Oper. Res., 2018

Paradoxes in Sequential Voting.

[BibT_eX]

[DOI]

CoRR, 2018

Incentive-Compatible Diffusion.

[BibT_eX]

[DOI]

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

2017

Empirical Distribution of Equilibrium Play and Its Testing Application.

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

Sequential commitment games.

[BibT_eX]

[DOI]

Games Econ. Behav., 2017

Forecast Aggregation.

[BibT_eX]

[DOI]

Rann Smorodinsky

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Simple Approximate Equilibria in Games with Many Players.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Algorithmic Aspects of Private Bayesian Persuasion.

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

Graphical potential games.

[BibT_eX]

[DOI]

Omer Tamuz

J. Econ. Theory, 2016

Random extensive form games.

[BibT_eX]

[DOI]

J. Econ. Theory, 2016

Query Complexity of Approximate Nash Equilibria.

[BibT_eX]

[DOI]

J. ACM, 2016

Computational Aspects of Private Bayesian Persuasion.

[BibT_eX]

[DOI]

CoRR, 2016

Can Almost Everybody be Almost Happy?

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015

Query Complexity of Correlated Equilibrium.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

CoRR, 2015

Random Extensive Form Games and its Application to Bargaining.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Musical Chairs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

How long to Pareto efficiency?

[BibT_eX]

[DOI]

Int. J. Game Theory, 2014

Axiomatic Approach to Solutions of Games.

[BibT_eX]

[DOI]

CoRR, 2014

Simple approximate equilibria in large games.

[BibT_eX]

[DOI]

Proceedings of the ACM Conference on Economics and Computation, 2014

2013

Best-reply dynamics in large binary-choice anonymous games.

[BibT_eX]

[DOI]

Games Econ. Behav., 2013

Small Support Equilibria in Large Games

[BibT_eX]

[DOI]

CoRR, 2013

Approximate Nash Equilibria via Sampling.

[BibT_eX]

[DOI]

CoRR, 2013

Small-Support Approximate Correlated Equilibria.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Average testing and Pareto efficiency.

[BibT_eX]

[DOI]

J. Econ. Theory, 2012

Completely uncoupled dynamics and Nash equilibria.

[BibT_eX]

[DOI]

Games Econ. Behav., 2012

2011

Oblivious Collaboration.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

2010

Uncoupled automata and pure Nash equilibria.

[BibT_eX]

[DOI]