Papers
Topics
Authors
Recent
Search
2000 character limit reached

Adversarial Elicitation

Published 14 Feb 2026 in econ.TH | (2602.13645v1)

Abstract: When multiple informative equilibria are possible in a general cheap talk game, how much information can a principal guarantee herself? To answer this question, I define the notion of worst-case implementation-implementation via the worst non-trivial equilibrium of a mechanism. Under this objective, standard full-commitment mechanisms fail, yielding the principal no more than her no-communication payoff. Partial commitment, however, can provide a strict improvement. The possibility of facing a strategic, uncommitted principal disciplines the agent's reporting incentives across all equilibria. I characterize the worst-case optimal mechanism and payoff under weak assumptions on the players' preferences. The optimal mechanism has a simple two-message structure. The agent's messages are polarizing, designed to maximize their strategic impact on the uncommitted principal's actions. If full commitment is interpreted as decision automation, these results highlight a fundamental complementarity between automated and human decision-makers: the presence of a human aligns the agent's incentives to reveal information, while the automated system leverages these informative reports to take accurate actions. This strategic interaction is often overlooked by literature that compares the two based on standalone decision accuracy. Applications of the model include bail-setting automation, fintech lending, delegation, lobbying, and audit design.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.