The model of congestion games is widely used to analyze games related to traffic and communication. A central property of these games is that they are potential games and hence posses a pure Nash equilibrium. In reality, it is often the case that some players cooperatively decide on their joint...

We study an incomplete information mechanism design problem with three peculiarities. First, access to agents’ private information is costly and unobservable. Second, the mechanism may communicate sequentially with the agents. Third, the mechanism designer and all the agents share a common...

Bayesian Statisticians, decision theorists, and game theorists often use Bayesian representations to describe the probability distribution governing the evolution of a stochastic process. Generally, however, one given distribution has infinitely many different Bayesian representations. This...

The asymptotic value, introduced by Kannai in 1966, is an asymptotic approach to the notion of the Shapley value for games with infinitely many players. A vector measure game is a game v where the worth v(S) of a coalition S is a function f of ?(S) where ? is a vector measure. Special classes of...

Saborian [8], following Green [4], studies a class of repeated games where a player's payoff depends on his stage action and an anonymous aggregate outcome, and shows that long-run players behave myopically in any equilibrium of such games. In this paper we extend Sabourian's results to games...