Open AccessConstrained preference elicitation
Author(s) -
Azrieli Yaron,
Chambers Christopher P.,
Healy Paul J.
Publication year - 2021
Publication title -
theoretical economics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 4.404
H-Index - 32
eISSN - 1555-7561
pISSN - 1933-6837
DOI - 10.3982/te4208
Subject(s) - planner , preference relation , preference , computer science , type (biology) , space (punctuation) , preference elicitation , relation (database) , mathematical economics , convexity , microeconomics , mathematics , artificial intelligence , economics , data mining , ecology , financial economics , biology , operating system
A planner wants to elicit information about an agent's preference relation, but not the entire ordering. Specifically, preferences are grouped into “types,” and the planner wants only to elicit the agent's type. We first assume that beliefs about randomization are subjective, and show that a space of types is elicitable if and only if each type is defined by what the agent would choose from some list of menus. If beliefs are objective, then additional type spaces can be elicited, though a convexity condition must be satisfied. These results remain unchanged when we consider a setting with multiple agents.