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...

In an important paper, Weinstein and Yildiz (2007) show that if players have an infinite depth of reasoning and this is commonly believed, types generically have a unique rationalizable action in games that satisfy a richness condition. We show that this result does not extend to environments...

We consider a general-sum N-player linear-quadratic game with stochastic dynamics over a finite horizon and prove the global convergence of the natural policy gradient method to the Nash equilibrium. In order to prove convergence of the method we require a certain amount of noise in the system....

This paper provides two conditions of epistemic robustness, robustness to alternative best replies and robustness to non-best replies, and uses them to characterize variants of curb sets in finite games, including the set of rationalizable strategies. -- epistemic game theory ; epistemic...

This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets. -- Epistemic game theory ; epistemic stability ; rationalizability ;...