Screening for Choice Sets

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Gan, Tan, Li, Yingkai
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866912840371142656
author Gan, Tan
Li, Yingkai
author_facet Gan, Tan
Li, Yingkai
contents We study a screening problem in which an agent privately observes a set of feasible technologies and can strategically disclose only a subset to the principal. The principal then takes an action whose payoff consequences for both players are publicly known. Under the assumption that the possible technology sets are ordered by set inclusion, we show that the optimal mechanism promises the agent a utility that is weakly increasing as the reported set expands, and the choice of the principal maximizes her own utility subject to this promised utility constraint. Moreover, the optimal promised utility either coincides with the agent's utility under the complete information benchmark or remains locally constant, with the number of constant segments bounded by the number of downward-sloping segments of the complete information benchmark.
format Preprint
id arxiv_https___arxiv_org_abs_2601_15580
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Screening for Choice Sets
Gan, Tan
Li, Yingkai
Theoretical Economics
Computer Science and Game Theory
We study a screening problem in which an agent privately observes a set of feasible technologies and can strategically disclose only a subset to the principal. The principal then takes an action whose payoff consequences for both players are publicly known. Under the assumption that the possible technology sets are ordered by set inclusion, we show that the optimal mechanism promises the agent a utility that is weakly increasing as the reported set expands, and the choice of the principal maximizes her own utility subject to this promised utility constraint. Moreover, the optimal promised utility either coincides with the agent's utility under the complete information benchmark or remains locally constant, with the number of constant segments bounded by the number of downward-sloping segments of the complete information benchmark.
title Screening for Choice Sets
topic Theoretical Economics
Computer Science and Game Theory
url https://arxiv.org/abs/2601.15580