Coalitional strategy-proofness and resource monotonicity for house allocation problems

@article{Kesten2009CoalitionalSA,
  title={Coalitional strategy-proofness and resource monotonicity for house allocation problems},
  author={Onur Kesten},
  journal={International Journal of Game Theory},
  year={2009},
  volume={38},
  pages={17-21}
}
  • Onur Kesten
  • Published 1 March 2009
  • Economics
  • International Journal of Game Theory
We consider the problem of allocating houses to agents when monetary compensations are not allowed. We present a simple and independent proof of a result due to Ehlers and Klaus (Int J Game Theory 32:545–560, 2004) that characterizes the class of rules satisfying efficiency, strategy-proofness, resource monotonicity and nonbossiness. 
Strategy-proofness and identical preferences lower bound in allocation problem of indivisible objects
We study an allocation problem of heterogeneous indivisible objects among agents without money. Each agent receives at most one object and prefers any object to nothing. We identify the class of
Endogenous budget constraints in the assignment game
This paper studies economies with indivisible goods and budget-constrained agents with unit-demand who act as both sellers and buyers. In prior literature on the existence of competitive equilibrium,
Non-bossy single object auctions
We study deterministic single object auctions in the private values environment. We show that an allocation rule is implementable (in dominant strategies) and non-bossy if and only if it is a
Outside Options in Neutral Allocation of Discrete Resources
Serial dictatorships have emerged as natural direct mechanisms in the literature on the allocation of indivisible goods without transfers. They are the only neutral and group–strategy-proof
House Allocation via Deferred-Acceptance
We study the simple model of assigning indivisible and heterogenous objects (e.g., houses, jobs, offices, etc.) to agents. Each agent receives at most one object and monetary compensations are not
A Characterization of the Top Trading Cycles Mechanism for the School Choice Problem
Abstract This paper characterizes the top trading cycles mechanism for the school choice problem. Schools may have multiple available seats to be assigned to students. For each school a strict
2 House Allocation 2 . 1 The Model and Notation
We study the simple model of assigning indivisible and heterogenous objects (e.g., houses, jobs, offices, etc.) to agents. Each agent receives at most one object and monetary compensations are not
Incentive Compatible Allocation and Exchange of Discrete Resources
Allocation and exchange of discrete resources such as kidneys, school seats, and many other resources for which agents have single-unit demand is conducted via direct mechanisms without monetary
Pareto-optimal matching allocation mechanisms for boundedly rational agents
TLDR
The large set of hierarchical exchange mechanisms which contains serial dictatorship as well as Gale’s top trading cycles is considered and it is shown that this set is nested between the sets of Pareto optima according to the restrictive and the permissive notion.
A Theory of House Allocation and Exchange Mechanisms ∗
We study the allocation and exchange of indivisible objects without monetary transfers. In market design literature, some problems that fall in this category are the house allocation problem with and
...
...

References

SHOWING 1-8 OF 8 REFERENCES
Resource-monotonicity for house allocation problems
TLDR
All rules satisfying efficiency, independence of irrelevant objects, and resource-monotonicity are described.
Strategyproof Assignment by Hierarchical Exchange
We give a characterization of the set of group-strategyproof, Pareto-optimal, and reallocation-proof allocation rules for the assignment problem, where individuals are assigned at most one
Efficient Resource Allocation on the Basis of Priorities
Many institutions allocate resources by non-market mechanisms based on priorities. In this paper, we introduce a model of resource allocation on the basis of priorities and address the following
A Tale of Two Mechanisms: Student Placement
Abstract A new class of matching problems that models centralized college admissions via standardized tests is presented. The allocation mechanism that is used in real-life applications of this
College Admissions and the Stability of Marriage
  • 1962