On Rational Inattention with Arbitrary Choice Sets

Abstract

This paper points out that rational inattention is a nested regularized optimal transport problem. We use entropic optimal transport to establish the main results in Matejka and McKay (2015) and Caplin, Dean, and Leahy (2019) and extend them to arbitrary choice sets.