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

Many industries are made of a few big firms, which are able to manipulate the market outcome, and of a host of small businesses, each of which has a negligible impact on the market. We provide a general equilibrium framework that encapsulates both market structures. Due to the higher toughness...

The literature on supermodular optimization and games is surveyed from the perspective of potential users in economics. This methodology provides a new approach for comparative statics based only on critical assumptions, and allows a general analysis of games with strategic complementarities....

We analyze a model of a vertically differentiated duopoly with two regions. These two locations differ for the market size or for the distribution of the willingness to pay for quality of their consumers. Firms sequentially choose to settle in one region and then simultaneously compete in...