Economics Research Seminar Series: Yuki Tamura
A Characterization of Obviously Strategy-proof Rules for Object Reallocation Problems with Single-peaked Preferences. Dr Yuki Tamura, NYU Abu Dhabi.
For object reallocation problems, Bade (2019) defines a new rule, the “crawler”, and shows that on the domain of single-peaked preferences, this rule satisfies efficiency, the endowments lower bounds, and obvious strategy-proofness. We generalize the crawler, obtaining a family of rules that we call “generalized crawlers”, and show that a rule satisfies efficiency, the endowments lower bounds, and obvious strategy-proofness if and only if it is a generalized crawler. We also provide a structural analysis of the family of generalized crawlers.