The stable marriage problem is to find a matching between men and women, considering
preference lists in which each person expresses his/her preference over the members of the …

This paper considers a parking competition game where a finite number of vehicles from
different origins compete for the same number of parking spaces located at various places in …

Stable matching is a classical combinatorial problem that has been the subject of intense
theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and …

Abstract The function, f (n), represents the maximum number of stable matchings possible in
an instance of size n of the stable marriage problem. It is shown that f (n) is a strictly …

This paper proposes a matching model to build resilient and robust systems. Current
systems require huge amounts of information that may not be available in a disaster …

We consider two approaches to the stable marriage problem: proposal algorithms and
describing the stable matching polytope using linear inequalities. We illuminate the …

The stable marriage problem (SMP) seeks matchings between n women and n men which
would result in stability, and not lead to divorce or extramarital affairs. We have introduced a …

1. INTRODUCTION. Over thirty years ago, David Gale formulated the marriage problem or
marriage game. It concerns two distinct finite sets of players, M and W, variously interpreted …

We give some upper bounds on the maximum number of stable matchings in the Gale–
Shapley marriage model with n men and n women. We also characterize, with the use of …

Gale and Shapley's stable assignment problem has been extensively studied, applied, and
extended. In the context of school choice, mechanisms often aim at finding an assignment …