✦ LIBER ✦

A number of stable matchings in models of the Gale–Shapley type

✍ Scribed by Drgas-Burchardt, Ewa; Świtalski, Zbigniew

Book ID: 122338777
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 371 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.06.031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Stable matchings and equilibrium outcome

Stable matchings and equilibrium outcomes of the Gale-Shapley's algorithm for the marriage problem

✍ Lin Zhou 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 391 KB

Capacity sharing in a network of enterpr

Capacity sharing in a network of enterprises using the Gale–Shapley model

✍ Pierluigi Argoneto, Paolo Renna 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 323 KB

The number of maximum matchings in a tre

The number of maximum matchings in a tree

✍ Clemens Heuberger; Stephan Wagner 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 700 KB

The number of perfect matchings in a hyp

The number of perfect matchings in a hypercube

✍ Niall Graham; Frank Harary 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 243 KB

A perfect matching or a l-factor of a graph G is a spanning subgraph that is regular of degree one. Hence a perfect matching is a set of independent edges which matches all the nodes of G in pairs. Thus in a hypercube parallel processor, the number of perfect matchings evaluates the number of diff

On the Number of Perfect Matchings in a

On the Number of Perfect Matchings in a Bipartite Graph

✍ de Carvalho, Marcelo H.; Lucchesi, Cláudio L.; Murty, U. S. R. 📂 Article 📅 2013 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 471 KB

Stable matching in a common generalizati

Stable matching in a common generalization of the marriage and assignment models

✍ Kimmo Eriksson; Johan Karlander 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 150 KB