FINITELY REPEATED PRISONERS' DILEMMA WITH SMALL FINES: THE PENANCE CONTRACT*

This paper investigates finitely repeated prisoners' dilemma games with explicit contractual devices. It shows that full collusion can be achieved in a unique manner by incentivizing the players' final‐period play with small fines. The incentivizing modality is the penance contract, by which a player is penalized if and only if he deviates from the penance strategy in the final period. Using this contractual agreement brings the penance strategy profile into unique subgame perfect equilibrium in the entire game and achieves full collusion without being invalidated by renegotiation.     

ROBUST RATIONALIZABILITY UNDER ALMOST COMMON CERTAINTY OF PAYOFFS

An action is robustly rationalizable if it is rationalizable for every type who has almost common certainty of payoffs. We illustrate by means of an example that an action may not be robustly rationalizable even if it is weakly dominant, and argue that robust rationalizability is a very stringent refinement of rationalizability. Nonetheless, we show that every strictly rationalizable action is robustly rationalizable. We also investigate how permissive robust rationalizability becomes if we require that players be fully certain of their own payoffs.     

EVOLUTIONARY DRIFT IN PREFERENCE AND EQUILIBRIUM SELECTION*

This paper studies the situation where myopic players repeatedly face a society with two actions where their common fitness exhibits economies of scale. Both states in which all players choose the same actions are equilibria. In each period, players adjust their actions based on their preferences, which are in turn shaped by natural selection. The preferences of the players need not match the underlying fitness. When rare mutations are introduced into the evolutionary process, their preferences may drift without affecting equilibrium behaviour. This paper shows that these drifts influence the results of equilibrium selection.     

The Nash-threats folk theorem with communication and approximate common knowledge in two player games

We show that the use of communications to coordinate equilibria generates a Nash-threats folk theorem in two-player games with “almost public” information. The results generalize to the n-person case. However, the two-person case is more difficult because it is not possible to sustain equilibria by comparing the reports of different players, and using these “third parties” to effectively enforce contracts.     

A belief-based approach to the repeated prisoners' dilemma with asymmetric private monitoring

This paper extends the belief-based approach to the repeated prisoners' dilemma with asymmetric private monitoring. We first find that the previous belief-based techniques [T. Sekiguchi, Efficiency in repeated prisoners' dilemma with private monitoring, J. Econ. Theory 76 (1997) 345-361; V. Bhaskar, I. Obara, Belief-based equilibria in the repeated prisoners' dilemma with private monitoring, J. Econ. Theory 102 (2002) 40-69] cannot succeed when players' private monitoring technologies are sufficiently different. We then modify the previous belief-based approach by letting the player with smaller observation errors always randomize between cooperate and defect along the cooperative path of the play. We show that with vanishing observation errors, efficiency and a folk theorem can be approximated using our modified belief-based strategies.     

Efficiency results in N player games with imperfect private monitoring

We demonstrate that efficiency is achievable in a certain class of N player repeated games with private, almost perfect monitoring. Our equilibrium requires only one period memory and can be implemented by two state automata. Furthermore, we show that this efficiency result holds with any degree of accuracy of monitoring if private signals are hemiindependent. Whereas most existing research focuses on two player cases or only a special example of N player games, our results are applicable to a wide range of N player games of economic relevance, such as trading goods games and price-setting oligopolies.     

Folk theorem with communication

This paper proves a new folk theorem for repeated games with private monitoring and communication, extending the idea of delayed communication in Compte [O. Compte, Communication in repeated games with imperfect private monitoring, Econometrica 66 (1998) 597-626] to the case where private signals are correlated.The sufficient condition for the folk theorem is generically satisfied with more than two players, even when other well-known conditions are not. The folk theorem also applies to some two-players repeated games.     

A limit characterization of belief-free equilibrium payoffs in repeated games

The present paper studies repeated games with private monitoring, and characterizes the set of belief-free equilibrium payoffs in the limit as the discount factor approaches one and the noise on private information vanishes. Contrary to the conjecture by Ely et al. [J.C. Ely, J. Hörner, W. Olszewski, Belief-free equilibria in repeated games, Econometrica 73 (2005) 377-415], the equilibrium payoff set is computed by the same formula, no matter how many players there are. As an application of this result, a version of the folk theorem is established for N-player prisoner's dilemma games.     

Iterated potential and robustness of equilibria

For any given set-valued solution concept, it is possible to consider iterative elimination of actions outside the solution set. This paper applies such a procedure to define the concept of iterated monotone potential maximizer (iterated MP-maximizer). It is shown that under some monotonicity conditions, an iterated MP-maximizer is robust to incomplete information [A. Kajii, S. Morris, The robustness of equilibria to incomplete information, Econometrica 65 (1997) 1283-1309] and absorbing and globally accessible under perfect foresight dynamics for a small friction [A. Matsui, K. Matsuyama, An approach to equilibrium selection, J. Econ. Theory 65 (1995) 415-434]. Several simple sufficient conditions under which a game has an iterated MP-maximizer are also provided.     

Coordination failure in repeated games with private monitoring

Players coordinate continuation play in repeated games with public monitoring. We investigate the robustness of such equilibrium behavior with respect to ex-ante small private-monitoring perturbations. We show that with full support of public signals, no perfect public equilibrium is robust if it induces a “regular” 2×2$2\times 2$ coordination game in the continuation play. This regularity condition is violated in all belief-free equilibria. Indeed, with an individual full rank condition, every interior belief-free equilibrium is robust. We also analyze block belief-free equilibria and point out that the notion of robustness is sensitive to whether we allow for uninterpretable signals.     

Does hidden information make trade liberalization more fragile?

Abstract This paper focuses on the impact of hidden information on strategic interaction in the context of trade agreements. In the presence of informational asymmetry it is possible that a tradeoff between liberalization and sustainability of cooperation emerges. It is shown that it may be optimal to agree on a degree of liberalization associated with a strictly positive ex ante probability of deviation occurring. In that case, cooperation will break down in finite time, and the optimal degree of liberalization cannot be applied indefinitely.     

Interlinkage and Generous Tit‐for‐Tat Strategy

We investigate an infinitely‐repeated prisoners' dilemma with imperfect monitoring and consider the possibility that the interlinkage of the players' distinct activities enhances implicit collusion. We show a necessary and sufficient condition for the existence of a generous tit‐for‐tat Nash equilibrium. Such an equilibrium, if it exists, is unique. This equilibrium achieves approximate efficiency when monitoring is almost perfect, where the discount factors are fixed.     

Pigouvian pricing and stochastic evolutionary implementation

We study the implementation of efficient behavior in settings with externalities. A planner would like to ensure that a group of agents make socially optimal choices, but he only has limited information about the agents’ preferences, and can only distinguish individual agents through the actions they choose. We describe the agents’ behavior using a stochastic evolutionary model, assuming that their choice probabilities are given by the logit choice rule. We prove that there is a simple price scheme with the following property: regardless of the realization of preferences, a group of agents subjected to the price scheme will spend the vast majority of time in the long run behaving efficiently. The price scheme defines a game that may possess multiple equilibria, but we are able to obtain a unique and efficient selection from this set because of the stochastic nature of the agents’ choice rule. We conclude by comparing the performance of our price scheme with that of VCG mechanisms.     

THE SECOND‐PRICE AUCTION SOLVES KING SOLOMON'S DILEMMA*

The planner wants to give k identical, indivisible objects to the top k valuation agents at zero costs. Each agent knows her own valuation of the object and whether it is among the top k. Modify the (k+ 1)st‐price sealed‐bid auction by introducing a small participation fee and the option not to participate in it. This simple mechanism implements the desired outcome in iteratively undominated strategies. Moreover, no pair of agents can profitably deviate from the equilibrium by coordinating their strategies or bribing each other.     

A theory of political cycles

We study how the proximity of elections affects policy choices in a model in which policymakers want to improve their reputation to increase their reelection chances. Policymakers' equilibrium decisions depend on both their reputation and the proximity of the next election. Typically, incentives to influence election results are stronger closer to the election (for a given reputation level), as argued in the political cycles literature, and these political cycles are less important when the policymaker's reputation is better. Our analysis sheds light on other agency relationships in which part of the compensation is decided upon infrequently.     

Persuasion,binary choice,and the costs of dishonesty

We study the strategic interaction between a decision maker who needs to take a binary decision but is uncertain about relevant facts and an informed expert who can send a message to the decision maker but has a preference over the decision. We show that the probability that the expert can persuade the decision maker to take the expert’s preferred decision is a hump-shaped function of his costs of sending dishonest messages.     

THE EXPECTED NUMBER OF COOPERATORS IN THE N‐PERSON PRISONERS’ DILEMMA WITH RANDOM ORDER MOVES*

The present paper examines the possibility of cooperation occurring in the N‐person prisoners’ dilemma, played with randomly ordered moves and imperfect information. To take into account imperfect cooperation, the degree of cooperation is evaluated in terms of the expected number of cooperators. It is shown that: (i) the expected number of cooperators is maximized at an equilibrium, a combination of strategies each of which is a type of trigger strategy; (ii) the maximum expected number of cooperators is attained in a state of imperfect cooperation for a range of payoff functions; and (iii) the maximum expected number of cooperators is non‐decreasing when the size of players’ group increases.     

Robustness of equilibria in anonymous local games

This paper studies the robustness of symmetric equilibria in anonymous local games to perturbations of prior beliefs. Two priors are strategically close on a class of games if players receive similar expected payoffs in equilibrium under the priors, for any game in that class. I show that if the structure of payoff interdependencies is sparse in a well-defined sense, the conditions for strategic proximity in anonymous local games are strictly weaker than the conditions for general Bayesian games of Kajii and Morris (1998) [11] when attention is restricted to symmetric equilibria. Hence, by exploiting the properties of anonymous local games, it is possible to obtain stronger robustness results for this class.     

Equilibrium selection in global games with strategic complementarities

We study games with strategic complementarities, arbitrary numbers of players and actions, and slightly noisy payoff signals. We prove limit uniqueness: as the signal noise vanishes, the game has a unique strategy profile that survives iterative dominance. This generalizes a result of Carlsson and van Damme (Econometrica 61 (1993) 989-1018) for two-player, two-action games. The surviving profile, however, may depend on fine details of the structure of the noise. We provide sufficient conditions on payoffs for there to be noise-independent selection.     

Competitive experimentation with private information: The survivor's curse

We study a winner-take-all R&D race between two firms that are privately informed about the arrival rate of an invention. Over time, each firm only observes whether the opponent left the race or not. The equilibrium displays a strong herding effect, that we call a ‘survivor's curse.’ Unlike in the case of symmetric information, the two firms may quit the race (nearly) simultaneously even when their costs and benefits for research differ significantly.