An implementation approach to rotation programs

We study rotation programs within the standard implementation framework under complete information. A rotation program is a myopic stable set whose states are arranged circularly, and agents can effectively move only between two consecutive states. We provide characterizing conditions for the implementation of efficient rules in rotation programs. Moreover, we show that the conditions fully characterize the class of implementable multi-valued and efficient rules.