Abstract
The stable matching problem has many applications to real world markets and efficient centralized algorithms are known. However, little is known about the decentralized case. Several natural randomized algorithmic models for this setting have been proposed but they have worst case exponential time in expectation. We present a novel structure associated with a stable matching on a matching market. Using this structure, we are able to provide a finer analysis of the complexity of a subclass of decentralized matching markets. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Hoffman, M., Moeller, D., & Paturi, R. (2013). Jealousy graphs: Structure and complexity of decentralized stable matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8289 LNCS, pp. 263–276). https://doi.org/10.1007/978-3-642-45046-4_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
