IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v83y2016icp35-43.html
   My bibliography  Save this article

Selecting winners with partially honest jurors

Author

Listed:
  • Yadav, Sonal

Abstract

We consider the effect of “partially honest” jurors (along the lines of Dutta and Sen (2012)) in a model of juror decisions developed in Amorós (2013). We analyse the problem of choosing the w contestants who will win a competition within a group of n>w competitors. All jurors know who the w best contestants are. All the jurors commonly observe who the w best contestants are, but they may be biased (in favour of or against some contestants). We assume that some of these jurors are partially honest. A partially honest individual has a strict preference for revealing the true state over lying when truth-telling does not lead to a worse outcome (according to preferences in the true state) than that which obtains when lying. The socially optimal rule is to always select the w best contestants, in every possible state of the world. We first look at the many person implementation, when the jury consists of at least two partially honest jurors, whose identity is not known to the planner. We find that the socially optimal rule is Nash implementable if for each pair of contestants, there are two jurors who treat the pair in an unbiased manner and one of these jurors is partially honest. However it is not necessary for the planner to know the identity of the jurors who are fair over a given pair. The result shows that the presence of partially honest jurors expands the scope of implementation. We also analyse the problem, when there are only two jurors and consider cases both with and without the assumption of partial honesty.

Suggested Citation

  • Yadav, Sonal, 2016. "Selecting winners with partially honest jurors," Mathematical Social Sciences, Elsevier, vol. 83(C), pages 35-43.
    • Handle: RePEc:eee:matsoc:v:83:y:2016:i:c:p:35-43
    DOI: 10.1016/j.mathsocsci.2016.05.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489616300385
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2016.05.005?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dutta, Bhaskar & Sen, Arunava, 2012. "Nash implementation with partially honest individuals," Games and Economic Behavior, Elsevier, vol. 74(1), pages 154-169.
    2. Lombardi, Michele, 2010. "Two-agent Nash implementation with partially-honest agents: Almost Full Characterizations," MPRA Paper 27834, University Library of Munich, Germany.
    3. Lombardi, Michele & Yoshihara, Naoki & 吉原, 直毅 & ヨシハラ, ナオキ, 2011. "Partially-honest Nash implementation: Characterization results," Discussion Paper Series 555, Institute of Economic Research, Hitotsubashi University.
    4. , & ,, 2012. "Implementation with evidence," Theoretical Economics, Econometric Society, vol. 7(2), May.
    5. Matsushima, Hitoshi, 2008. "Role of honesty in full implementation," Journal of Economic Theory, Elsevier, vol. 139(1), pages 353-359, March.
    6. Bhaskar Dutta & Arunava Sen, 1991. "A Necessary and Sufficient Condition for Two-Person Nash Implementation," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 58(1), pages 121-128.
    7. Moore, John & Repullo, Rafael, 1990. "Nash Implementation: A Full Characterization," Econometrica, Econometric Society, vol. 58(5), pages 1083-1099, September.
    8. Francesca Busetto & Giulio Codognato, 2009. "Reconsidering two-agent Nash implementation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(2), pages 171-179, February.
    9. Amoros, Pablo & Corchon, Luis C. & Moreno, Bernardo, 2002. "The Scholarship Assignment Problem," Games and Economic Behavior, Elsevier, vol. 38(1), pages 1-18, January.
    10. repec:hal:pseose:halshs-00754592 is not listed on IDEAS
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Amorós, Pablo, 2023. "Implementing optimal scholarship assignments via backward induction," Mathematical Social Sciences, Elsevier, vol. 125(C), pages 1-10.
    2. Amorós, Pablo, 2023. "Evaluation and strategic manipulation," Journal of Mathematical Economics, Elsevier, vol. 106(C).
    3. Hitoshi Matsushima, 2020. "Implementation, Honesty, and Common Knowledge," CARF F-Series CARF-F-500, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    4. Matsushima, Hitoshi, 2022. "Epistemological implementation of social choice functions," Games and Economic Behavior, Elsevier, vol. 136(C), pages 389-402.
    5. Altun, Ozan Altuğ & Barlo, Mehmet & Dalkıran, Nuh Aygün, 2023. "Implementation with a sympathizer," Mathematical Social Sciences, Elsevier, vol. 121(C), pages 36-49.

    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. Lombardi, Michele & Yoshihara, Naoki & 吉原, 直毅 & ヨシハラ, ナオキ, 2011. "Partially-honest Nash implementation: Characterization results," Discussion Paper Series 555, Institute of Economic Research, Hitotsubashi University.
    2. Lombardi, Michele & Yoshihara, Naoki, 2013. "Natural implementation with partially honest agents in economic environments," MPRA Paper 48294, University Library of Munich, Germany.
    3. Dutta, Bhaskar & Sen, Arunava, 2012. "Nash implementation with partially honest individuals," Games and Economic Behavior, Elsevier, vol. 74(1), pages 154-169.
    4. Laslier, Jean-François & Núñez, Matías & Pimienta, Carlos, 2017. "Reaching consensus through approval bargaining," Games and Economic Behavior, Elsevier, vol. 104(C), pages 241-251.
    5. Michele Lombardi & Naoki Yoshihara, 2020. "Partially-honest Nash implementation: a full characterization," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(3), pages 871-904, October.
    6. Lombardi, Michele & Yoshihara, Naoki, 2016. "Partially-honest Nash Implementation with Non-connected Honesty Standards," Discussion Paper Series 633, Institute of Economic Research, Hitotsubashi University.
    7. Lombardi, M. & Yoshihara, N., 2018. "Treading a fine line: (Im)possibilities for Nash implementation with partially-honest individuals," Games and Economic Behavior, Elsevier, vol. 111(C), pages 203-216.
    8. Altun, Ozan Altuğ & Barlo, Mehmet & Dalkıran, Nuh Aygün, 2023. "Implementation with a sympathizer," Mathematical Social Sciences, Elsevier, vol. 121(C), pages 36-49.
    9. Laslier, Jean-François & Núñez, Matías & Remzi Sanver, M., 2021. "A solution to the two-person implementation problem," Journal of Economic Theory, Elsevier, vol. 194(C).
    10. Michele Lombardi & Naoki Yoshihara, 2013. "A full characterization of nash implementation with strategy space reduction," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(1), pages 131-151, September.
    11. Doghmi, Ahmed & Ziad, Abderrahmane, 2015. "Nash implementation in private good economies with single-plateaued preferences and in matching problems," Mathematical Social Sciences, Elsevier, vol. 73(C), pages 32-39.
    12. Ahmed Doghmi & Abderrahmane ZIAD, 2012. "On Partial Honesty Nash Implementation," Economics Working Paper Archive (University of Rennes & University of Caen) 201201, Center for Research in Economics and Management (CREM), University of Rennes, University of Caen and CNRS.
    13. Michele Lombardi & Naoki Yoshihara, 2017. "Treading a Â…fine line: (Im)possibilities for Nash implementation with partially-honest individuals," Working Papers SDES-2017-14, Kochi University of Technology, School of Economics and Management, revised Aug 2017.
    14. Ahmed Doghmi, 2013. "Nash Implementation in an Allocation Problem with Single-Dipped Preferences," Games, MDPI, vol. 4(1), pages 1-12, January.
    15. Ahmed Doghmi & Abderrahmane Ziad, 2013. "Nash Implementation in Private Good Economies with Single-Plateaued Preferences," Economics Working Paper Archive (University of Rennes & University of Caen) 201311, Center for Research in Economics and Management (CREM), University of Rennes, University of Caen and CNRS.
    16. Kartik, Navin & Tercieux, Olivier & Holden, Richard, 2014. "Simple mechanisms and preferences for honesty," Games and Economic Behavior, Elsevier, vol. 83(C), pages 284-290.
    17. Lee, Jihong & Sabourian, Hamid, 2015. "Complexity and repeated implementation," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 259-292.
    18. Amorós, Pablo, 2016. "Subgame perfect implementation of the deserving winner of a competition with natural mechanisms," Mathematical Social Sciences, Elsevier, vol. 83(C), pages 44-57.
    19. Doghmi, Ahmed, 2011. "A Simple Necessary Condition for Partially Honest Nash Implementation," MPRA Paper 67231, University Library of Munich, Germany, revised 14 Oct 2015.
    20. Kimya, Mert, 2017. "Nash implementation and tie-breaking rules," Games and Economic Behavior, Elsevier, vol. 102(C), pages 138-146.

    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:eee:matsoc:v:83:y:2016:i:c:p:35-43. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.