| 2024 | STOC | Fair Division via Quantile Shares. | Yakov Babichenko, Michal Feldman, Ron Holzman, Vishnu V. Narayan |
| 2021 | AAAI | Bayesian Persuasion under Ex Ante and Ex Post Constraints. | Yakov Babichenko, Inbal Talgam-Cohen, Konstantin Zabarnyi |
| 2021 | STOC | Settling the complexity of Nash equilibrium in congestion games. | Yakov Babichenko, Aviad Rubinstein |
| 2020 | AAAI | Incentive-Compatible Classification. | Yakov Babichenko, Oren Dean, Moshe Tennenholtz |
| 2020 | FOCS | Communication complexity of Nash equilibrium in potential games (extended abstract). | Yakov Babichenko, Aviad Rubinstein |
| 2019 | EC | Naive Learning Through Probability Matching. | Itai Arieli, Yakov Babichenko, Manuel Mueller-Frank |
| 2019 | EC | Robust Non-Bayesian Social Learning. | Itai Arieli, Yakov Babichenko, Segev Shlomov |
| 2019 | STOC | The communication complexity of local search. | Yakov Babichenko, Shahar Dobzinski, Noam Nisan |
| 2018 | WWW | Incentive-Compatible Diffusion. | Yakov Babichenko, Oren Dean, Moshe Tennenholtz |
| 2017 | STOC | Communication complexity of approximate Nash equilibria. | Yakov Babichenko, Aviad Rubinstein |
| 2014 | STOC | Query complexity of approximate nash equilibria. | Yakov Babichenko |