Building on Arad and Rubinstein (2013), we introduce tournaments as simultaneous n-player games based on an m-player game g. A player meets each group of m-1 opponents m! times to play g in alternating roles. The winner of the tournament is the player who attains the highest accumulated score. We explore the relationship between the equilibria of the tournament and the equilibria of the game g and confirm that tournaments provide a refinement criterion. We compare it with standard refinements in the literature and show that it is satisfied by strict equilibria. We use our tournament model to study a selection of relevant economic applications, including risk-taking behavior.
Tournament-stable equilibria
De Sinopoli, Francesco;Meroni, Claudia
;
2020-01-01
Abstract
Building on Arad and Rubinstein (2013), we introduce tournaments as simultaneous n-player games based on an m-player game g. A player meets each group of m-1 opponents m! times to play g in alternating roles. The winner of the tournament is the player who attains the highest accumulated score. We explore the relationship between the equilibria of the tournament and the equilibria of the game g and confirm that tournaments provide a refinement criterion. We compare it with standard refinements in the literature and show that it is satisfied by strict equilibria. We use our tournament model to study a selection of relevant economic applications, including risk-taking behavior.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
