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

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 58; no. 1; pp. 102 - 118
Main Authors:	Floréen, Patrik, Kaski, Petteri, Polishchuk, Valentin, Suomela, Jukka
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.09.2010
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!