The Luce Model, Regularity, and Choice Overload
We characterize regularity (Block & Marschak, 1960) within a novel stochastic model: the General Threshold Luce model [GTLM]. We apply our results to study choice overload, identified by regularity violations that impose a welfare cost on the decision-maker. Generalizing our characterization results, we identify necessary and sufficient conditions for choice overload within GTLMs and, in doing so, disentangle two well-known causes: low discriminatory power (Frick, 2016) and limited attention (Lleras et al., 2017).
Code (0)
등록된 구현이 없습니다.
Tasks
modelMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Pairwise Choice Markov Chains
As datasets capturing human choices grow in richness and scale -- particularly in online domains -- there is an increasing need for choice models that escape traditional choice-theoretic axioms such as regularity, stocha…
Free-Choice Nets With Home Clusters Are Lucent
A marked Petri net is lucent if there are no two different reachable markings enabling the same set of transitions, i.e., states are fully characterized by the transitions they enable. Characterizing the class of systems…
A Better Test of Choice Overload
Choice overload - in which larger choice sets are detrimental to a chooser's well-being - is potentially of great importance in the design of economic policy. Yet the current evidence on its prevalence is inconclusive. W…
A Canon of Probabilistic Rationality
We prove that a random choice rule satisfies Luce's Choice Axiom if and only if its support is a choice correspondence that satisfies the Weak Axiom of Revealed Preference, thus it consists of alternatives that are optim…
A Revealed Preference Framework for AI Alignment
Human decision makers increasingly delegate choices to AI agents, raising a natural question: does the AI implement the human principal's preferences or pursue its own? To study this question using revealed preference te…