Risk-Sensitive Dynamic Market Share Attraction Games

We present partial results showing that risk-sensitive oligopolists would spend less on advertising than would their risk-neutral counterparts. The model is an infinite-horizon stochastic game in which each firm's “goodwill” is a random function of both its own and its competitors' current and past advertising expenditures. Single-period firm profits have a market share attraction form. Each firm seeks to maximize its expected exponential utility of the sum of discounted profits. We analyze the impact that risk sensitivity and other parameters have on equilibrium advertising strategies by exploiting the special structure of the stochastic game model.Journal of Economic LiteratureClassification Number: C73.     

Egalitarianism and Efficiency in Repeated Symmetric Games

We analyze the symmetric equilibria of repeated symmetric games where there is a conflict of interests over equilibria—the battle-of-the-sexes or the hawk–dove game are key examples. If one restricts attention to symmetric equilibria, efficient equilibria must be egalitarian. For finitely repeated games, and generic discount factors, there is a unique outcome path which ensures efficiency within the class of symmetric equilibria. This is also true for the infinitely repeated games if the players are sufficiently impatient. Journal of Economic Literature Classification Numbers: C72, C73.     

Evolution in Finitely Repeated Coordination Games

I apply a version of Kandori et al. (1993, Econometrica, 61, 29–56) and Young's (1993, Econometrica, 61, 57–84) evolutionary dynamic to finitely repeated coordination games. The dynamic is modified by allowing mutations to affect only off path beliefs. I find that repetition within a match leads agents to sacrifice current payoffs in order to increase payoffs in later stages. As a consequence, evolution leads to (almost) efficiency. Journal of Economic Literature Classification Number: C79.     

Renegotiation in Repeated Games with Side-Payments

We consider repeated games with side-payments: players have an endowment of wealth in each period in which transfers can be made. We show that if endowments are large enough and the common discount factor high enough, then a strongly renegotiation–proof equilibrium (SRP) in the sense of Farrell and Maskin exists. As the discount factor goes to 1, the set of SRP payoffs converges to the set of efficient, individually rational payoffs. These results provide a justification for the efficiency principle when agreements are not enforceable. Journal of Economic Literature Classification Numbers: C73, D23, L14.     

Repeated Games with Bounded Entropy

We investigate the asymptotic behavior of the maxmin values of repeated two-person zero-sum games with a bound on the strategic entropy of the maximizer's strategies while the other player is unrestricted. We will show that if the bound η(n), a function of the number of repetitions n, satisfies the condition η(n)/n → γ (n → ∞), then the maxmin value Wⁿ(η(n)) converges to (cav U)(γ), the concavification of the maxmin value of the stage game in which the maximizer's actions are restricted to those with entropy at most γ. A similar result is obtained for the infinitely repeated games. Journal of Economic Literature Classification Numbers: C73, C72.     

Repeated Games with Almost-Public Monitoring

In repeated games with imperfect public monitoring, players can use public signals to coordinate their behavior, and thus support cooperative outcomes, but with private monitoring, such coordination may no longer be possible. Even though grim trigger is a perfect public equilibrium (PPE) in games with public monitoring, it often fails to be an equilibrium in arbitrarily close games with private monitoring. If a PPE has players' behavior conditioned only on finite histories, then it induces an equilibrium in all close-by games with private monitoring. This implies a folk theorem for repeated games with almost-public almost-perfect monitoring. Journal of Economic Literature Classification Numbers: C72, C73.     

Reputation and Perfection in Repeated Common Interest Games

We consider a wide class of repeated common interest games perturbed with one-sided incomplete information: one player (the informed player) might be a commitment type playing the Pareto dominant action. As discounting, which is assumed to be symmetric, and the prior probability of the commitment type go to zero, it is shown that the informed player can be held close to her minmax payoff even when perfection is imposed on the equilibrium.Journal of Economic LiteratureClassification Numbers: C73, D83.     

Infinite Histories and Steady Orbits in Repeated Games

We study a model of repeated games with the following features: (a) Infinite histories. The game has been played since days of yore, or is so perceived by the players: (b) Turing machines with memory. Since regular Turing machines coincide with bounded recall strategies (in the presence of infinite histories), we endow them with "external" memory; (c) Nonstrategic players. The players ignore complicated strategic considerations and speculations about them. Instead, each player uses his/her machine to update some statistics regarding the others′ behaviour, and chooses a best response to observed behaviour. Relying on these assumptions, we define a solution concept for the one shot game, called steady orbit. The (closure of the) set of steady orbit payoffs strictly includes the convex hull of the Nash equilibria payoffs and is strictly included in the correlated equilibria payoffs. Assumptions (a)–(c) above are independent to a large extent. In particular, one may define steady orbits without explicitly dealing with histories or machines.     

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.     

On Renegotiation-Proof Equilibria in Finitely Repeated Games

This paper studies renegotiation-proof equilibria of Beno?̂t and Krishna (1993) in finitely repeated games with more than two players. We provide a simple characterization of the set of average payoffs from renegotiation-proof equilibria: the limiting set of average equilibrium payoffs is either efficient or dimensionally small as the horizon of the repeated game goes to infinity. Two sufficient conditions for the former to occur are provided. An example shows that those conditions cannot be weakened.Journal of Economic LiteratureClassification Numbers: C72, C73.     

Communication in Repeated Games with Private Monitoring

The paper considers repeated games where each player can be observed by only a subset of the other players, and where players can make public announcements about the behavior of the players they observed. We address the following question: What is the minimal level of observability that is required to obtain efficient outcomes? The main result is that the limit set of sequential equilibrium payoffs, when the discount factor tends to one, contains the set of individual rational payoffs whenever each player is observed by at leasttwoother players.Journal of Economic LiteratureClassification Number: C73.     

Cost Structures and Nash Play in Repeated Cournot Games

This paper reports an experiment designed to assess the effects of a rotation in the marginal cost curve on convergence in a repeated Cournot triopoly. Increasing the cost curve's slope both reduces the serially-undominated set to the Nash prediction, and increases the peakedness of earnings. We observe higher rates of Nash equilibrium play in the design with the steeper marginal cost schedule, but only when participants are also rematched after each decision. Examination of response patterns suggests that the treatment with a steeper marginal cost curve and with a re-matching of participants across periods induces the selection of Nash Consistent responses.     

Measuring Strategic Uncertainty in Coordination Games

This paper proposes a method to measure strategic uncertainty by eliciting certainty equivalents analogous to measuring risk attitudes in lotteries. We apply this method by conducting experiments on a class of one-shot coordination games with strategic complementarities and choices between simple lotteries and sure payoff alternatives, both framed in a similar way. Despite the multiplicity of equilibria in the coordination games, aggregate behaviour is fairly predictable. The pure or mixed Nash equilibria cannot describe subjects' behaviour. We present two global games with private information about monetary payoffs and about risk aversion. While previous literature treats the parameters of a global game as given, we estimate them and show that both models describe observed behaviour well. The global-game selection for vanishing noise of private signals offers a good recommendation for actual players, given the observed distribution of actions. We also deduce subjective beliefs and compare them with objective probabilities.     

Introduction to Repeated Games with Private Monitoring

We present a brief overview of recent developments in discounted repeated games with (imperfect) private monitoring. The literature explores the possibility of cooperation in a long-term relationship, where each agent receives imperfect private information about the opponents' actions. Although this class of games admits a wide range of applications such as collusion under secret price-cutting, exchange of goods with uncertain quality, and observation errors, it has fairly complex mathematical structure due to the lack of common information shared by players. This is in sharp contrast to the well-explored case of repeated games under public information (with the celebrated Folk Theorems), and until recently little had been known about the private monitoring case. However, rapid developments in the past few years have revealed the possibility of cooperation under private monitoring for some class of games. Journal of Economic Literature Classification Numbers: C72, C73, D43, D82, L13, L41.     

A Folk Theorem for Repeated Sequential Games

We study repeated sequential games where players may not move simultaneously in stage games. We introduce the concept of effective minimax for sequential games and establish a Folk theorem for repeated sequential games. The Folk theorem asserts that any feasible payoff vector where every player receives more than his effective minimax value in a sequential stage game can be supported by a subgame perfect equilibrium in the corresponding repeated sequential game when players are sufficiently patient. The results of this paper generalize those of Wen (1994), and of Fudenberg and Maskin (1986). The model of repeated sequential games and the concept of effective minimax provide an alternative view to the Anti–Folk theorem of Lagunoff and Matsui (1997) for asynchronously repeated pure coordination games.     

Evolutionary Learning in Signalling Games

We study equilibrium selection by evolutionary learning in monotone two-type signalling games. The learning process we study extends that introduced by Young (1993, Econometrica61, 57–84) to deal with incomplete information and sequential moves; it thus involves stochastic trembles. For vanishing trembles the process gives rise to strong selection among sequential equilibria: if the game has separating equilibria, then in the long run only play according to the so-called Riley equilibrium will be observed frequently. Journal of Economic Literature Classification Number: C72.     

Socially Subjective Equilibrium in Strategic Form Games

This study provides a new framework and a new equilibrium concept, which are able to describe the situation where people have various images of the society and have various solution concepts for social outcomes, and where people accept the social outcomes. In socially subjective equilibrium, people have a coherence of their own norms in two senses. One is the consistency of the norm itself. Imagined outcomes should satisfy a certain (subjective) solution concept. The other is the consistency between the imagined outcomes and realized one. These are the main features of our equilibrium concept. This paper forms a part of my doctoral thesis, which is titled “On socially subjective equilibrium”. The first person I would like to thank is my direct supervisor Professor Ken Urai (Osaka University). I obtained a basic idea of the main concept of my doctoral thesis, that is, the solution concept scheme, from Professor Urai. I am grateful to Professor Hiroaki Nagatani (Osaka University) and Professor Ken-Ichi Shimomura (Kobe University), who monitored my works and took efforts in providing me with valuable comments on earlier versions of my thesis. I also obtained a fruitful advice from Professor Kenichi Amaya (Kobe University). Lastly, I specially thank to Kozo Shiraishi (Osaka University).     

Reciprocity and Cooperation in Repeated Coordination Games: The Principled-Player Approach

Two long-lived players play a repeated coordination game. I show the restrictions on players' beliefs which imply that cooperation is optimal play. Journal of Economic Literature Classification Number: D83.     

Cooperation in Experimental Games of Strategic Complements and Substitutes

We conduct a laboratory experiment aimed at examining whether strategic substitutability and strategic complementarity have an impact on the tendency to cooperate in finitely repeated two-player games with a Pareto-inefficient Nash equilibrium. We find that there is significantly more cooperation when actions exhibit strategic complementarities than in the case of strategic substitutes. The difference is to some extent driven by a difference in the speed with which some pairs reach stable full cooperation, but mainly by differences in choices of pairs that do not succeed in reaching full cooperation.     

Finitely Many Players with Bounded Recall in Infinitely Repeated Games

We study the set of limit points of equilibrium payoffs in n-player repeated games, with bounded recall, when the memory capacities of all the players grow to infinity. Two main issues are explored: (i) whether differential information enables players to play correlatively, and (ii) the extent to which boundedly rational players can learn others′ behavior patterns and conceal their own. Journal of Economic Literature Classification Number: 026.