Attention Overload
We introduce an Attention Overload Model (AOM) in which alternatives compete for attention, so each alternative's consideration probability weakly decreases as the choice problem expands. This nonparametric restriction has a search-capacity foundation. We identify exactly which preference rankings are compatible with observed choices and establish sharp bounds on latent attention. We then consider heterogeneous preferences in settings where alternatives are presented in a list, establishing nonparametric identification results for attention and the distribution of preferences. We also develop high-dimensional inference and finite-sample methods for these models. Using the travel-mode experiment of Wang and Zhu (2025), we illustrate the methods and find that recovered pairwise preference shares closely match subjects' self-reported rankings.