A note on control costs and logit rules for strategic games

We consider best response dynamics with endogenous noise based on a finite game in strategic form. A player can reduce the noise level by expending an extra effort and incurring some disutility or control costs. We specify control costs that result in logit adjustment rules. The stochastically stable states of the dynamic process are partial Nash configurations, that is, states where at least one player plays a best response against the others. If the game has a potential, then the stochastically stable states coincide with the Nash equilibria on which the potential is maximized. RID="*" ID="*" Instructive comments of a referee are gratefully acknowledged. Correspondence to:H. Haller     

Equilibrium selection in coordination games with simultaneous play

Summary. We apply the dynamic stochastic framework proposed in recent evolutionary literature to a class of coordination games played simultaneously by the entire population. In these games payoffs, and hence best replies, are determined by a summary statistic of the population strategy profile. We demonstrate that with simultaneous play, the equilibrium selection depends crucially on how best responses to the summary statistic remain piece-wise constant. In fact, all the strict Nash equilibria in the underlying stage game can be made stochastically stable depending on how the best response mapping generates piece-wise constant best responses. Received: February 12, 2001; revised version: October 29, 2001     

An experimental study of costly coordination

This paper reports data for coordination game experiments with random matching. The experimental design is based on changes in an effort-cost parameter, which do not alter the set of Nash equilibria nor do they alter the predictions of adjustment theories based on imitation or best response dynamics. As expected, however, increasing the effort cost lowers effort levels. Maximization of a stochastic potential function, a concept that generalizes risk dominance to continuous games, predicts this reduction in efforts. An error parameter estimated from initial two-person, minimum-effort games is used to predict behavior in other three-person coordination games.     

Dynamics in near-potential games

We consider discrete-time learning dynamics in finite strategic form games, and show that games that are close to a potential game inherit many of the dynamical properties of potential games. We first study the evolution of the sequence of pure strategy profiles under better/best response dynamics. We show that this sequence converges to a (pure) approximate equilibrium set whose size is a function of the “distance” to a given nearby potential game. We then focus on logit response dynamics, and provide a characterization of the limiting outcome in terms of the distance of the game to a given potential game and the corresponding potential function. Finally, we turn attention to fictitious play, and establish that in near-potential games the sequence of empirical frequencies of player actions converges to a neighborhood of (mixed) equilibria, where the size of the neighborhood increases according to the distance to the set of potential games.     

Private provision of a discrete public good: efficient equilibria in the private-information contribution game

We study the voluntary provision of a discrete public good via the contribution game. Players independently and simultaneously make nonrefundable contributions to fund a discrete public good, which is provided if and only if contributions cover the cost of production. We characterize nonconstant continuous symmetric equilibria, giving sufficient conditions for their existence. We show the common normalization by which players’ values are distributed over [0, 1] is not without loss of generality: if the distribution over this interval has continuous density f with f(0) >  0, then no (nonconstant) continuous symmetric equilibrium exists. We study in detail the case in which players’ private values are uniformly distributed, showing that, generically, when one continuous equilibrium exists, a continuum of continuous equilibria exists. For any given cost of the good, multiple continuous equilibria cannot be Pareto ranked. Nevertheless, not all continuous equilibria are interim incentive efficient. The set of interim incentive efficient equilibria is exactly determined. The authors thank Manfred Dix, George Mailath, Andrew Postlewaite, and an anonymous referee for their comments.     

Stochastic stability for roommate markets

We show that for any roommate market the set of stochastically stable matchings coincides with the set of absorbing matchings. This implies that whenever the core is non-empty (e.g., for marriage markets), a matching is in the core if and only if it is stochastically stable, i.e., stochastic stability is a characteristic of the core. Several solution concepts have been proposed to extend the core to all roommate markets (including those with an empty core). An important implication of our results is that the set of absorbing matchings is the only solution concept that is core consistent and shares the stochastic stability characteristic with the core.     

Working and Shirking: Equilibrium in Public-Goods Games with Overlapping Generations of Players

In overlapping-generations models of public-goods provision,in which the contribution decision is binary and lifetimes arefinite, the set of symmetric subgame-perfect equilibria canbe categorized into three types: seniority equilibria, in whichplayers contribute (effort) until a predetermined age and thenshirk thereafter; dependency equilibria, in which players initiallyshirk, then contribute for a set number of periods, then shirkfor the remainder of their lives; and sabbatical equilibria,in which players alternately contribute and shirk for periodsof varying length before entering a final stage of shirking.In a world without discounting we establish conditions for equilibriumand demonstrate that for any dependency equilibrium there isa seniority equilibrium that Pareto dominates it ex ante. Weproceed to characterize generational preferences over alternativeseniority equilibria. We explore the aggregation of these preferencesby embedding the public-goods provision game in a voting frameworkand solving for the majority-rule equilibria. In this way wecan think of political processes as providing one natural frameworkfor equilibrium selection in the original public-goods provisiongame.     

The vector lattice structure of the n-person TU games

We show that any cooperative TU game is the maximum of a finite collection of a specific class of the convex games: the almost positive games. These games have non-negative dividends for all coalitions of at least two players. As a consequence of the above result we show that the class of modular games is a set of generators of the distributive lattice of all cooperative TU games. Finally, we characterize zero-monotonic games using a strong max-convex decomposition.     

The evolution of exchange

Stochastic stability is applied to the problem of exchange. We analyze the stochastic stability of two dynamic trading processes in a simple housing market. In both models, traders meet in pairs at random and exchange their houses when trade is mutually beneficial, but occasionally they make mistakes. The models differ in the probability of mistakes. When all mistakes are equally likely, the set of stochastically stable allocations contains the set of efficient allocations. When more serious mistakes are less likely, the stochastically stable states are those allocations, always efficient, with the lowest envy level.     

Environmental Policy with Endogenous Plant Locations

In a game between the governments of two countries, each chooses its own environmental policy. The Nash equilibria of the game are generally not Pareto optimal. On the one hand, each country may want to attract industry, giving it an incentive to choose low environmental taxes or standards. On the other hand, if disutility from pollution is sufficiently high, each country might prefer that a firm locates only in other countries. This effect tends to make the environmental policy under non-cooperation stricter than it would be with cooperation.     

Cycling in a stochastic learning algorithm for normal form games

In this paper we study a stochastic learning model for 2×2 normal form games that are played repeatedly. The main emphasis is put on the emergence of cycles. We assume that the players have neither information about the payoff matrix of their opponent nor about their own. At every round each player can only observe his or her action and the payoff he or she receives. We prove that the learning algorithm, which is modeled by an urn scheme proposed by Arthur (1993), leads with positive probability to a cycling of strategy profiles if the game has a mixed Nash equilibrium. In case there are strict Nash equilibria, the learning process converges a.s. to the set of Nash equilibria.     

For how long to tie your hands? Stable relationships in an unstable environment

The Kreps–Wilson–Milgrom–Roberts framework is one of the most renowned ways of modeling reputation-building. Once the number of repetitions of the game is considered as a choice variable, such a framework can fruitfully be employed to study the optimal length of the commitment to a relationship. We analyze a model where a principal plays with an agent a finitely repeated trust game, characterize the optimal length of the relationship between principal and agent when the principal’s preferences on the agent’s type stochastically change over time and show that a commitment to a stable relationship may be optimal (even) in very unstable environments.      

Walrasian analysis via two-player games

We associate to any pure exchange economy a game with only two players, regardless of the number of consumers. In this two-player game, each player represents a different role of the society, formed by all the individuals in the economy. Player 1 selects feasible allocations trying to make Pareto improvements. Player 2 chooses an alternative from the wider range of allocations that are feasible in the sense of Aubin. The set of Nash equilibria of our game is non-empty and our main result provides a characterization of Walrasian equilibria allocations as strong Nash equilibria of the associated society game.     

Strategic Jump Bidding in English Auctions

This paper solves for equilibria of sequential bid (or English) auctions with affiliated values when jump bidding strategies may be employed to intimidate one's opponents. In these equilibria, jump bids serve as correlating devices which select asymmetric bidding functions to be played subsequently. Each possibility of jump bidding provides a Pareto improvement for the bidders from the symmetric equilibrium of a sealed bid, second-price auction. The expanded set of equilibria can approximate either first- or second-price outcomes and produce exactly the set of expected prices between those two bounds. These results contrast with standard conclusions that equate English and second-price auctions.     

Coalition and Party Formation in a Legislative Voting Game

We examine a legislative voting game where decisions are to be made over both ideological and distributive dimensions. In equilibrium legislators prefer to make proposals for the two dimensions together, despite having preferences that are separable over the two dimensions. The equilibria exhibit interaction between the ideological and distributive dimensions, and the set of legislators who approve winning proposals does not always consist of ideologically adjacent legislators. There is more than one ideological decision that has a positive probability of being proposed and approved. We show that legislators can gain from forming political parties, and consider examples where predictions can be made about the composition of parties. Journal of Economic Literature Classification Numbers: D72, C71, C78.     

Fictitious play in ‘one-against-all’ multi-player games

Summary. A compound game is an (n + 1) player game based on n two-person subgames. In each of these subgames player 0 plays against one of the other players. Player 0 is regulated, so that he must choose the same strategy in all n subgames. We show that every fictitious play process approaches the set of equilibria in compound games for which all subgames are either zero-sum games, potential games, or games. Received: July 18, 1997; revised version: December 4, 1998     

The power of ESS: An experimental study

Abstract. Our experimental design mimics a traditional evolutionary game framework where players are matched pairwise to play a symmetric 33 bimatrix game that has two Nash equilibria. One equilibrium is an evolutionary stable state, or ESS; the other is an equilibrium in dominated strategies. Our primary experimental result is the observation that the ESS becomes extremely attractive when subjects have minimal information about the payoff functions, although the dominated equilibrium assures the highest equilibrium payoff. The attractiveness of the ESS is only moderate when players are completely informed about the 33 payoff matrix. Correspondence to: S.K. Berninghaus     

On the Relationship between Risk-Dominance and Stochastic Stability

In a 2 × 2 symmetric game with two symmetric equilibria, one risk-dominates another if and only if the equilibrium strategy is a unique best response to any mixture that gives itself at least a probability of one-half. In a two-person strategic form game, we call a Nash equilibriumglobally risk-dominantif it consists of strategies such that each one of them is a unique best response to any mixture that gives the other at least a probability of one-half. We show that if a weakly acyclic two-person game has a globally risk-dominant equilibrium, then this is the one that is selected by the stochastic equilibrium selection process of Young.Journal of Economic LiteratureClassification Numbers: C72, C73.     

Competitive environments and protective behavior

The class of two-person competition games is introduced and analyzed. For any game in this class the set of Nash equilibria is convex and all Nash equilibria lead to the same payoff vector. Competition games are compared to other competitive environments such as unilaterally competitive games and rivalry games. Moreover, protective behavior within competitive environments is analyzed. For matrix games it is known that protective strategies profiles exactly correspond to proper equilibria. It is shown that this result can be extended to the class of unilaterally competitive games.     

Nearly compact and continuous normal form games: characterizations and equilibrium existence

Normal form games are nearly compact and continuous (NCC) if they can be understood as games played on strategy spaces that are dense subsets of the strategy spaces of larger compact games with jointly continuous payoffs. There are intrinsic algebraic, measure theoretic, functional analysis, and finite approximability characterizations of NCC games. NCC games have finitely additive equilibria, and all their finitely additive equilibria are equivalent to countably additive equilibria on metric compactifications. The equilibrium set of an NCC game depends upper hemicontinuously on the specification of the game and contains only the limits of approximate equilibria of approximate games.