We introduce a new solution concept for models of coalition formation, called the myopic stable set. The myopic stable set is defined for a very general class of social environments and allows for an infinite state space. We show that the myopic stable set exists and is non-empty. Under minor...

Rotation programs are widely used in societies. Some examples are job rotations, rotation schemes in the management of common-pool resources, and rotation procedures in fair division problems. We study rotation programs via the implementation of Pareto efficient social choice rules under...

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...

Rotation programs are widely used in societies. Some examples are job rotations, rotation schemes in the management of common-pool resources, and rotation procedures in fair division problems. We study rotation programs via the implementation of Pareto efficient social choice rules under...

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...

We introduce a new solution concept for models of coalition formation, called the myopic stable set. The myopic stable set is defined for a very general class of social environments and allows for an infinite state space. We show that the myopic stable set exists and is non-empty. Under minor...