On a conjecture by Gale about one-sided matching problems (Q2277345): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q61440681, #quickstatements; #temporary_batch_1705868726170 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5834711 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: College Admissions and the Stability of Marriage / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Manipulation of Voting Schemes: A General Result / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Straightforwardness of Game Forms with Lotteries as Outcomes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Allocation of Public Goods: A Solution to the "Free Rider" Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5519710 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:34, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a conjecture by Gale about one-sided matching problems |
scientific article |
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
