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...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 58; číslo 1; s. 102 - 118
Hlavní autoři:	Floréen, Patrik, Kaski, Petteri, Polishchuk, Valentin, Suomela, Jukka
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.09.2010
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!