Yakov Babichenko

Orcid: 0000-0002-6970-1601

According to our database1, Yakov Babichenko authored at least 63 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A population's feasible posterior beliefs.
J. Econ. Theory, January, 2024

Robust Price Discrimination.
CoRR, 2024

2023
Fair Division via Quantile Shares.
CoRR, 2023

Algorithmic Cheap Talk.
CoRR, 2023

Universally Robust Information Aggregation for Binary Decisions.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

The Hazards and Benefits of Condescension in Social Learning.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Naive Learning Through Probability Overmatching.
Oper. Res., November, 2022

Regret-minimizing Bayesian persuasion.
Games Econ. Behav., 2022

Communication complexity of approximate Nash equilibria.
Games Econ. Behav., 2022

Information Design in the Principal-Agent Problem.
CoRR, 2022

Bayesian Persuasion with Mediators.
CoRR, 2022

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

Multi-Channel Bayesian Persuasion.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Golden games.
Theor. Comput. Sci., 2021

Feasible joint posterior beliefs (through examples).
SIGecom Exch., 2021

Robust learning in social networks via matrix scaling.
Oper. Res. Lett., 2021

Learning Optimal Forecast Aggregation in Partial Evidence Environments.
Math. Oper. Res., 2021

Virtually additive learning.
J. Econ. Theory, 2021

Settling the complexity of Nash equilibrium in congestion games.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

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

Bayesian Persuasion under Ex Ante and Ex Post Constraints.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Identifiable information structures.
Games Econ. Behav., 2020

Communication complexity of Nash equilibrium in potential games.
CoRR, 2020

Incentive-Compatible Selection Mechanisms for Forests.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Optimal Persuasion via Bi-Pooling.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Feasible Joint Posterior Beliefs.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Communication complexity of Nash equilibrium in potential games (extended abstract).
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Incentive-Compatible Classification.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Informational bounds on equilibria (a survey).
SIGecom Exch., 2019

Private Bayesian persuasion.
J. Econ. Theory, 2019

Sequential Voting with Confirmation Network.
Proceedings of the Proceedings Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge, 2019

Stable Secretaries.
Algorithmica, 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

Paradoxes in Sequential Voting.
CoRR, 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 Econ. Behav., 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. Econ. Theory, 2016

Random extensive form games.
J. Econ. Theory, 2016

Query Complexity of Approximate Nash Equilibria.
J. ACM, 2016

Computational Aspects of Private Bayesian Persuasion.
CoRR, 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

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

Random Extensive Form Games and its Application to Bargaining.
CoRR, 2015

2014
Musical Chairs.
SIAM J. Discret. Math., 2014

How long to Pareto efficiency?
Int. J. Game Theory, 2014

Axiomatic Approach to Solutions of Games.
CoRR, 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 Econ. Behav., 2013

Small Support Equilibria in Large Games
CoRR, 2013

Approximate Nash Equilibria via Sampling.
CoRR, 2013

Small-Support Approximate Correlated Equilibria.
CoRR, 2013

2012
Average testing and Pareto efficiency.
J. Econ. Theory, 2012

Completely uncoupled dynamics and Nash equilibria.
Games Econ. Behav., 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


  Loading...