Discounted and finitely repeated minority games with public signals

We consider a repeated game where at each stage players simultaneously choose one of the two rooms. The players who choose the less crowded room are rewarded with one euro. The players in the same room do not recognize each other, and between the stages only the current majority room is publicly announced, hence the game has imperfect public monitoring. An undiscounted version of this game was considered by Renault et al. [Renault, J., Scarlatti, S., Scarsini, M., 2005. A folk theorem for minority games. Games Econom. Behav. 53 (2), 208–230], who proved a folk theorem. Here we consider a discounted version and a finitely repeated version of the game, and we strengthen our previous result by showing that the set of equilibrium payoffs Hausdorff-converges to the feasible set as either the discount factor goes to one or the number of repetition goes to infinity. We show that the set of public equilibria for this game is strictly smaller than the set of private equilibria.     

Pure equilibria in a simple dynamic model of strategic market game

We present a discrete model of two-person constant-sum dynamic strategic market game. We show that for every value of discount factor the game with discounted rewards possesses a pure stationary strategy equilibrium. Optimal strategies have some useful properties, such as Lipschitz property and symmetry. We also show value of the game to be nondecreasing both in state and discount factor. Further, for some values of discount factor, exact form of optimal strategies is found. For β less than , there is an equilibrium such that players make large bids. For β close to 1, there is an equilibrium with small bids. Similar result is obtained for the long run average reward game.     

Some interesting properties of maximin strategies

Since the seminal paper of Nash (1950) game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. We study the properties of these strategies in non-zero-sum strategic games that possess (completely) mixed Nash equilibria. We find that under certain conditions maximin strategies have several interesting properties, some of which extend beyond 2-person strategic games. In particular, for n-person games we specify necessary and sufficient conditions for maximin strategies to yield the same expected payoffs as Nash equilibrium strategies. We also show how maximin strategies may facilitate payoff comparison across Nash equilibria as well as refine some Nash equilibrium strategies.     

Limiting distributions of the number of pure strategy Nash equilibria in n-person games

We study the number of pure strategy Nash equilibria in a “random” n-person non-cooperative game in which all players have a countable number of strategies. We consider both the cases where all players have strictly and weakly ordinal preferences over their outcomes. For both cases, we show that the distribution of the number of pure strategy Nash equilibria approaches the Poisson distribution with mean 1 as the numbers of strategies of two or more players go to infinity. We also find, for each case, the distribution of the number of pure strategy Nash equilibria when the number of strategies of one player goes to infinity, while those of the other players remain finite.     

The Folk theorem for dominance solutions

The known variants of the Folk theorem characterize the sets of equilibria for repeated games. The present paper considers dominance solutions of finitely repeated games and discounted supergames with perturbed payoff functions. The paper shows that for a normal form game the set of dominance solution payoff vectors of the T-fold repetitions converges to the set of feasible and individually rational payoffs as T tends to infinity and the perturbation value tends to 0. A similar theorem is proved for supergames as the discount factor tends to 1. Received: May 1994/final version: September 1997     

Non-cooperative stochastic dominance games

A non-cooperative stochastic dominance game is a non-cooperative game in which the only knowledge about the players' preferences and risk attitudes is presumed to be their preference orders on the set ofn-tuples of pure strategies. Stochastic dominance equilibria are defined in terms of mixed strategies for the players that are efficient in the stochastic dominance sense against the strategies of the other players. It is shown that the set of SD equilibria equals all Nash equilibria that can be obtained from combinations of utility functions that are consistent with the players' known preference orders. The latter part of the paper looks at antagonistic stochastic dominance games in which some combination of consistent utility functions is zero-sum over then-tuples of pure strategies.     

Coalition-proof equilibria in a voluntary participation game

We examine the coalition-proof equilibria of a participation game in the provision of a (pure) public good. We study which Nash equilibria are achieved through cooperation, and we investigate coalition-proof equilibria under strict and weak domination. We show that under some incentive condition, (i) a profile of strategies is a coalition-proof equilibrium under strict domination if and only if it is a Nash equilibrium that is not strictly Pareto-dominated by any other Nash equilibrium and (ii) every strict Nash equilibrium for non-participants is a coalition-proof equilibrium under weak domination.     

Correlated equilibria of games with many players

Let G _m,n be the class of strategic games with n players, where each player has m≥2 pure strategies. We are interested in the structure of the set of correlated equilibria of games in G _m,n when n→∞. As the number of equilibrium constraints grows slower than the number of pure strategy profiles, it might be conjectured that the set of correlated equilibria becomes large. In this paper, we show that (1) the average relative measure of the set of correlated equilibria is smaller than 2⁻ⁿ; and (2) for each 1<c<m, the solution set contains c ⁿ correlated equilibria having disjoint supports with a probability going to 1 as n grows large. The proof of the second result hinges on the following inequality: Let c ₁, …, c _l be independent and symmetric random vectors in R ^k, l≥k. Then the probability that the convex hull of c ₁, …, c _l intersects R ^k ₊ is greater than or equal to . Received: December 1998/Final version: March 2000     

Separable and low-rank continuous games

In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in separable games. We show that these games admit finitely supported Nash equilibria. Motivated by the bounds on the supports of mixed equilibria in two-player finite games in terms of the ranks of the payoff matrices, we define the notion of the rank of an n-player continuous game and use this to provide bounds on the cardinality of the support of equilibrium strategies. We present a general characterization theorem that states that a continuous game has finite rank if and only if it is separable. Using our rank results, we present an efficient algorithm for computing approximate equilibria of two-player separable games with fixed strategy spaces in time polynomial in the rank of the game. This research was funded in part by National Science Foundation grants DMI-0545910 and ECCS-0621922 and AFOSR MURI subaward 2003-07688-1.     

Stationary perfect equilibria of an n-person noncooperative bargaining game and cooperative solution concepts

This paper characterizes the stationary (subgame) perfect equilibria of an n-person noncooperative bargaining model with characteristic functions, and provides strategic foundations of some cooperative solution concepts such as the core, the bargaining set and the kernel. The contribution of this paper is twofold. First, we show that a linear programming formulation successfully characterizes the stationary (subgame) perfect equilibria of our bargaining game. We suggest a linear programming formulation as an algorithm for the stationary (subgame) perfect equilibria of a class of n-person noncooperative games. Second, utilizing the linear programming formulation, we show that stationary (subgame) perfect equilibria of n-person noncooperative games provide strategic foundations for the bargaining set and the kernel.     

Variational inequality formulation for the games with random payoffs

We consider an n-player non-cooperative game with random payoffs and continuous strategy set for each player. The random payoffs of each player are defined using a finite dimensional random vector. We formulate this problem as a chance-constrained game by defining the payoff function of each player using a chance constraint. We first consider the case where the continuous strategy set of each player does not depend on the strategies of other players. If a random vector defining the payoffs of each player follows a multivariate elliptically symmetric distribution, we show that there exists a Nash equilibrium. We characterize the set of Nash equilibria using the solution set of a variational inequality (VI) problem. Next, we consider the case where the continuous strategy set of each player is defined by a shared constraint set. In this case, we show that there exists a generalized Nash equilibrium for elliptically symmetric distributed payoffs. Under certain conditions, we characterize the set of a generalized Nash equilibria using the solution set of a VI problem. As an application, the random payoff games arising from electricity market are studied under chance-constrained game framework.     

Asymptotic behavior of continuous stochastic games

Summary The aim of this paper is to analyze the asymptotic behavior of the value functions of a continuous stochastic game as the number of stages grows to infinity or the discount factor approaches 1. After the setup of the problem we prove that, in both cases, the extrema of the value functions converge to the same limits. The convergence of the value functions is then obtained from the unicity of the solution of a functional problem and it is thus possible to design hypotheses that assure the convergence to a constant. This allows to assign a value to an undiscounted infinite-stage stochastic game in several senses and to show that optimal strategies are available for both players. Furthermore the boundedness of the remainders of the value function after removing the principal terms is analyzed, with appropriate hypotheses, and related to the existence of solutions of a Howard's type functional equation. This allows to show that for an infinite-stage undiscounted stochastic game optimal stationary strategies exist at least if this functional equation has some solution.     

The modified stochastic game

We present a new tool for the study of multiplayer stochastic games, namely the modified game, which is a normal-form game that depends on the discount factor, the initial state, and for every player a partition of the set of states and a vector that assigns a real number to each element of the partition. We study properties of the modified game, like its equilibria, min–max value, and max–min value. We then show how this tool can be used to prove the existence of a uniform equilibrium in a certain class of multiplayer stochastic games.     

A Globally Convergent Algorithm to Compute All Nash Equilibria for <Emphasis Type="Italic">n</Emphasis>-Person Games

In this paper we present an algorithm to compute all Nash equilibria for generic finite n-person games in normal form. The algorithm relies on decomposing the game by means of support-sets. For each support-set, the set of totally mixed equilibria of the support-restricted game can be characterized by a system of polynomial equations and inequalities. By finding all the solutions to those systems, all equilibria are found. The algorithm belongs to the class of homotopy-methods and can be easily implemented. Finally, several techniques to speed up computations are proposed.     

Tug-of-War and Infinity Laplace Equation with Vanishing Neumann Boundary Condition

We study a version of the stochastic “tug-of-war” game, played on graphs and smooth domains, with the empty set of terminal states. We prove that, when the running payoff function is shifted by an appropriate constant, the values of the game after n steps converge in the continuous case and the case of finite graphs with loops. Using this we prove the existence of solutions to the infinity Laplace equation with vanishing Neumann boundary condition.     

Non-cooperative n-person game with a stopped set

A continuous time non-cooperative n-person Markov game with a stopped set is studied in this paper. We prove that, in the game process with or without discount factor, there exists an optimal stationary point of strategies, called the equilibrium point, and each player has his equilibrium stationary strategy, such that the total expected discounted or non-discounted gain are maximums.     

Asymmetric equilibria in dynamic two-sided matching markets with independent preferences

A fundamental fact in two-sided matching is that if a market allows several stable outcomes, then one is optimal for all men in the sense that no man would prefer another stable outcome. We study a related phenomenon of asymmetric equilibria in a dynamic market where agents enter and search for a mate for at most n rounds before exiting again. Assuming independent preferences, we find that this game has multiple equilibria, some of which are highly asymmetric between sexes. We also investigate how the set of equilibria depends on a sex difference in the outside option of not being mated at all.     

COMPUTING THE EQUILIBRIA OF DYNAMIC COMMON PROPERTY GAMES

In this paper we discuss techniques for rapidly computing the equilibria of a class of dynamic linear-quadratic games involving the extraction of a common property resource. Though this class of games has been much studied, the search for equilibria of these games has only been attempted in special cases, and analysis of the game has tended to focus on its steady-state properties. We construct a pseudo-planning problem, the optimal of which correspond to the Markov perfect equilibria of the class of games we explore. We show how the optima (equilibria) of this pseudo-planning problem (game) can be rapidly computed via a Riccati-like equation. Finally, we illustrate the use of these techniques with several examples involving the extraction of a common property resource.     

Best response dynamics for role games

In a role game, players can condition their strategies on their player position in the base game. If the base game is strategically equivalent to a zero-sum game, the set of Nash equilibria of the role game is globally asymptotically stable under the best response dynamics. If the base game is 2 ×2, then in the cyclic case the set of role game equilibria is a continuum. We identify a single equilibrium in this continuum that attracts all best response paths outside the continuum. Received: June 2001     

A Strong Anti-Folk Theorem

We study the properties of finitely complex, symmetric, globally stable, and semi-perfect equilibria. We show that: (1) If a strategy satisfies these properties then players play a Nash equilibrium of the stage game in every period; (2) The set of finitely complex, symmetric, globally stable, semi-perfect equilibrium payoffs in the repeated game equals the set of Nash equilibria payoffs in the stage game; and (3) A strategy vector satisfies these properties in a Pareto optimal way if and only if players play some Pareto optimal Nash equilibrium of the stage game in every stage. Our second main result is a strong anti-Folk Theorem, since, in contrast to what is described by the Folk Theorem, the set of equilibrium payoffs does not expand when the game is repeated.This paper is a revised version of Chapter 3 of my Ph.D. thesis, which has circulated under the title “An Interpretation of Nash Equilibrium Based on the Notion of Social Institutions”.