Strategy-proof Pareto-improvement
From MaRDI portal
Publication:2415985
DOI10.1016/j.jet.2019.01.004zbMath1411.91330OpenAlexW2915182042MaRDI QIDQ2415985
Publication date: 23 May 2019
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jet.2019.01.004
strategy-proofnessschool choicepivotal mechanismPareto-improvementPareto-constrained participation-maximality
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)
Related Items (15)
Decentralized college admissions under single application ⋮ Constrained stability in two-sided matching markets ⋮ Essentially stable matchings ⋮ When does an additional stage improve welfare in centralized assignment? ⋮ Reallocation with priorities and minimal envy mechanisms ⋮ Strategy-proof allocation with outside option ⋮ School choice with preference rank classes ⋮ WARP and combinatorial choice ⋮ School choice with transferable student characteristics ⋮ Outside options in neutral allocation of discrete resources ⋮ Two school systems, one district: what to do when a unified admissions process is impossible ⋮ Obvious manipulations ⋮ Slot-specific priorities with capacity transfers ⋮ Improving efficiency in school choice under partial priorities ⋮ Dynamic reserves in matching markets
Cites Work
- Strategy-proof stochastic assignment
- School choice with controlled choice constraints: hard bounds versus soft bounds
- On stable and strategy-proof rules in matching markets with contracts
- On the operation of multiple matching markets
- Efficient assignment respecting priorities
- A tale of two mechanisms: Student placement
- Top dominance and the possibility of strategy-proof stable solutions to matching problems
- Stable schedule matching under revealed preference.
- A class of multipartner matching markets with a strong lattice structure
- WARP and combinatorial choice
- On cores and indivisibility
- The strategy-proof provision of public goods under congestion and crowding preferences
- Choosing the level of a public good when agents have an outside option
- Strategy-proof improvements upon deferred acceptance: a maximal domain for possibility
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching
- Characterizing the Vickrey combinatorial auction by induction
- Strategy-proof assignment on the full preference domain
- Two-sided matching with indifferences
- Second-best efficiency of allocation rules: strategy-proofness and single-peaked preferences with multiple commodities
- Constrained-optimal strategy-proof assignment: beyond the Groves mechanisms
- Characterizations of strategy-proof and fair mechanisms for allocating indivisible goods
- Matching With (Branch-of-Choice) Contracts at the United States Military Academy
- Incentives in Teams
- Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods
- Groves' Scheme on Restricted Domains
- Strategy-proofness and Essentially Single-valued Cores
- Effective affirmative action in school choice
- Matching with slot-specific priorities: Theory
- (Il)legal Assignments in School Choice
- School choice under partial fairness
- Strategy-Proofness Makes the Difference: Deferred-Acceptance with Responsive Priorities
- Efficient Resource Allocation on the Basis of Priorities
- A Fixed-Point Approach to Stable Matchings and Some Applications
- College Admissions and the Stability of Marriage
This page was built for publication: Strategy-proof Pareto-improvement
