Table of Contents

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.

Reviews

This short book will provide extremely enjoyable reading to anyone with an interest in discrete mathematics and algorithm design. Mathematical Reviews Anyone would enjoy reading this book. If one had to learn French first, it would be worth the effort. Computing Reviews