Efficient resource allocation under multi-unit demand
From MaRDI portal
Publication:2437801
DOI10.1016/j.geb.2013.06.005zbMath1282.91167OpenAlexW2019944844MaRDI QIDQ2437801
Publication date: 13 March 2014
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2013.06.005
Related Items (14)
Overlapping multiple object assignments ⋮ When is the deferred acceptance mechanism responsive to priority-based affirmative action? ⋮ Fictitious students creation incentives in school choice problems ⋮ Strategy‐proof and group strategy‐proof stable mechanisms: An equivalence ⋮ Stable and efficient resource allocation under weak priorities ⋮ Pareto stability in two-sided many-to-many matching with weak preferences ⋮ Strategy-proof assignment of multiple resources ⋮ Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization ⋮ Acyclic priority profiles in school choice: characterizations ⋮ Two-sided strategy-proofness in many-to-many matching markets ⋮ Resource allocation on the basis of priorities under multi-unit demand ⋮ On the equivalence of the Boston and top trading cycles school choice mechanisms ⋮ Nash implementation on the basis of general priorities ⋮ Serial rules in a multi-unit Shapley-Scarf market
Cites Work
- Unnamed Item
- Unnamed Item
- Improving schools through school choice: a market design approach
- Many-to-many matching with max-min preferences
- Strategy-proof, efficient, and nonbossy quota allocations
- Constrained school choice
- Incentives in the probabilistic serial mechanism
- Efficient assignment respecting priorities
- Stable many-to-many matchings with contracts
- The college admissions problem is not equivalent to the marriage problem
- A study of choice correspondences in economies with a variable number of agents
- A tale of two mechanisms: Student placement
- Incentives in two-sided matching with random stable mechanisms
- Manipulation via capacities in two-sided matching markets
- On two kinds of manipulation for school choice problems
- House allocation with existing tenants
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems
- Robust stability in matching markets
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- Axioms for Deferred Acceptance
- Machiavelli and the Gale-Shapley Algorithm
- The Economics of Matching: Stability and Incentives
- Job Matching, Coalition Formation, and Gross Substitutes
- College Admissions and the Stability of Marriage
- A new solution to the random assignment problem.
This page was built for publication: Efficient resource allocation under multi-unit demand
