IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2602.13645.html

Adversarial Elicitation

Author

Listed:
  • Andrei Iakovlev

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.

Suggested Citation

  • Andrei Iakovlev, 2026. "Adversarial Elicitation," Papers 2602.13645, arXiv.org.
    • Handle: RePEc:arx:papers:2602.13645
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2602.13645
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2602.13645. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.