scholarly journals Trust and betrayals: Reputational payoffs and behaviors without commitment

2021 ◽  
Vol 16 (2) ◽  
pp. 449-475
Author(s):  
Harry Pei

I study a repeated game in which a patient player wants to win the trust of some myopic opponents, but can strictly benefit from betraying them. His benefit from betrayal is strictly positive and is his persistent private information. I characterize every type of patient player's highest equilibrium payoff and construct equilibria that attain this payoff. Since the patient player's Stackelberg action is mixed and motivating the lowest‐benefit type to play mixed actions is costly, every type's highest equilibrium payoff is strictly lower than his Stackelberg payoff. In every equilibrium where the patient player approximately attains his highest equilibrium payoff, no type of the patient player plays stationary strategies or completely mixed strategies.

2010 ◽  
Vol 145 (1) ◽  
pp. 63-84 ◽  
Author(s):  
Olivier Gossner ◽  
Johannes Hörner

2019 ◽  
Vol 26 (2) ◽  
pp. 477-487
Author(s):  
Bruno Chiarini ◽  
Elisabetta Marzano

Purpose Crime games cannot be simply read with mixed strategies. These strategies are inconclusive of how the players act rationally. This is undeniably true for the crime of tax evasion, where dishonest taxpayers are rational agents, motivated by the comparison of payoffs, when considering the risk of non-compliance. The purpose of this paper is to illustrate that in the presence of a small “private disturbance” of the players’ payoff, the Nash equilibrium in mixed strategies provides us with the necessary information on equilibria in pure strategies that will be played. Design/methodology/approach In tax-evasion games, an equilibrium must necessarily be interpreted in pure strategies, and the only way to do this is to insert some private information into the game and reinterpret it in a Bayesian scheme. We show that taxpayers’ private,subjective considerations on the effective implementation of the penalty and the revenue agency’s private information on the cost of monitoring and conviction can lead to Bayesian equilibria in pure strategies. The present paper takes issue with this Bayesian equilibrium and the implications for comparative-statics results. Findings In this context, tougher sentencing deters crime, although, as the Italian experience teaches, the necessary condition required is the certainty of punishment and the ability of the government to enforce it. The equilibrium strategies with incomplete information reveal whether it is convenient for the two agents to maintain their “private disturbance” as private information or, on the contrary, it is convenient to expect it to be “common knowledge.” Originality/value A distinct set of studies has adopted a game theoretic approach and shows that the standard economic approach to crime deterrence inspired by Gary Beker’s seminal paper might be flawed. See, among others, Saha and Poole (2000), Tsebelis (1989) and Andreozzi (2010). This paper shows that a greater severity of the penalty and a higher certainty of punishment (a lower possibility of appealing against sanctions and no discounts on due penalties) necessarily lead to a unique Bayesian equilibrium without evasion.


2019 ◽  
Vol 65 (3) ◽  
pp. 271-295 ◽  
Author(s):  
Tadeusz Kufel ◽  
Sławomir Plaskacz ◽  
Joanna Zwierzchowska

The paper examines an infinitely repeated 3-player extension of the Prisoner’s Dilemma game. We consider a 3-player game in the normal form with incomplete information, in which each player has two actions. We assume that the game is symmetric and repeated infinitely many times. At each stage, players make their choices knowing only the average payoffs from previous stages of all the players. A strategy of a player in the repeated game is a function defined on the convex hull of the set of payoffs. Our aim is to construct a strong Nash equilibrium in the repeated game, i.e. a strategy profile being resistant to deviations by coalitions. Constructed equilibrium strategies are safe, i.e. the non-deviating player payoff is not smaller than the equilibrium payoff in the stage game, and deviating players’ payoffs do not exceed the nondeviating player payoff more than by a positive constant which can be arbitrary small and chosen by the non-deviating player. Our construction is inspired by Smale’s good strategies described in Smale’s paper (1980), where the repeated Prisoner’s Dilemma was considered. In proofs we use arguments based on approachability and strong approachability type results.


2020 ◽  
Vol 49 (4) ◽  
pp. 1129-1142
Author(s):  
Ghislain-Herman Demeze-Jouatsa

AbstractThis paper analyzes the set of pure strategy subgame perfect Nash equilibria of any finitely repeated game with complete information and perfect monitoring. The main result is a complete characterization of the limit set, as the time horizon increases, of the set of pure strategy subgame perfect Nash equilibrium payoff vectors of the finitely repeated game. This model includes the special case of observable mixed strategies.


2010 ◽  
Vol 26 (6) ◽  
pp. 1638-1662 ◽  
Author(s):  
Jean-Pierre Florens ◽  
Erwann Sbaï

This paper studies identification for a broad class of empirical games in a general functional setting. Global identification results are known for some specific models, e.g., in some standard auction models. We use functional formulations to obtain general criteria for local identification. These criteria can be applied to both parametric and nonparametric models, and also to models with asymmetry among players and affiliated private information. A benchmark model is developed where the structural parameters of interest are the distribution of private information and an additional dissociated parameter, such as a parameter of risk aversion. Criteria are derived for some standard auction models, games with exogenous variables, games with randomized strategies, such as mixed strategies, and games with strategic functions that cannot be derived analytically.


Sign in / Sign up

Export Citation Format

Share Document