Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Int J Game Theory

Search In Journal Title:

Abbravation: International Journal of Game Theory

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1007/bf00251204

Search In DOI:

ISSN

1432-1270

Search In ISSN:
Search In Title Of Papers:

Random paths to Emphasis Type="Italic"P/Emphasi

Authors: E Inarra C Larrea E Molis
Publish Date: 2007/05/12
Volume: 36, Issue: 3-4, Pages: 461-471
PDF Link

Abstract

For solvable roommate problems with strict preferences Diamantoudi et al Games Econ Behav 48 18–28 2004 show that for any unstable matching there exists a finite sequence of successive myopic blocking pairs leading to a stable matching In this paper we define Pstable matchings associated with stable partitions and by using a proposalrejection procedure generalize the previous result for the entire class of roommate problemsWe thank Svetloslav Ivantchev for his help in programming Ana Saracho for her participation in the early stages of the paper and Peter Biró Marilda Sotomayor Federico Valenciano and anonymous referees for their comments and suggestions This research has been supported by the University of the Basque Country under project 1/UPV 00031321HA7903/2000 and project GIU06/44 and by the Spanish Ministerio de Educación y Ciencia under project SEJ200605455 cofunded by FEDER and project BEC20000875 It has also benefited from the Acción Integrada HF20060021/EGIDEPicasso


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:


Search Result: