Search arXiv⌕ Search

arXiv · 2606.21120

Coordinating Treatment Allocation and Recommendation

Abstract

We study a model in which a sender allocates limited treatment to agents with heterogeneous quality and later recommends selected agents to a receiver, seeking to maximize the number of agents accepted by the receiver. All agents value treatment, which improves agents' quality, but treatment must be allocated before the sender observes agents' initial quality; recommendation occurs only after quality is learned. A natural benchmark is to design the two instruments separately: allocate treatment randomly first, and then recommend agents from the top down afterward. Our main result shows that the sender can do strictly better by coordinating treatment allocation with recommendations. In the optimal joint mechanism, treatment is non-monotone in quality: an intermediate group has a lower treatment probability than both higher- and lower-quality agents, but is compensated with a guaranteed recommendation when treatment is realized. We provide an implementation through contracts that induce self-selection and discuss applications to education, industrial policy, and startup incubation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Li Guo, Penghuan Yan. 2026-08-15. Coordinating Treatment Allocation and Recommendation. https://arxiv.org/abs/2606.21120

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Constraint Preferences: Inattention and Aggregation

We study robust decision problems when individuals have maxmin preferences whose belief sets are neighborhoods around reference models, commonly known as "constraint preferences." We first show that a more disciplined form of rationally inattentive behavior is equivalent to the behavior implied by a subclass of constraint preferences. We then introduce an aggregation principle that requires collective beliefs to satisfy every individual's constraint. This requirement links collective beliefs to the information-processing technologies that generate individual constraints. Applications reveal how these technologies determine asset prices, when prediction-market prices become self-confirming, and how much dynamic mechanisms can reduce information rents.

econ.TH↗

Insuring the Fallback: Capital, Monitoring, and the Certification of Preserved Human Capability under Improving AI

When generative AI makes the deliverable uninformative, a professional-services provider can still certify the preserved human capability to catch the machine's errors, through a liability pledge whose expected cost falls in that capability. The pledge is credible only up to what can be collected, and that ceiling is set by an underwriter, which bears part of the pledge and audits the insured. The range of client stakes over which one certificate separates has a width bounded by the provider's own capital plus the audited share of the underwriter's capacity, so unmonitored capacity adds nothing to it. Blind capital instead relocates that range upward, through a cross-subsidy that exists only under class rating. Monitoring converts capital into width, removes the cross-subsidy, raises the return to preserving skill, and, because audit information leaks, makes the certificate redundant beyond an interior precision.

econ.TH↗

Complementary Information Sources

A decision maker may have several information sources available and choose which one to consult only after learning the decision problem she faces. When is one such set of sources uniformly more valuable than another? For unrestricted Bayesian decision problems, we show that the answer can be stated entirely in terms of Blackwell comparisons. Form a tagged mixture by drawing a source independently of the state and revealing both its identity and its signal. One source set is more valuable in every decision problem if and only if each tagged mixture of the second source set is Blackwell dominated by some tagged mixture of the first. The result applies to compact, possibly infinite source sets and general signal spaces. It also has an exact quantitative counterpart: the largest normalized value shortfall is the directed Le Cam deficiency between the source sets' tagged hulls. The analogous program for monotone decision problems reveals a boundary. We call the passage from problem-by-problem source-set superiority to a problem-independent pairwise dominance a lifting. The Blackwell lifting does not extend directly to the Lehmann order: mixing sources that individually satisfy the monotone likelihood ratio property (MLRP) need not preserve MLRP, and even when it does, no fixed Lehmann-dominating mixture need exist. Requiring one source to serve a finite bundle of monotone decision problems restores the equivalence.

econ.TH↗