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
PDF AbstractTasks
Datasets
Add Datasets
introduced or used in this paper
Results from the Paper
Submit
results from this paper
to get state-of-the-art GitHub badges and help the
community compare results to other papers.
Methods
No methods listed for this paper. Add
relevant methods here
