The paper describes situations where commitment via delegation is beneficial, even when the delegation is unobservable and the players have the option to play the game themselves. The potentiual for such benefits depends on the type of delegation, incentive versus instructive, the possibility of...

The sensitivity of Nash equilibrium to strategic and informational details presents a difficulty in applying it to games which are not fully speci?ed. Structurally-robust Nash equilibria are less sensitive to such details. More- over, they arrise naturally in important classes of games that have...

In a recurring game, a stage game is played consecutively by different groups of players, with each group receiving information about the play of earlier groups. Starting with uncertainty about the distribution of types in the population, late groups may learn to play a correct Bayesian...

In a stochastic game of dividing a cake by majority, the simplest equilibria are the Baron-Ferejohn (1989) ones. The formal definition of simplicity and the computational methods of the equilibria make use of an automaton measure of complexity adopted for stochastic games.

A central question in game theory and artificial intelligence is how a rational agent should behave in a complex environment, given that it cannot perform unbounded computations. We study strategic aspects of this question by formulating a simple model of a game with additional costs...

In Bayesian environments with private information, as described by the types of Harsanyi, how can types of agents be (statistically) disassociated from each other and how are such disassociations reflected in the agents’ knowledge structure? Conditions studied are (i) subjective independence...