I study the effect of public information disclosure in a market setting where private information acquisition exhibits strategic complementarity. To overcome the issue of equilibrium multiplicity, I introduce heterogeneous information cost and imperfect information on the cost distribution. The...

We show that supermodular games satisfying sequential better-reply security possess a pure strategy perfect equilibrium and a strategically stable set of pure strategies. We illustrate that, in continuous supermodular games, perfect equilibria may contain weakly dominated actions. Moreover, in...

We furnish conditions on the primitives of a Bayesian game that guarantee the existence of a Bayes-Nash equilibrium. By allowing for payoff discontinuities in actions, we cover various applications that cannot be handled by extant results.

We obtain conditions on the primitives of a Bayesian game with infinitely many types and/or strategies that ensure the existence of a perfect Bayes-Nash equilibrium. The main existence results are illustrated in the context of all-pay auctions.

The notion of communication equilibrium extends Aumann's [3] correlated equilibrium concept for complete information games to the case of incomplete information. This paper shows that this solution concept has the following property: for the class of incomplete information games with compact...

In this paper we study a large class of non-atomic games arising from interactions on the Internet, such as many users sharing a network link, researchers accessing a database or web server, subscribers to a network services provider trying to gain access to the modem pool and many more. We...

This paper describes the results of simulation experiments performed on a suite of learning algorithms. We focus on games in network contexts. These are contexts in which (1) agents have very limited information about the game; users do not know their own (or any other agent's) payoff function,...

We address the problem of learning and implementation on the Internet. When agents play repeated games in distributed environments like the Internet, they have very limited {\em a priori} information about the other players and the payoff matrix, and the play can be highly asynchronous....

We show that local potential maximizer (\cite{morris+05}) with constant weights is stochastically stable in the log-linear dynamics provided that the payoff function or the associated local potential function is supermodular. We illustrate and discuss, through a series of examples, the use of...

We apply farsighted stable set to two versions of Hotelling's location games: one with linear market and another with circular market. It is shown that there always exists a farsighted stable set in both games. In particular, the set of all location profiles that yields equal payoff across all...