The stable marriage problem is a game theoretic model introduced by Gale and Shapley (1962). It involves two sets of players referred to as men and women. A marriage is a set of disjoint pairs, where each pair consists of a woman and a man. Each individual has a strict linear order of preference ove
✦ LIBER ✦
The stable admissions polytope
✍ Scribed by Mourad Baïou; Michel Balinski
- Publisher
- Springer-Verlag
- Year
- 2000
- Tongue
- English
- Weight
- 128 KB
- Volume
- 87
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On the stable marriage polytope
✍
Guillaume Ratier
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 727 KB
Gear composition and the stable set poly
✍
A. Galluccio; C. Gentile; P. Ventura
📂
Article
📅
2008
🏛
Elsevier Science
🌐
English
⚖ 414 KB
We present a new graph composition that produces a graph G from a given graph H and a fixed graph B called gear and we study its polyhedral properties. This composition yields counterexamples to a conjecture on the facial structure of STAB(G) when G is claw-free.
Critical Facets of the Stable Set Polyto
✍
László Lipták; László Lovász
📂
Article
📅
2001
🏛
Springer-Verlag
🌐
English
⚖ 355 KB
Median Stable Matching for College Admis
✍
Bettina Klaus; Flip Klijn
📂
Article
📅
2006
🏛
Springer-Verlag
🌐
English
⚖ 142 KB
The stable set polytope of quasi-line gr
✍
Friedrich Eisenbrand; Gianpaolo Oriolo; Gautier Stauffer; Paolo Ventura
📂
Article
📅
2008
🏛
Springer-Verlag
🌐
English
⚖ 342 KB
More on the stable, generalized stable,
✍
Houy Nicolas
📂
Article
📅
2009
🏛
Springer
🌐
English
⚖ 147 KB