An Implementation Approach to Rotation Programs

TL;DR

This paper analyzes how rotation programs can be implemented within a standard framework, providing conditions for implementing efficient multi-valued rules where agents move between consecutive states in a circular arrangement.

Contribution

It offers a complete characterization of the conditions under which efficient multi-valued rules can be implemented in rotation programs.

Findings

Characterization of implementable efficient rules in rotation programs

Conditions fully describe the class of multi-valued, efficient rules

Rotation programs facilitate agents' movement between consecutive states

Abstract

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