Limited attention and models of choice: A behavioral equivalence
We show that many models of choice can be alternatively represented as special cases of choice with limited attention (Masatlioglu, Nakajima, and Ozbay, 2012), singling out the properties of the unobserved attention filters that explain the observed choices.For each specification, information about the DM's consideration sets and preference is inferred from violations of the contraction consistency axiom, and it is compared with the welfare indications obtained from equivalent models. Remarkably, limited attention always supports the elicitation of DM's taste arising from alternative methods. Finally, we examine the intersections between subclasses, and we verify that each of them is independent of the others.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Nontransitive Preferences and Stochastic Rationalizability: A Behavioral Equivalence
Nontransitive choices have long been an area of curiosity within economics. However, determining whether nontransitive choices represent an individual's preference is a difficult task since choice data is inherently stoc…
Information Design of Dynamic Mechanisms
Two dynamic game forms are said to be behaviorally equivalent if they share the "same" profiles of structurally reduced strategies (Battigalli et al., 2020). In the context of dynamic implementation, behaviorally equival…
Reference Dependence and Random Attention
We explore the ways that a reference point may direct attention. Utilizing a stochastic choice framework, we provide behavioral foundations for the Reference-Dependent Random Attention Model (RD-RAM). Our characterizatio…
Revisiting Padded Transformer Expressivity: Which Architectural Choices Matter and Which Don't
Recent work describes what transformers can and cannot compute through connections to boolean circuits, but existing results lack exact characterizations and are sensitive to modeling choices. Padded transformers -- to w…
Strong Equivalence for LPMLN Programs
LPMLN is a probabilistic extension of answer set programs with the weight scheme adapted from Markov Logic. We study the concept of strong equivalence in LPMLN, which is a useful mathematical tool for simplifying a part …