Does Rational Learning Lead to Nash Equilibrium in Finitely Repeated Games?

1998 ◽  
Vol 78 (1) ◽  
pp. 195-218 ◽  
Author(s):  
Alvaro Sandroni
Author(s):  
George J. Mailath ◽  
Steven A. Matthews ◽  
Tadashi Sekiguchi

We present three examples of finitely repeated games with public monitoring that have sequential equilibria in private strategies, i.e., strategies that depend on own past actions as well as public signals. Such private sequential equilibria can have features quite unlike those of the more familiar perfect public equilibria: (i) making a public signal less informative can create Pareto superior equilibrium outcomes; (ii) the equilibrium final-period action profile need not be a stage game equilibrium; and (iii) even if the stage game has a unique correlated (and hence Nash) equilibrium, the first-period action profile need not be a stage game equilibrium.


Top ◽  
2009 ◽  
Vol 17 (1) ◽  
pp. 85-95
Author(s):  
Ignacio García-Jurado ◽  
Natividad Llorca ◽  
Ana Meca ◽  
Manuel A. Pulido ◽  
Joaquín Sánchez-Soriano

Games ◽  
2020 ◽  
Vol 11 (4) ◽  
pp. 45
Author(s):  
Lina Andersson

This paper uses the framework of stochastic games to propose a model of emotions in repeated interactions. An emotional player can be in either a friendly, a neutral, or a hostile state of mind. The player transitions between the states of mind as a response to observed actions taken by the other player. The state of mind determines the player’s psychological payoff which together with a material payoff constitutes the player’s utility. In the friendly (hostile) state of mind the player has a positive (negative) concern for other players’ material payoffs. This paper shows how emotions can both facilitate and obstruct cooperation in a repeated prisoners’ dilemma game. In finitely repeated games a player who cares only for their own material payoffs can have an incentive to manipulate an emotional player into the friendly state of mind. In infinitely repeated games with two emotional players less patience is required to sustain cooperation. However, emotions can also obstruct cooperation if they make the players unwilling to punish each other, or if the players become hostile when punished.


2005 ◽  
Vol 39 (1) ◽  
pp. 55-66 ◽  
Author(s):  
Michael L. Littman ◽  
Peter Stone

1987 ◽  
Vol 16 (3) ◽  
pp. 197-204 ◽  
Author(s):  
J. -P. Benoit ◽  
V. Krishna

Econometrica ◽  
1993 ◽  
Vol 61 (2) ◽  
pp. 303 ◽  
Author(s):  
Jean-Pierre Benoit ◽  
Vijay Krishna

2016 ◽  
Vol 11 (1) ◽  
pp. 157-185 ◽  
Author(s):  
Jonathan Weinstein ◽  
Muhamet Yildiz

Author(s):  
Shuxin Li ◽  
Xiaohong Li ◽  
Jianye Hao ◽  
Bo An ◽  
Zhiyong Feng ◽  
...  

The Man-in-the-Middle (MITM) attack has become widespread in networks nowadays. The MITM attack would cause serious information leakage and result in tremendous loss to users. Previous work applies game theory to analyze the MITM attack-defense problem and computes the optimal defense strategy to minimize the total loss. It assumes that all defenders are cooperative and the attacker know defenders' strategies beforehand. However, each individual defender is rational and may not have the incentive to cooperate. Furthermore, the attacker can hardly know defenders' strategies ahead of schedule in practice. To this end, we assume that all defenders are self-interested and model the MITM attack-defense scenario as a simultaneous-move game. Nash equilibrium is adopted as the solution concept which is proved to be always unique. Given the impracticability of computing Nash equilibrium directly, we propose practical adaptive algorithms for the defenders and the attacker to learn towards the unique Nash equilibrium through repeated interactions. Simulation results show that the algorithms are able to converge to Nash equilibrium strategy efficiently.


Sign in / Sign up

Export Citation Format

Share Document