Stable Matching (Q40360)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Stable_Matching
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stable Matching |
AFP entry Stable_Matching |
Statements
Peter Gammie
0 references
We mechanize proofs of several results from the matching with contracts literature, which generalize those of the classical two-sided matching scenarios that go by the name of stable marriage. Our focus is on game theoretic issues. Along the way we develop executable algorithms for computing optimal stable matches.
0 references
0 references
24 October 2016
0 references
Stable Matching (English)
0 references
