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 Online Bipartite Matching and Adwords (Invited Talk) Vazirani, Vijay V. 2022
3 Algorithmic Game Theory and the Internet (Dagstuhl Seminar 03291) Karpinski, Marek et al. 2021
4 Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets Vazirani, Vijay V. et al. 2021
5 Matching Is as Easy as the Decision Problem, in the NC Model Anari, Nima et al. 2020
6 Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds Gajulapalli, Karthik et al. 2020
7 Finding Stable Matchings That Are Robust to Errors in the Input Mai, Tung et al. 2018
8 Mutation, Sexual Reproduction and Survival in Dynamic Environments Mehta, Ruta et al. 2017
9 Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion Mai, Tung et al. 2017
10 Allocation of Divisible Goods Under Lexicographic Preferences Schulman, Leonard J. et al. 2015
11 Equilibrium Computation (Dagstuhl Seminar 14342) Megiddo, Nimrod et al. 2014
12 10171 Abstracts Collection -- Equilibrium Computation Elkind, Edith et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 12


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI