Pair implementation

Official URL: http://risc01.sabanciuniv.edu/record=b2311541_(Table of contents)

This thesis analyzes the implementation problem under complete information in a societal environment where all agents are grouped in pairs. We introduce a new equilibrium notion called pair-Nash equilibrium and define a related pair-monotonicity notion on social choice rules and show that it is necessary for implementation in pair-Nash equilibrium, i.e., pair-implementation. Moreover, we introduce the pairimplementability condition and prove that it suffices for pair-implementation. Our results extend implementation results of Maskin (1999) and Moore and Repullo (1990) to the pair-structure