We give a characterization of the equilibrium payoffs of a dynamic game, which is a stochastic game where the transition function is either one or zero and players can only use pure actions in each stage. The characterization is in terms of convex combinations of connected stationary strategies;...

We consider the infinitely-repeated prisoners' dilemma with lexicographic complexity costs, where transitional complexity between states is included as one aspect of overall strategic complexity. We prove that a full folk theorem obtains in presence of any level of perfection of the equilibrium...

For the many-to-one matching model in which firms have substitutable and quota q−separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. Therefore, in centralized markets like entry-level professional labor...

We define different concepts of group strategy-proofness for social choice functions. We discuss the connections between the defined concepts under different assumptions on their domains of definition. We characterize the social choice functions that satisfy each one of them and whose ranges...