# Yakov Babichenko

According to our database

Collaborative distances:

^{1}, Yakov Babichenko authored at least 26 papers between 2010 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Private Bayesian persuasion.

J. Economic Theory, 2019

The communication complexity of local search.

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

Robust Non-Bayesian Social Learning.

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

Naive Learning Through Probability Matching.

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

2018

Fast Convergence of Best-Reply Dynamics in Aggregative Games.

Math. Oper. Res., 2018

Incentive-Compatible Diffusion.

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

2017

Empirical Distribution of Equilibrium Play and Its Testing Application.

Math. Oper. Res., 2017

Sequential commitment games.

Games and Economic Behavior, 2017

Communication complexity of approximate Nash equilibria.

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Stable Secretaries.

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

Forecast Aggregation.

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

Simple Approximate Equilibria in Games with Many Players.

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

Algorithmic Aspects of Private Bayesian Persuasion.

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

2016

Graphical potential games.

J. Economic Theory, 2016

Random extensive form games.

J. Economic Theory, 2016

Can Almost Everybody be Almost Happy?

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

2015

Query Complexity of Correlated Equilibrium.

ACM Trans. Economics and Comput., 2015

2014

Musical Chairs.

SIAM J. Discrete Math., 2014

How long to Pareto efficiency?

Int. J. Game Theory, 2014

Query complexity of approximate nash equilibria.

Proceedings of the Symposium on Theory of Computing, 2014

Simple approximate equilibria in large games.

Proceedings of the ACM Conference on Economics and Computation, 2014

2013

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

Games and Economic Behavior, 2013

2012

Average testing and Pareto efficiency.

J. Economic Theory, 2012

Completely uncoupled dynamics and Nash equilibria.

Games and Economic Behavior, 2012

2011

Oblivious Collaboration.

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

2010

Uncoupled automata and pure Nash equilibria.

Int. J. Game Theory, 2010