No. Title Author Year
1 A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications Gangam, Rohith Reddy et al. 2022
2 Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu Hosseini, Mojtaba et al. 2022
3 New Characterizations of Core Imputations of Matching and b-Matching Games Vazirani, Vijay V. 2022
4 Online Bipartite Matching and Adwords (Invited Talk) Vazirani, Vijay V. 2022
5 Algorithmic Game Theory and the Internet (Dagstuhl Seminar 03291) Karpinski, Marek et al. 2021
6 Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets Vazirani, Vijay V. et al. 2021
7 Matching Is as Easy as the Decision Problem, in the NC Model Anari, Nima et al. 2020
8 Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds Gajulapalli, Karthik et al. 2020
9 Finding Stable Matchings That Are Robust to Errors in the Input Mai, Tung et al. 2018
10 Mutation, Sexual Reproduction and Survival in Dynamic Environments Mehta, Ruta et al. 2017
11 Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion Mai, Tung et al. 2017
12 Allocation of Divisible Goods Under Lexicographic Preferences Schulman, Leonard J. et al. 2015
13 Equilibrium Computation (Dagstuhl Seminar 14342) Megiddo, Nimrod et al. 2014
14 10171 Abstracts Collection -- Equilibrium Computation Elkind, Edith et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 14

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