1 Almost stable matchings in the Roommates problem David Abraham Computer Science Department Carnegie-Mellon University, USA Péter Biró Department of Computer.
LAW February 20071 A 5/3 approximation algorithm for a hard case of stable marriage Rob Irving Computing Science Department University of Glasgow (joint.
From design to adoption of matching-market clearinghouses: The role of experiments Alvin E. Roth Harvard University Evidence-Based Public Policy New Tools.
Michael Maschler, Eilon Solan, Shmuel Zamir - Game Theory [2013][A].pdf
Matching Theory 1. Two-Sided Matching Statement of the problem Two sides of the market to be matched. Participants on both sides care about to whom they.
1 Chapter 1 Introduction: Some Representative Problems Slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved.
Stabile Marriage Thanks to Mohammad Mahdian Lab for Computer Science, MIT.
Simultaneous Matchings Irit Katriel - BRICS, U of Aarhus, Denmark Joint work with Khaled Elabssioni and Martin Kutz - MPI, Germany Meena Mahajan - IMSC,
01stable-matching (3).ppt
Heuristic Mechanism Design Joint with Florin Constantin, Ben Lubin and Quang Duong Cornell CS/Econ WorkshopSeptember 4, 2009 David C. Parkes Harvard University.
Experiments for Market Design
Incentive compatibility in 2-sided matching markets Mohammad Mahdian Yahoo! Research Based on joint work with Nicole Immorlica.
![Michael Maschler, Eilon Solan, Shmuel Zamir - Game Theory [2013][A].pdf](https://static.fdocuments.us/doc/330x215/55cf93dd550346f57b9e99c1/michael-maschler-eilon-solan-shmuel-zamir-game-theory-2013apdf.jpg)
