On two kinds of manipulation for school choice problems (Q1762420): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
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 / OpenAlex ID
 
Property / OpenAlex ID: W2167624657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tale of two mechanisms: Student placement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple random assignment problem with a unique solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proofness and population-monotonicity for house allocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Resource Allocation on the Basis of Priorities / 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: Constrained school choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two competing mechanisms for priority-based allocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: School Choice with Consent<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Procedurally fair and stable matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed strategies in games of capacity manipulation in hospital-intern markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Can Manipulations be Avoided in Two-Sided Matching Markets? -- Maximal Domain Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust stability in matching markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games of capacity manipulation in hospital-intern markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proofness and the strict core in a market with indivisibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized matching mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable marriage assignment for unequal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategyproof Assignment by Hierarchical Exchange / 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: The college admissions problem is not equivalent to the marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak versus strong domination in a market with indivisible goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in two-sided matching with random stable mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cores and indivisibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation via capacities in two-sided matching markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can pre-arranged matches be avoided in two-sided matching markets? / rank
 
Normal rank

Latest revision as of 22:48, 5 July 2024

scientific article
Language Label Description Also known as
English
On two kinds of manipulation for school choice problems
scientific article

    Statements

    On two kinds of manipulation for school choice problems (English)
    0 references
    0 references
    26 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    school choice
    0 references
    student-optimal stable mechanism
    0 references
    top trading cycles
    0 references
    Boston mechanism
    0 references
    acyclicity
    0 references
    0 references
    0 references