I investigate the existence of epistemic models for complete information games that satisfy the following properties: (R) players do not rule out their opponents use rational ex ante strategies for deriving their choices, (K) they do not rule out, ex ante, that they can come to know the action...

We analyze a symmetric n-firm Cournot oligopoly with a heterogeneous population of optimizers and imitators. Imitators mimic the output decision of the most successful firms of the previous round à la Vega-Redondo (1997). Optimizers play a myopic best response to the opponents' previous output....

We study costless pre-play communication of intentions among inexperienced players. Using the level-k model of strategic thinking to describe players' beliefs, we fully characterize the effects of pre-play communication in symmetric 2×2 games. One-way communication weakly increases coordination...

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 use an experiment to explore how subjects learn to play against computers which are programmed to follow one of a number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious play, imitation, reinforcement learning, and a trial...