IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2208.05897.html
   My bibliography  Save this paper

Incentivizing Hidden Types in Secretary Problem

Author

Listed:
  • Longjian Li
  • Alexis Akira Toda

Abstract

We study a game between $N$ job applicants who incur a cost $c$ (relative to the job value) to reveal their type during interviews and an administrator who seeks to maximize the probability of hiring the best. We define a full learning equilibrium and prove its existence, uniqueness, and optimality. In equilibrium, the administrator accepts the current best applicant $n$ with probability $c$ if $n

Suggested Citation

  • Longjian Li & Alexis Akira Toda, 2022. "Incentivizing Hidden Types in Secretary Problem," Papers 2208.05897, arXiv.org, revised Jul 2024.
    • Handle: RePEc:arx:papers:2208.05897
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Kimmo Eriksson & Jonas Sjöstrand & Pontus Strimling, 2007. "Optimal Expected Rank in a Two-Sided Secretary Problem," Operations Research, INFORMS, vol. 55(5), pages 921-931, October.
    2. Steve Alpern & Shmuel Gal, 2009. "Analysis and design of selection committees: a game theoretic secretary problem," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(3), pages 377-394, November.
    3. Alpern, Steve & Gal, Shmuel & Solan, Eilon, 2010. "A sequential selection game with vetoes," Games and Economic Behavior, Elsevier, vol. 68(1), pages 1-14, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Steve Alpern & Vic Baston, 2017. "The Secretary Problem with a Selection Committee: Do Conformist Committees Hire Better Secretaries?," Management Science, INFORMS, vol. 63(4), pages 1184-1197, April.
    2. Rohan DUTTA, 2016. "Joint Search with No Information: An Inefficient Immediate Agreement Theorem," Cahiers de recherche 12-2016, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    3. , & ,, 2013. "Specialization and partisanship in committee search," Theoretical Economics, Econometric Society, vol. 8(3), September.
    4. Dutta, Rohan, 2017. "Joint search with no information: An immediate agreement theorem," Economics Letters, Elsevier, vol. 160(C), pages 43-45.
    5. Francis X. Flanagan, 2015. "Peremptory Challenges and Jury Selection," Journal of Law and Economics, University of Chicago Press, vol. 58(2), pages 385-416.
    6. E. M. Parilina & A. Tampieri, 2013. "Marriage Formation with Assortative Meeting as a Two-Sided Optimal Stopping Problem," Working Papers wp886, Dipartimento Scienze Economiche, Universita' di Bologna.
    7. Alpern, S. & Katrantzi, I. & Ramsey, D.M., 2013. "Partnership formation with age-dependent preferences," European Journal of Operational Research, Elsevier, vol. 225(1), pages 91-99.
    8. Kimmo Eriksson & Olle Häggström, 2008. "Instability of matchings in decentralized markets with various preference structures," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 409-420, March.
    9. Alpern, Steve & Katrantzi, Ioanna & Ramsey, David, 2014. "Equilibrium population dynamics when mating is by mutual choice based on age," Theoretical Population Biology, Elsevier, vol. 94(C), pages 63-72.
    10. Alpern, Steve & Chen, Bo, 2017. "The importance of voting order for jury decisions by sequential majority voting," European Journal of Operational Research, Elsevier, vol. 258(3), pages 1072-1081.
    11. Steve Alpern & Bo Chen, 2017. "Who should cast the casting vote? Using sequential voting to amalgamate information," Theory and Decision, Springer, vol. 83(2), pages 259-282, August.
    12. Kimmo Eriksson & Jonas Sjöstrand & Pontus Strimling, 2008. "Asymmetric equilibria in dynamic two-sided matching markets with independent preferences," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 421-440, March.
    13. Eriksson, Kimmo & Strimling, Pontus, 2010. "The devil is in the details: Incorrect intuitions in optimal search," Journal of Economic Behavior & Organization, Elsevier, vol. 75(2), pages 338-347, August.
    14. Steve Alpern & Bo Chen, 2020. "Optimizing Voting Order on Sequential Juries: A Median Voter Theorem and Beyond," Papers 2006.14045, arXiv.org, revised Oct 2021.
    15. Steve Alpern & Bo Chen, 2022. "Optimizing voting order on sequential juries: a median voter theorem and beyond," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 58(3), pages 527-565, April.
    16. Werner Guth & Torsten Weiland, 2011. "Aspiration formation and satisficing in search with(out) competition," New Zealand Economic Papers, Taylor & Francis Journals, vol. 45(1-2), pages 23-45.
    17. Daniel Cownden & David Steinsaltz, 2014. "Effects of Competition in a Secretary Problem," Operations Research, INFORMS, vol. 62(1), pages 104-113, February.
    18. Alpern, Steve & Gal, Shmuel & Solan, Eilon, 2010. "A sequential selection game with vetoes," Games and Economic Behavior, Elsevier, vol. 68(1), pages 1-14, January.
    19. Tadeas Priklopil & Krishnendu Chatterjee, 2015. "Evolution of Decisions in Population Games with Sequentially Searching Individuals," Games, MDPI, vol. 6(4), pages 1-25, September.
    20. Inukai, Keigo & Kawata, Keisuke & Sasaki, Masaru, 2017. "Committee Search with Ex-ante Heterogeneous Agents: Theory and Experimental Evidence," IZA Discussion Papers 10760, Institute of Labor Economics (IZA).

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:2208.05897. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.