Why do stable clearinghouses work so well? -- Small sets of stable matchings in typical environments, and the limits-on-manipulation theorem of Demange, Gale and Sotomayor (Q908186): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a characterization of stable matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in Large Matching Markets with Complementarities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal truncation in matching markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3066116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Strategy Structure of Two-Sided Matching Markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A further note on the stable matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machiavelli and the Gale-Shapley Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core many-to-one matchings by fixed-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fixed-Point Approach to Stable Matchings and Some Applications / 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: Some remarks on the stable matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ms. Machiavelli and the Stable Matching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching of like rank and the size of the core in the marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamics of Reorganization in Matching Markets: A Laboratory Experiment Motivated by A Natural Experiments* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of partitioning games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Matching, Coalition Formation, and Gross Substitutes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable husbands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable marriage assignment for unequal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Economics of Matching: Stability and Incentives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentive compatibility in a market with indivisible goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Misrepresentation and stability in the marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The college admissions problem is not equivalent to the marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior points in the core of two-sided matching markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The College Admissions Problem Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment game. I: The core / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonconstructive elementary proof of the existence of stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lattice structure of the set of stable outcomes of the multiple partners assignment game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of stable outcomes and the lattice property for a unified matching market / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary non-constructive proof of the non-emptiness of the core of the housing market of Shapley and Scarf / rank
 
Normal rank

Latest revision as of 10:37, 11 July 2024

scientific article
Language Label Description Also known as
English
Why do stable clearinghouses work so well? -- Small sets of stable matchings in typical environments, and the limits-on-manipulation theorem of Demange, Gale and Sotomayor
scientific article

    Statements

    Why do stable clearinghouses work so well? -- Small sets of stable matchings in typical environments, and the limits-on-manipulation theorem of Demange, Gale and Sotomayor (English)
    0 references
    0 references
    0 references
    3 February 2016
    0 references
    0 references
    stable matching
    0 references
    market design
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references