An Implementation Approach to Rotation Programs

We study rotation programs within the standard implementation frame-work under complete information. A rotation program is a myopic stableset whose states are arranged circularly, and agents can effectively moveonly between two consecutive states. We provide characterizing conditionsfor the implementation of efficient rules in rotation programs. Moreover,we show that the conditions fully characterize the class of implementablemulti-valued and efficient rules