Discrete Screening
Alejandro Francetich, Burkhard C. Schipper

TL;DR
This paper develops a discrete screening model for principal-agent problems with discrete types and contracts, analyzing solution uniqueness, monotonicity, and introducing a rationalizability concept for robust solution characterization.
Contribution
It introduces a discrete first-order approach to screening, characterizes solution properties, and proposes a robust rationalizability framework for discrete contract menus.
Findings
Solutions to discrete F.O.C.s may not be unique.
At most two adjacent optimal contract quantities per type.
Weak monotonicity of quantities can be achieved under certain conditions.
Abstract
We consider a principal who wishes to screen an agent with \emph{discrete} types by offering a menu of \emph{discrete} quantities and \emph{discrete} transfers. We assume that the principal's valuation is discrete strictly concave and use a discrete first-order approach. We model the agent's cost types as non-integer, with integer types as a limit case. Our modeling of cost types allows us to replicate the typical constraint-simplification results and thus to emulate the well-treaded steps of screening under a continuum of contracts. We show that the solutions to the discrete F.O.C.s need not be unique \textit{even under discrete strict concavity}, but we also show that there cannot be more than two optimal contract quantities for each type, and that -- if there are two -- they must be adjacent. Moreover, we can only ensure weak monotonicity of the quantities \textit{even if virtual…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Game Theory and Applications · Game Theory and Voting Systems
