Almost Stable Matchings by Truncating the Gale–Shapley Algorithm

We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose–accept rounds executed by the Gale–Shapley algorithm for the stable marriage problem. Consequently, the participants can arrive at an almost stable matching even without full information about t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 58; H. 1; S. 102 - 118
Hauptverfasser:	Floréen, Patrik, Kaski, Petteri, Polishchuk, Valentin, Suomela, Jukka
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer-Verlag 01.09.2010
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Distributed stable matching Local algorithms Constant-time randomised algorithms Almost stable matching
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!