Rationalizability and Nash equilibria in guessing games

B-Tier
Journal: Games and Economic Behavior
Year: 2017
Volume: 106
Issue: C
Pages: 75-88

Authors (2)

Seel, Christian (Maastricht University) Tsakas, Elias (not in RePEc)

Score contribution per author:

1.005 = (α=2.01 / 2 authors) × 1.0x B-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

Abstract

Games in which players aim to guess a fraction or multiple p of the average guess are known as guessing games or (p-)beauty contests. In this note, we derive a full characterization of the set of rationalizable strategies and the set of pure strategy Nash equilibria for such games as a function of the parameter p, the number of players and the (discrete) set of available guesses to each player.

Technical Details

RePEc Handle
repec:eee:gamebe:v:106:y:2017:i:c:p:75-88
Journal Field
Theory
Author Count
2
Added to Database
2026-01-29