We analyze investment decisions when information is costly, with and without delegation to an agent. We use a rational-inattention model and compare it with a canonical signal-extraction model. We identify three "investment conditions". In "sour" conditions, no information is acquired and no...

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

We define a concept of epistemic robustness in the context of an epistemic model of a finite normal game where a player type corresponds to a belief over the profiles of opponent strategies and types. A Cartesian product X of pure strategy subsets is epistemically robust if there is a Cartesian...

We define a concept of epistemic robustness in the context of an epistemic model of a finite normal-form game where a player type corresponds to a belief over the profiles of opponent strategies and types. A Cartesian product X of pure-strategy subsets is epistemically robust if there is a...

Sets closed under rational behavior were introduced by Basu and Weibull (1991) as subsets of the strategy space that contain all best replies to all strategy profiles in the set. We here consider a more restrictive notion of closure under rational behavior: a subset of the strategy space is...