The equilibrium of the bargaining game and core convergence theorem on an exchange economy with limited traders

Debreu and Scarf (1963), Hildenbrand (1974), Aumann (1964), Dierker (1975), Bewley (1973), and others have shown that the core of an exchange economy with infinitely many or finitely many traders converges. However, an exchange economy does not always consist of infinitely many or finitely many traders. This note provides proof of the core convergence theorem on an exchange economy with limited traders by a bargaining game methodology. The main contribution of this note is to innovate the equilibrium solution to the bargaining game in the exchange economy. In this note, the concept of common payoff is introduced; in the bargaining game of a coalition on its common payoff, all coalition members will get the same distribution, thus the distribution scheme of the cooperation surplus of the exchange economy is determined. This note shows that the bargaining game among the traders on the distribution of the cooperation surplus will make the pure exchange economy with limited traders converge to the Walrasian equilibrium, all the allocations other than the Walrasian equilibrium will be eliminated from the core of this economy.     

Risk attitudes and the stag-hunt game

A stag-hunt game (with the risky and safe actions) has two pure Nash equilibria that are Pareto-rankable. The risky action leads either to the Pareto-superior equilibrium (high payoff) or to out of equilibrium (low payoff) depending on the opponent’s action. Both players may want to obtain high payoff but uncertainty about the opponent’s action may prevent them to take such strategic risk. This paper investigates how information about the risk attitude of an opponent affects a player’s action choice in the stag-hunt game. I find that although a subject’s propensity to choose the risky action depends on her opponent’s risk attitude, it does not depend on her own risk attitude.     

Endogenous timing in the presence of non-monotonicities

The aim of this paper is to generalize the endogenous timing game proposed by Hamilton and Slutsky (Games and Economic Behavior, 1990, 2, pp. 29–46) by allowing the payoff or the marginal payoff of a player to become non-monotonic with respect to the strategy of the opponent. We propose a taxonomy of the subgame-perfect Nash equilibria based on the characteristics of the payoff functions proposed by Eaton (Canadian Journal of Economics, 2004, 37, pp. 805–29). We determine under which conditions of the initial payoff functions commitment has a social value and when the simultaneous-move Nash equilibrium is commitment robust and discuss its Pareto efficiency.     

Coordination cycles

Players repeatedly face a coordination problem in a dynamic global game. By choosing a risky action (invest) instead of waiting, players risk instantaneous losses as well as a loss of payoffs from future stages, in which they cannot participate if they go bankrupt. Thus, the total strategic risk associated with investment in a particular stage depends on the expected continuation payoff. High continuation payoff makes investment today more risky and therefore harder to coordinate on, which decreases today's payoff. Thus, expectation of successful coordination tomorrow undermines successful coordination today, which leads to fluctuations of equilibrium behavior even if the underlying economic fundamentals happen to be the same across the rounds. The dynamic game inherits the equilibrium uniqueness of the underlying static global game.     

The effects of heterogeneous interaction and risk attitude adaptation on the evolution of cooperation

This paper addresses the evolution of cooperation in a multi-agent system with agents interacting heterogeneously with each other based on the iterated prisoner’s dilemma (IPD) game. The heterogeneity of interaction is defined in two models. First, agents in a network are restricted to interacting with only their neighbors (local interaction). Second, agents are allowed to adopt different IPD strategies against different opponents (discriminative interaction). These two heterogeneous interaction scenarios are different to the classical evolutionary game, in which each agent interacts with every other agent in the population by adopting the same strategy against all opponents. Moreover, agents adapt their risk attitudes while engaging in interactions. Agents with payoffs above (or below) their aspirations will become more risk averse (or risk seeking) in subsequent interactions, wherein risk is defined as the standard deviation of one-move payoffs in the IPD game. In simulation experiments with agents using only own historical payoffs as aspirations (historical comparison), we find that the whole population can achieve a high level of cooperation via the risk attitude adaptation mechanism, in the cases of either local or discriminative interaction models. Meanwhile, when agents use the population’s average payoff as aspirations (social comparison) for adapting risk attitudes, the high level of cooperation can only be sustained in a portion of the population (i.e., partial cooperation). This finding also holds true in both of the heterogeneous scenarios. Considering that payoffs cannot be precisely estimated in a realistic IPD game, simulation experiments are also conducted with a Gaussian disturbance added to the game payoffs. The results reveal that partial cooperation in the population under social comparison is more robust to the variation in payoffs than the global cooperation under historical comparison.     

Dismissals and quits in repeated games

This paper studies repeated games, where player 1 can decide to let the opponent continue or replace her by a new player. We also allow for the possibility of player 2 quitting the game. When only layoffs can occur, a folk theorem for finite horizons obtains due to the threat that termination of the relationship imposes on player 2. However, quits limit this result to those cases in which the outside option for player 2 is small (lower than some Nash equilibrium payoff of the stage game).     

A New Bargaining Set of an N-Person Game and Endogenous Coalition Formation

The two most fundamental questions in cooperative game theory are: When a game is played, what coalitions will be formed and what payoff vectors will be chosen? Few solution concepts or theories in the current literature provide satisfactory answers to both questions; answers are especially lacking for the first one. In this paper we introduce a new bargaining set, which is the first solution concept in cooperative game theory that provides answers to both fundamental questions endogenously. Journal of Economic Literature Classification Number: C71.     

Destruction and settlement norms as determinants of conflict: An evolutionary perspective

This paper studies conflict in a simple bargaining framework using an evolutionary game-theoretic approach. Our findings suggest that a player does not always regard the winning probability as an acceptable settlement rule. He accepts a division according to winning probability when the destruction caused to him in conflict is more than a threshold, which in turn depends on cost of conflict to the opponent and the size of the population. Further, our analysis shows that the norms with positive weight to disagreement payoff are effective against conflict, and incentivize peace. Contrary to the findings of extant studies carried out in finite population evolutionary game setting, the settlement possibility set is identical under both ESS and Nash equilibrium in our model with settlement norms.     

How complex are networks playing repeated games?

Summary. This paper examines implications of complexity cost in implementing repeated game strategies through networks with finitely many classifiers. A network consists of individual classifiers that summarize the history of repeated play according to a weighted sum of the empirical frequency of the outcomes of the stage game, and a decision unit that chooses an action in each period based on the summaries of the classifiers. Each player maximizes his long run average payoff, while minimizing the complexity cost of implementing his strategy through a network, measured by its number of classifiers. We examine locally stable equilibria where the selected networks are robust against small perturbations. In any locally stable equilibrium, no player uses a network with more than a single classifier. Moreover, the set of locally stable equilibrium payoff vectors lies on two line segments in the payoff space of the stage game. Received: May 9, 1997; revised version: November 18, 1997     

Technology adoption in markets with network effects: Theory and experimental evidence

We examine a technology-adoption game with network effects in which coordination on either technology A or technology B constitutes a Nash equilibrium. Coordination on technology B is assumed to be payoff dominant. We define a technology’s critical mass as the minimal share of users, which is necessary to make the choice of this technology the best response for any remaining user. We show that the technology with the lower critical mass implies risk dominance and selection by the maximin criterion. We present experimental evidence that both payoff dominance and risk dominance explain participants’ choices in the technology-adoption game. The relative riskiness of a technology can be proxied using either technologies’ critical masses or stand-alone values absent any network effects.     

UNIQUENESS OF EQUILIBRIUM PAYOFFS IN FINITELY REPEATED GAMES WITH IMPERFECT MONITORING*

This paper examines when a finitely repeated game with imperfect monitoring has a unique equilibrium payoff vector. This problem is nontrivial under imperfect monitoring, because uniqueness of equilibrium (outcome) in the stage game does not extend to finitely repeated games. A (correlated) equilibrium is equilibrium minimaxing if any player's equilibrium payoff is her minimax value when the other players choose a correlated action profile from the actions played in the equilibrium. The uniqueness result holds if all stage game correlated equilibria are equilibrium minimaxing and have the same payoffs. The uniqueness result does not hold under weaker conditions.     

Sowing Doubt Optimally in Two-Person Repeated Games

Consider a two-person repeated game, where one of the players, P1, can sow doubt, in the mind of his opponent, as to what P1's payoffs are. This results in a two-person repeated game with incomplete information. By sowing doubt, P1 can sometimes increase his minimal equilibrium payoff in the original game. We prove that this minimum is maximal when only one payoff matrix, the negative of the payoff matrix of the opponent, is added (the opponent thus believes that he might play a zero-sum game). We obtain two formulas for calculating this maximal minimum payoff. Journal of Economic Literature Classification Numbers: C7, D8.     

Finitely repeated games with monitoring options

We study finitely repeated games where players can decide whether to monitor the other players? actions or not every period. Monitoring is assumed to be costless and private. We compare our model with the standard one where the players automatically monitor each other. Since monitoring other players never hurts, any equilibrium payoff vector of a standard finitely repeated game is an equilibrium payoff vector of the same game with monitoring options. We show that some finitely repeated games with monitoring options have sequential equilibrium outcomes which cannot be sustained under the standard model, even if the stage game has a unique Nash equilibrium. We also present sufficient conditions for a folk theorem, when the players have a long horizon.     

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.     

Learning to play games in extensive form by valuation

Game theoretic models of learning which are based on the strategic form of the game cannot explain learning in games with large extensive form. We study learning in such games by using valuation of moves. A valuation for a player is a numeric assessment of her moves that purports to reflect their desirability. We consider a myopic player, who chooses moves with the highest valuation. Each time the game is played, the player revises her valuation by assigning the payoff obtained in the play to each of the moves she has made. We show for a repeated win-lose game that if the player has a winning strategy in the stage game, there is almost surely a time after which she always wins. When a player has more than two payoffs, a more elaborate learning procedure is required. We consider one that associates with each move the average payoff in the rounds in which this move was made. When all players adopt this learning procedure, with some perturbations, then, with probability 1 there is a time after which strategies that are close to subgame perfect equilibrium are played. A single player who adopts this procedure can guarantee only her individually rational payoff.     

On the existence of pure-strategy perfect equilibrium in discontinuous games

We provide sufficient conditions for a (possibly) discontinuous normal-form game to possess a pure-strategy trembling-hand perfect equilibrium. We first show that compactness, continuity, and quasiconcavity of a game are too weak to warrant the existence of a pure-strategy perfect equilibrium. We then identify two classes of games for which the existence of a pure-strategy perfect equilibrium can be established: (1) the class of compact, metric, concave games satisfying upper semicontinuity of the sum of payoffs and a strengthening of payoff security; and (2) the class of compact, metric games satisfying upper semicontinuity of the sum of payoffs, strengthenings of payoff security and quasiconcavity, and a notion of local concavity and boundedness of payoff differences on certain subdomains of a player's payoff function. Various economic games illustrate our results.     

Characterising equilibrium selection in global games with strategic complementarities

Global games are widely used to predict behaviour in games with strategic complementarities and multiple equilibria. We establish two results on the global game selection. First, we show that, for any supermodular complete information game, the global game selection is independent of the payoff functions chosen for the game?s global game embedding. Second, we give a simple sufficient criterion to derive the selection and establish noise independence in many-action games by decomposing them into games with smaller action sets, to which we may often apply simple criteria. We also report in which small games noise independence may be established by counting the number of players or actions.     

Fast or fair? A study of response times

This paper uses a modified dictator game to investigate the relationship between response times and social preferences. We find that faster subjects more often chose the option with the highest payoff for themselves. Moreover, our within-analysis reveals that, for a given individual, payoff maximizing choices are reached quicker than choices expressing social preferences.     

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     

Payoff dominance and risk dominance in the observable delay game: a note

We examine whether the payoff dominant sequential-move (Stackelberg) outcome is realized when timing is endogenized. We adopt the observable delay game formulated by Hamilton and Slutsky [Games Econ Behav 2(1):29–46, 1990]. We find that if one sequential-move outcome is payoff dominant, either (i) the outcome both players prefer is the unique equilibrium; or (ii) two sequential-move outcomes are equilibria and the one both players prefer is risk dominant. In other words, no conflict between payoff dominance and risk dominance in the observable delay game exists, in contrast to other games such as (non pure) coordination games. We also find that even if one of two sequential-move outcomes is the unique equilibrium outcome in the observable delay game, it does not imply that the equilibrium outcome is payoff dominant to the other sequential-move outcome.