We present a feasible strategic market mechanism with finitely many agents whose Nash, semi-strong Nash and coalition-proof Nash equilibria fully implement the Walrasian equilibria. We define a strategic equilibrium concept, called correlated semi-strong equilibrium, and show that the Walrasian...

We explore the consequences of the assumptions used in modern cryptographywhen applied to repeated games with public communication. Technically speaking, we model agents by polynomial Turing machinesand assume the existence of a trapdoor function. Under these conditions, we prove a Folk Theorem...

We present a feasible strategic market mechanism with .nitely many agents whose Nash, semi-strong Nash and coalition-proof Nash equilibria fully im plement the Walrasian equilibria. We define a strategic equilibrium conce pt, called correlated semi-strong equilibrium,and show that the Walrasian...