The Crawler: Two Equivalence Results for Object (Re)allocation Problems when Preferences Are Single-peaked

12/14/2019 ∙ by Yuki Tamura, et al. ∙ 0

For object reallocation problems, if preferences are strict but otherwise unrestricted, the Top Trading Cycle rule (TTC) is the leading rule: It is the only rule satisfying efficiency, the endowment lower bound, and strategy-proofness; moreover, TTC coincides with the core. However, on the subdomain of single-peaked preferences, Bade (2019a) defines a new rule, the "crawler", which also satisfies the first three properties. Our first theorem states that the crawler and a naturally defined "dual" rule are actually the same. Next, for object allocation problems, we define a probabilistic version of the crawler by choosing an endowment profile at random according to a uniform distribution, and applying the original definition. Our second theorem states that this rule is the same as the "random priority rule" which, as proved by Knuth (1996) and Abdulkadiroglu and Sönmez (1998), is equivalent to the "core from random endowments".

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.