| No. |
Title |
Author |
Year |
| 1 |
Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu |
Hosseini, Mojtaba et al. |
2022 |
| 2 |
Algorithmic Game Theory and the Internet (Dagstuhl Seminar 03291) |
Karpinski, Marek et al. |
2021 |
| 3 |
Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets |
Vazirani, Vijay V. et al. |
2021 |
| 4 |
Matching Is as Easy as the Decision Problem, in the NC Model |
Anari, Nima et al. |
2020 |
| 5 |
Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds |
Gajulapalli, Karthik et al. |
2020 |
| 6 |
Finding Stable Matchings That Are Robust to Errors in the Input |
Mai, Tung et al. |
2018 |
| 7 |
Mutation, Sexual Reproduction and Survival in Dynamic Environments |
Mehta, Ruta et al. |
2017 |
| 8 |
Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion |
Mai, Tung et al. |
2017 |
| 9 |
Allocation of Divisible Goods Under Lexicographic Preferences |
Schulman, Leonard J. et al. |
2015 |
| 10 |
Equilibrium Computation (Dagstuhl Seminar 14342) |
Megiddo, Nimrod et al. |
2014 |
| 11 |
10171 Abstracts Collection -- Equilibrium Computation |
Elkind, Edith et al. |
2010 |
