登入選單

返回Google圖書搜尋

Rationalizability and Nash Equilibria in Guessing Games

Christian Seel

出版	SSRN, 2017
URL	http://books.google.com.hk/books?id=V5r8zgEACAAJ&hl=&source=gbs_api

註釋

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.