Correlated equilibrium payoffs and public signalling in absorbing games

An absorbing game is a repeated game where some action combinations are absorbing, in the sense that whenever they are played, there is a positive probability that the game terminates, and the players receive some terminal payoff at every future stage.  We prove that every multi-player absorbing game admits a correlated equilibrium payoff. In other words, for every ε>0 there exists a probability distribution p _ε over the space of pure strategy profiles that satisfies the following. With probability at least 1−ε, if a pure strategy profile is chosen according to p _ε and each player is informed of his pure strategy, no player can profit more than ε in any sufficiently long game by deviating from the recommended strategy. Received: April 2001/Revised: June 4, 2002     

Bounding the inefficiency of Nash equilibria in games with finitely many players

This paper derives bounds on the gap between optimal performance and the performance of Nash equilibria in n-person games with continuous action sets. Specific interesting expressions are obtained for the average efficiency per player in congestion games.     

Characterization of correlated equilibria in stochastic games

A general communication device is a device that at every stage of the game receives a private message from each player, and in return sends a private signal to each player; the signals the device sends depend on past play, past signals it sent, and past messages it received.  An autonomous correlation device is a general communication device where signals depend only on past signals the device sent, but not on past play or past messages it received.  We show that the set of all equilibrium payoffs in extended games that include a general communication device coincides with the set of all equilibrium payoffs in extended games that include an autonomous correlation device. A stronger result is obtained when the punishment level is independent of the history. Final version July 2001     

On equilibrium in pure strategies in games with many players

We demonstrate that, if there are sufficiently many players, any Bayesian equilibrium of an incomplete information game can be “ε-purified” . That is, close to any Bayesian equilibrium there is an approximate Bayesian equilibrium in pure strategies. Our main contribution is obtaining this result for games with a countable set of pure strategies. In order to do so we derive a mathematical result, in the spirit of the Shapley–Folkman Theorem, permitting countable strategy sets. Our main assumption is a “large game property,” dictating that the actions of relatively small subsets of players cannot have large affects on the payoffs of other players. E. Cartwright and M. Wooders are indebted to Phillip Reny, Frank Page and two anonymous referees for helpful comments.     

On balanced games with infinitely many players: Revisiting Schmeidler's result

We consider transferable utility cooperative games with infinitely many players and the core understood in the space of bounded additive set functions. We show that, if a game is bounded below, then its core is non-empty if and only if the game is balanced. This finding generalizes Schmeidler (1967) “On Balanced Games with Infinitely Many Players”, where the game is assumed to be non-negative. We also generalize Schmeidler's (1967) result to the case of restricted cooperation too.     

Sequential Stackelberg equilibria in two-person games

The concept of sequential Stackelberg equilibrium is introduced in the general framework of dynamic, two-person games defined in the Denardo contracting operator formalism. A relationship between this solution concept and the sequential Nash equilibrium for an associated extended game is established. This correspondence result, which can be related to previous results obtained by Baar and Haurie (1984), is then used for studying the existence of such solutions in a class of sequential games. For the zero-sum case, the sequential Stackelberg equilibrium corresponds to a sequential maxmin equilibrium. An algorithm is proposed for the computation of this particular case of equilibrium.This research was supported by SSHRC Grant No. 410-83-1012, NSERC Grant No. A4952, and FCAR Grants Nos. 86-CE-130 and EQ-0428.The authors thank T. R. Bielecki and J. A. Filar, who pointed out some mistakes and helped improving the paper.At the time of this research, this author was with GERMA, Ecole Mohammedia d'Ingénieurs, Rabat, Morocco.     

Incentive strategies and equilibria for dynamic games with delayed information

The construction of time-lag incentive strategies for continuous time convex problems is considered. The strategies are affine in the data available and they are represented by means of Stieltjes measures. It is shown how incentive strategies can be used as equilibrium strategies in symmetric games where the decision makers are cooperative.This work was supported by the Research Council for Technology of the Academy of Finland and by the Emil Aaltonen Foundation.     

On weakly correlated and correlated equilibria in discontinuous games

This paper treats of non-zero-sum discontinuous games with compact Hausdorff strategy spaces. It is assumed that the payoff function of each player in the game is bounded, Borel measurable and is upper semicontinuous on his strategy space, for all fixed actions of the remaining players. It is shown that for each ε>0, such games possess weakly correlated ε-epuilibria introduced by Moulin and Vial as extension of correlated equilibria in the sense of Aumann. An upper semicontinuous came having weakly correlated equilibria and no correlated equilibria is discussed in details.     

Inferior players in simple games

Power indices like those of Shapley and Shubik (1954) or Banzhaf (1965) measure the distribution of power in simple games. This paper points at a deficiency shared by all established indices: players who are inferior in the sense of having to accept (almost) no share of the spoils in return for being part of a winning coalition are assigned substantial amounts of power. A strengthened version of the dummy axiom based on a formalized notion of inferior players is a possible remedy. The axiom is illustrated first in a deterministic and then a probabilistic setting. With three axioms from the Banzhaf index, it uniquely characterizes the Strict Power Index (SPI). The SPI is shown to be a special instance of a more general family of power indices based on the inferior player axiom. Received: December 1999/Final version: June 2001     

Iterative computation of noncooperative equilibria in nonzero-sum differential games with weakly coupled players

We study the Nash equilibria of a class of two-person nonlinear, deterministic differential games where the players are weakly coupled through the state equation and their objective functionals. The weak coupling is characterized in terms of a small perturbation parameter . With =0, the problem decomposes into two independent standard optimal control problems, while for 0, even though it is possible to derive the necessary and sufficient conditions to be satisfied by a Nash equilibrium solution, it is not always possible to construct such a solution. In this paper, we develop an iterative scheme to obtain an approximate Nash solution when lies in a small interval around zero. Further, after requiring strong time consistency and/or robustness of the Nash equilibrium solution when at least one of the players uses dynamic information, we address the issues of existence and uniqueness of these solutions for the cases when both players use the same information, either closed loop or open loop, and when one player uses open-loop information and the other player uses closed-loop information. We also show that, even though the original problem is nonlinear, the higher (than zero) order terms in the Nash equilibria can be obtained as solutions to LQ optimal control problems or static quadratic optimization problems.This research was supported in part by the US Department of Energy under Grant DE-FG-02-88-ER-13939.Paper presented at the 29th IEEE Conference on Decision and Control, Honolulu, Hawaii, 1990.     

Quitting games – An example

Quitting games are multi-player sequential games in which, at every stage, each player has the choice between continuing and quitting. The game ends as soon as at least one player chooses to quit; each player i then receives a payoff r _S ⁱ, which depends on the set S of players that did choose to quit. If the game never ends, the payoff to each player is zero.? We exhibit a four-player quitting game, where the “simplest” equilibrium is periodic with period two. We argue that this implies that all known methods to prove existence of an equilibrium payoff in multi-player stochastic games are therefore bound to fail in general, and provide some geometric intuition for this phenomenon. Received: October 2001     

Bimatrix games have quasi-strict equilibria

Received April 21, 1995 / Revised version received June 12, 1998 Published online November 24, 1998     

Values of games with denumerably many players

In this paper axioms for values of games with denumerably many players are introduced and, on a certain space of games, a value is defined as a limit of values of finite games. Further, some relationships between the value that the topology on the space of games of bounded variation are investigated. It is also shown and the regular weighted majority games are members of the space on which the value is defined.     

A consistent value for games with n players and r alternatives

In Bolger [1993], an efficient value was obtained for a class of games called games with n players and r alternatives. In these games, each of the n players must choose one and only one of the r alternatives. This value can be used to determine a player’s “a priori” value in such a game. In this paper, we show that the value has a consistency property similar to the “consistency” for TU games in Hart/Mas-Colell [1989] and we present a set of axioms (including consistency) which characterizes this value.  The games considered in this paper differ from the multi-choice games considered by Hsiao and Raghavan [1993]. They consider games in which the actions of the players are ordered in the sense that, if i >j, then action i carries more “weight” than action j.  These games also differ from partition function games in that the worth of a coalition depends not only on the partitioning of the players but also on the action chosen by each subset of the partition. Received: April 1994/final version: June 1999     

An agreeable collusive equilibrium in differential games with asymmetric players

We study a class of collusive equilibria in differential games with asymmetric players discounting the future at different rates. For such equilibria, at each moment, weights of players can depend on the state of the system. To fix them, we propose using a bargaining procedure according to which players can bargain again at every future moment. By choosing as threat point the feedback noncooperative outcome, the corresponding solution, if it exists, is agreeable. An exhaustible resource game illustrates the results.     

Consistent values and the core in continuum market games with two types of players

The consistent value is an extension of the Shapley value to the class of games with non-transferable utility.? In this paper, the consistent value will be characterized for market games with a continuum of players of two types. We will show that for such games the consistent value need not belong to the core, and provide conditions under which there is equivalence between the two concepts. Received: October 1998 RID="*" ID="*"  This thesis was completed under the supervision of Professor Sergiu Hart, The Center for Rationality and Interactive Decision Theory, Department of Mathematics, Department of Economics, The Hebrew University of Jerusalem. I would like to thank Professor Hart for introducing me to this area of research, for his help and guidance, and, especially, for all his patience.? I would also like to thank Michael Borns for improving the style, and an anonymous referee for helpful comments.     

Strong equilibria in claim games corresponding to convex games

This paper deals with a specific aspect of the problem of coalition formation in a situation described by a TU-game. First, we define a very simple normal form game which models the process of coalition formation. To define the payoff functions of the players we use an allocation rule for TU-games. The main objective of this paper is ascertain what conditions of the allocation rule lead to the grand coalition being a strong equilibrium of the normal form game, when the original TU-game is convex. Received January 1996/Revised version December 1996/Final version May 1997