Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms

Abstract

Introduction, definitions, and examples Existence of a stable matching: the fundamental algorithm Principle of deferred decisions: coupon collecting Theoretical developments: application to the shortest path Searching a table by hashing mean behavior of thefundamental algorithm Implementing the fundamental algorithm Research problems Annotated bibliography Appendix A. Later developments Appendix B. Solutions to exercises Index.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 217 citations exist upstream.