![]() |
CiteULike | ![]() |
YoshiY's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Incentives in the probabilistic serial mechanism☆by: Fuhito Kojima, Mihai Manea
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThe probabilistic serial mechanism (Bogomolnaia and Moulin, 2001 [9] ) is ordinally efficient but not strategy-proof. We study incentives in the probabilistic serial mechanism for large assignment problems. We establish that for a fixed set of object types and an agent with a given expected utility function, if there are sufficiently many copies of each object type, then reporting ordinal preferences truthfully is a weakly dominant strategy for the agent (regardless of the number of other agents and their preferences). The non-manipulability and the ordinal efficiency of the probabilistic serial mechanism support its implementation instead of random serial dictatorship in large assignment problems.
BibTeX record
RIS record