Micro Seminar 
Time: 12:15 pm – 13:30 pm
Date: 11th of January
Room : 3001

Yuki Tamura (NYU Abu Dhabi) “Obviously Strategy-proof Rules for Object Reallocation”

Abstract : For object reallocation problems, Bade (2019) defines a 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. Her result raises the question if other rules exist that satisfy these properties. We provide a complete answer to this question. Based on the idea of the crawler, we obtain a family of rules that we call “crawler-jumper rules”. We show that a rule satisfies efficiency, the endowments lower bounds, and obvious strategy-proofness if and only if it is a crawler-jumper rule.

Organizers: Julien COMBE