Yakov Babichenko
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Multi-channel Bayesian persuasion | 2024-04-09 | Paper |
| A population's feasible posterior beliefs Journal of Economic Theory | 2024-01-19 | Paper |
| Settling the complexity of Nash equilibrium in congestion games Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Optimal persuasion via bi‐pooling Theoretical Economics | 2023-10-23 | Paper |
| Naive Learning Through Probability Overmatching Operations Research | 2023-01-10 | Paper |
| Regret-minimizing Bayesian persuasion Games and Economic Behavior | 2022-11-24 | Paper |
| Communication complexity of approximate Nash equilibria Games and Economic Behavior | 2022-07-15 | Paper |
| scientific article; zbMATH DE number 7450018 (Why is no real title available?) | 2021-12-20 | Paper |
| Robust learning in social networks via matrix scaling Operations Research Letters | 2021-12-13 | Paper |
| Golden games Theoretical Computer Science | 2021-10-21 | Paper |
| Virtually additive learning Journal of Economic Theory | 2021-09-29 | Paper |
| Learning optimal forecast aggregation in partial evidence environments Mathematics of Operations Research | 2021-07-15 | Paper |
| The speed of innovation diffusion in social networks Econometrica | 2021-06-07 | Paper |
| Identifiable information structures Games and Economic Behavior | 2020-05-07 | Paper |
| Fast convergence of best-reply dynamics in aggregative games Mathematics of Operations Research | 2020-03-11 | Paper |
| Feasible Joint Posterior Beliefs | 2020-02-26 | Paper |
| The communication complexity of local search Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
| Golden games | 2019-09-09 | Paper |
| Stable secretaries Algorithmica | 2019-06-27 | Paper |
| Private Bayesian persuasion Journal of Economic Theory | 2019-06-14 | Paper |
| Query complexity of approximate Nash equilibria Journal of the ACM | 2018-08-02 | Paper |
| Algorithmic aspects of private Bayesian persuasion | 2018-05-03 | Paper |
| Sequential commitment games Games and Economic Behavior | 2017-10-24 | Paper |
| Communication complexity of approximate Nash equilibria Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Empirical distribution of equilibrium play and its testing application Mathematics of Operations Research | 2017-04-13 | Paper |
| Random extensive form games Journal of Economic Theory | 2016-11-03 | Paper |
| Graphical potential games Journal of Economic Theory | 2016-05-11 | Paper |
| Can almost everybody be almost happy? Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
| Query complexity of approximate nash equilibria Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
| Musical Chairs SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
| Hunter, Cauchy rabbit, and optimal Kakeya sets Transactions of the American Mathematical Society | 2014-09-19 | Paper |
| How long to Pareto efficiency? International Journal of Game Theory | 2014-06-27 | Paper |
| Best-reply dynamics in large binary-choice anonymous games Games and Economic Behavior | 2014-02-24 | Paper |
| Completely uncoupled dynamics and Nash equilibria Games and Economic Behavior | 2013-11-14 | Paper |
| Average testing and Pareto efficiency Journal of Economic Theory | 2012-12-13 | Paper |
| Oblivious Collaboration Lecture Notes in Computer Science | 2011-10-28 | Paper |
| Uncoupled automata and pure Nash equilibria International Journal of Game Theory | 2011-05-05 | Paper |
Research outcomes over time
This page was built for person: Yakov Babichenko
