A (pure) strategy in a repeated game is a mapping from histories, or, more generally, signals, to actions. We view the implementation of such a strategy as a computational procedure and attempt to capture in a formal model the following intuition: as the game proceeds, the amount of information...

This paper analyzes a stochastic model of evolution in normal form games. The long-run behavior of individuals in this model is investigated in the limit where mutation rates tend to zero, while the expected number of mutations, and hence population sizes, tend to infinity. It is shown that...

We derive an almost non cooperative (ANC) analytical payoff function for all three-agent Aumann-Myerson (1988) games, and tractable ones exist for all three-agent A-M-like network games with any fixed valuation, in contrast to restricted results in the literature, if at all. Unlike link proposal...

We examine the formation of networks among a set of players whose payoffs depend on the structure of the network. We focus on games where players may promise or demand transfer payments when forming links. If players may only make such transfers on the links they are directly involved with, then...

We study a repeated Nash demand game, where bargainers follow a fictitious play procedure after their one-shot decision on demand in the initial period. In the reduced static game they play at the initial period, all the epsilon-equilibria are clustered around the division corresponding to the...

A core allocation of a complete information economy can be characterized as one that would not be unanimously rejected in favor of another feasible alternative by any coalition. We use this test of coalitional voting in an incomplete information environment to formalize a notion of resilience....

This paper reinterprets the gamma-core (Chander and Tulkens (1995, 1997)) and justifies it as well as its prediction that the efficient coalition structure is stable in terms of the coalition formation theory. It is assumed that coalitions can freely merge or break apart, are farsighted (that...

We investigate game theoretic models of entwork formation that are based on individual actions only. Our approach is grounded in three simple and realistic principles. (1) Link formation should be a binary process of consent. (2) Link formation should be costly. (3) The class of network payoff...

The paper studies equilibrium selection in supermodular games based on a class of perfect foresight dynamics, introduced by Matsui and Matsuyama (JET 1995) and further developed by Hofbauer and Sorger (JET 1999, IGTR 2002) and Oyama (JET 2002). A normal form game is played repeatedly in a large...