IDEAS home Printed from https://ideas.repec.org/p/hal/wpaper/hal-05319200.html

Advising with Threshold Tests: Complexity, Signaling, and Effort

Author

Listed:
  • Mark Izgarshev

    (School number 1239, Moscow)

  • Georgy Lukyanov

    (TSE-R - Toulouse School of Economics - UT Capitole - Université Toulouse Capitole - Comue de Toulouse - Communauté d'universités et établissements de Toulouse - EHESS - École des hautes études en sciences sociales - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

Abstract

A benevolent advisor observes a project's complexity and posts a pass–fail threshold before the agent chooses effort. The project suc-ceeds only if ability and effort together clear complexity. We com-pare two informational regimes. In the naive regime, the threshold is treated as non-informative; in the sophisticated regime, the threshold is a signal and the agent updates beliefs. We characterize equilibrium threshold policies and show that the optimal threshold rises with com-plexity under mild regularity. We then give primitives-based sufficient conditions that guarantee separating, pooling, or semi-separating out-comes. In a benchmark with uniform ability, exponential complexity, and power costs, we provide explicit parameter regions that partition the space by equilibrium type; a standard refinement eliminates most pooling. The results yield transparent comparative statics and welfare comparisons across regimes.

Suggested Citation

  • Mark Izgarshev & Georgy Lukyanov, 2025. "Advising with Threshold Tests: Complexity, Signaling, and Effort," Working Papers hal-05319200, HAL.
  • Handle: RePEc:hal:wpaper:hal-05319200
    Note: View the original document on HAL open archive server: https://hal.science/hal-05319200v1
    as

    Download full text from publisher

    File URL: https://hal.science/hal-05319200v1/document
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:hal:wpaper:hal-05319200. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.