On behavioral implementation

Official URL: http://risc01.sabanciuniv.edu/record=b1819801 (Table of Contents)

This thesis studies implementation under complete information with boundedly rational agents. We introduce a notion called maximal choice set and define an associated maximal choice monotonicity condition on social choice rules. We show that this condition is necessary for Nash implementation when choice correspondences satisfy Sen’s property . Moreover, we prove that maximal choice monotonicity and no veto-power suffice for Nash implementation when agents have unique maximal choice sets. Our results, following Maskin (1999), provide some convenience when evaluating the Nash implementability of social choice correspondences without checking for the existence of the associated Moore and Repullo sets.