Solutions for the Stable Roommates Problem with Payments
AbstractThe stable roommates problem with payments has as input a graph G(E,V) with an edge weighting w:E_ùR+ and the problem is to find a stable solution. A solution is a matching M with a vector p.RV that satisfies pu+pv=w(uv) for all uv.M and pu=0 for all u unmatched in M. A solution is stable if it prevents blocking pairs, i.e., pairs of adjacent vertices u and v with pu+pv
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences in its series IEHAS Discussion Papers with number 1211.
Length: 18 pages
Date of creation: Mar 2012
Date of revision:
roommates problem; matching game; cooperative game theory;
Find related papers by JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Peter Biro & Walter Kern & Daniel Paulusma, 2011.
"Computing Solutions for Matching Games,"
IEHAS Discussion Papers
1142, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.
- László Á. Kóczy & Luc Lauwers, 2001.
"The Coalition Structure Core is Accessible,"
Game Theory and Information
0110001, EconWPA, revised 26 Jun 2002.
- Johan Karlander & Kimmo Eriksson, 2001. "Stable outcomes of the roommate game with transferable utility," International Journal of Game Theory, Springer, vol. 29(4), pages 555-569.
- Effrosyni Diamantoudi & Eiichi Miyagawa & Licun Xue, 2002.
"Random paths to stability in the roommate problem,"
0102-65, Columbia University, Department of Economics.
- Roth, Alvin E & Vande Vate, John H, 1990. "Random Paths to Stability in Two-Sided Matching," Econometrica, Econometric Society, vol. 58(6), pages 1475-80, November.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2011. "On the number of blocks required to access the coalition structure core," MPRA Paper 29755, University Library of Munich, Germany.
- Bary S.R. Pradelski, 2014. "Evolutionary Dynamics and Fast Convergence in the Assignment Game," Economics Series Working Papers 700, University of Oxford, Department of Economics.
- Bettina Klaus & Frédéric Payot, 2013. "Paths to Stability in the Assignment Problem," Cahiers de Recherches Economiques du DÃ©partement d'EconomÃ©trie et d'Economie politique (DEEP) 13.14, Université de Lausanne, Faculté des HEC, DEEP.
- Newton, Jonathan & Sawa, Ryoji, 2013. "A one-shot deviation principle for stability in matching problems," Working Papers 2013-09, University of Sydney, School of Economics, revised Jul 2014.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Adrienn Foldi).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.