Showing 1 - 10 of 106
In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...
Persistent link: https://www.econbiz.de/10011694986
to either one of its two agents. Together with efficiency, and a version of equal treatment of equals, these properties …
Persistent link: https://www.econbiz.de/10011689320
the MPW rule is the unique rule satisfying \textit{strategy-proofness}, \textit{efficiency}, \textit …
Persistent link: https://www.econbiz.de/10011673396
In this paper, we show that in pure exchange economies where the number of goods equals or exceeds the number of agents, any Pareto-efficient and strategy-proof allocation mechanism always allocates the total endowment to some single agent even if the receivers vary.
Persistent link: https://www.econbiz.de/10011744271
Floor constraints are a prominent feature of many matching markets, such as medical residency, teacher assignment, and military cadet matching. We develop a theory of matching markets under floor constraints. We introduce a stability notion, which we call floor respecting stability, for markets...
Persistent link: https://www.econbiz.de/10012806304
The paper considers a voting model where each voter's type is her preference. The type graph for a voter is a graph whose vertices are the possible types of the voter. Two vertices are connected by an edge in the graph if the associated types are "neighbors." A social choice function is locally...
Persistent link: https://www.econbiz.de/10012806446
This paper analyzes strategy-proof collective choice rules when individuals have single-crossing preferences on a finite and ordered set of social alternatives. It shows that a social choice rule is anonymous, unanimous, and strategy-proof on a maximal single-crossing domain if and only if it is...
Persistent link: https://www.econbiz.de/10011699125
Strategy-proofness, requiring that truth-telling be a dominant strategy, is a standard concept in social choice theory. However, this concept has serious drawbacks. In particular, many strategy-proof mechanisms have multiple Nash equilibria, some of which produce the wrong outcome. A possible...
Persistent link: https://www.econbiz.de/10011702527
The paper proves the following result: every path-connected domain of preferences that admits a strategy-proof, unanimous, tops-only random social choice function satisfying a compromise property, is single-peaked. Conversely, every single-peaked domain admits a random social choice function...
Persistent link: https://www.econbiz.de/10011671964
In this paper, we revisit a long-standing question on the structure of strategy-proof and Pareto-efficient social choice functions (SCFs) in classical exchange economies (Hurwicz (1972)). Using techniques developed by Myerson in the context of auction-design, we show that in a specific...
Persistent link: https://www.econbiz.de/10011674603