Asst Prof. Yakov Babichenko

Economics

[formatedname]

Overview

I did my MSc and PhD at the Hebrew University in the department of Mathematics, and the Center for the Study of Rationality under the supervision of prof. Sergiu Hart. Then I had a two year Post-doc at Caltech in the depatrment of Computing and Mathematical Sciences, and the Center for Mathematics of Information. 

My main research interest is Game Theory. In particular, I am interested in adaptive learning in games and the rate of convergence of these adaptive processes. Another, related, area of interest is the complexity of equilibria in games in several complexity models as computational complexity, communication complexity, and query complexity. Recently, I am interested also in mechanisms that achieve efficiency in different game-theoretical frameworks as bargaining or extencive form games.

Selected Publications

Work in proress or under revision

Communication Complexity of Approximate Nash Equilibria”, joint with Aviad Rubinstein.

Private Bayesian Persuasion”, joint with Itai Arieli.

Sequencial Commitment”, joint with Itai Arieli and Moshe Tennenholtz.

Pareto Efficient Implementation by Approval Voting”, joint with Leonard Schulman.

Best-Reply Dynamics in Large Aggregative Games”.

Axiomatic Approach to Solutions of Games”.

Publications in chronological order

Computational Aspects of Private Bayesian Persuasion”, joint with Siddharth Barman. In ITCS'2017.

Random Extensive Form Games”, joint with Itai Arieli. JET, 166 (2016), 517-535.

Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash", joint with Christos Papadimitriou, and Aviad Rubinstein. In ITCS’2016.

Graphical Potential Games”, joint with Omer Tamuz. JET, 163 (2016), 889-899.

Query Complexity of Correlated Equilibrium”, joint with Siddharth Barman. TEAC 3.4 (2015): 22.

Query Complexity of Approximate Nash Equilibria”. 2014. Conerence version: In STOC'14. Journal version: JACM, 63.4 (2016): 36.

Empirical Distribution of Equilibrium Play and Its Testing Application”, joint with Siddharth Barman and Ron Peretz. Conference version: In EC'2014. Journal version: MOR (2016), forthcoming.

Hunter, Cauchy Rabbit, and Optimal Kakeya Sets”, joint with Yuval Peres, Ron Peretz, Perla Sousi, and Peter Winkler. Transtactions of AMS (2014), 366, 5567-5586.

How Long to Pareto Efficiency?”. IJGT, 43 (2014), 13-24.

Best-Reply Dynamics in Large Binary-Choice Anonymous Games”. GEB, 81 (2013), 130-144.

Average-Testing and Pareto Efficiency”, joint with Itai Arieli. JET, 147 (2012), 2376-2398.

Completely Uncoupled Dynamics and Nash Equilibria”. GEB, 76 (2012), 1-14.

Musical Chairs”, joint with Yehuda Afek, Uriel Feige, Eli Gafni, Nati Linial, and Benny Sudakov. Conference verion: DC'2011. Journal version: SIDMA 28.3 (2014), 1578-1600.

Uncoupled Automata and Pure Nash Equilibria”. IJGT, 39 (2010), 483-502.

Works by topics

Complexity of Equilibria

Implementing Pareto Efficiency in Strategic Interactions

Adaptive Learning in Games

Information in Games

Fundamental Game Theory

Other Fun Puzzles

  • Hunter, Cauchy Rabbit, and Optimal Kakeya Sets”, joint with Yuval Peres, Ron Peretz, Perla Sousi, and Peter Winkler. Transtactions of AMS (2014), 366, 5567-5586.
  • Musical Chairs”, joint with Yehuda Afek, Uriel Feige, Eli Gafni, Nati Linial, and Benny Sudakov. Conference verion: DC'2011. Journal version: SIDMA 28.3 (2014), 1578-1600.

Contact Info

Room 307 Bloomfield Building
+972-4-829-2446