On a conjecture by Gale about one-sided matching problems (Q2277345)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a conjecture by Gale about one-sided matching problems |
scientific article; zbMATH DE number 4197684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a conjecture by Gale about one-sided matching problems |
scientific article; zbMATH DE number 4197684 |
Statements
On a conjecture by Gale about one-sided matching problems (English)
0 references
1990
0 references
Matching problems are decision problems involving the assignment of n objects to n agents. A mechanism is a rule for making such matching and matchings are allowed to be a probability distribution over pure matchings. This paper shows that for \(n\geq 3\), there exists no mechanism which satisfies symmetry, Pareto optimality and strategy-proofness. Some extensions of this result to more general matching problems are also considered.
0 references
Matching problems
0 references
assignment
0 references
probability distribution over pure matchings
0 references
symmetry
0 references
Pareto optimality
0 references
strategy-proofness
0 references
0.86672634
0 references
0.8604645
0 references
0.85852575
0 references
0.8577244
0 references
0 references
0.85286456
0 references
0.85254556
0 references
