Finite Tests from Functional Characterizations
Classically, testing whether decision makers belong to specific preference classes involves two main approaches. The first, known as the functional approach, assumes access to an entire demand function. The second, the revealed preference approach, constructs inequalities to test finite demand data. This paper bridges these methods by using the functional approach to test finite data through preference learnability results. We develop a computationally efficient algorithm that generates tests for choice data based on functional characterizations of preference families. We provide these restrictions for various applications, including homothetic and weakly separable preferences, where the latter's revealed preference characterization is provably NP-Hard. We also address choice under uncertainty, offering tests for betweenness preferences. Lastly, we perform a simulation exercise demonstrating that our tests are effective in finite samples and accurately reject demands not belonging to a specified class.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Quantal Response Equilibrium with a Continuum of Types: Characterization and Nonparametric Identification
Quantal response equilibrium (QRE), a statistical generalization of Nash equilibrium, is a standard benchmark in the analysis of experimental data. Despite its influence, nonparametric characterizations and tests of QRE …
Law-Invariant Return and Star-Shaped Risk Measures
This paper presents novel characterization results for classes of law-invariant star-shaped functionals. We begin by establishing characterizations for positively homogeneous and star-shaped functionals that exhibit seco…
Weight-conserving characterization of complex functional brain networks
Complex functional brain networks are large networks of brain regions and functional brain connections. Statistical characterizations of these networks aim to quantify global and local properties of brain activity with a…
Model-theoretic Characterizations of Existential Rule Languages
Existential rules, a.k.a. dependencies in databases, and Datalog+/- in knowledge representation and reasoning recently, are a family of important logical languages widely used in computer science and artificial intellige…
modelPermutation Tests for Equality of Distributions of Functional Data
Economic data are often generated by stochastic processes that take place in continuous time, though observations may occur only at discrete times. For example, electricity and gas consumption take place in continuous ti…