IDEAS home Printed from https://ideas.repec.org/p/ott/wpaper/2104e.html
   My bibliography  Save this paper

Obviously Strategy-proof Mechanism Design With Rich Private Information

Author

Listed:
  • Mariya Halushka

    (Department of Economics, University of Ottawa)

Abstract

I consider settings with rich private information – an agent's type may include private information other than just his preferences. In such settings, I identify a necessary condition for obviously strategy-proof implementation of social choice rules. I consider applications to strict preferences, matching and object allocation.

Suggested Citation

  • Mariya Halushka, 2021. "Obviously Strategy-proof Mechanism Design With Rich Private Information," Working Papers 2104E, University of Ottawa, Department of Economics.
    • Handle: RePEc:ott:wpaper:2104e
    as

    Download full text from publisher

    File URL: https://ruor.uottawa.ca/handle/10393/42041
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ashlagi, Itai & Gonczarowski, Yannai A., 2018. "Stable matching mechanisms are not obviously strategy-proof," Journal of Economic Theory, Elsevier, vol. 177(C), pages 405-425.
    2. Eric Maskin, 1999. "Nash Equilibrium and Welfare Optimality," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 66(1), pages 23-38.
    3. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    4. Marek Pycia & Peter Troyan, 2021. "A theory of simplicity in games and mechanism design," ECON - Working Papers 393, Department of Economics - University of Zurich.
    5. Kagel, John H & Harstad, Ronald M & Levin, Dan, 1987. "Information Impact and Allocation Rules in Auctions with Affiliated Private Values: A Laboratory Study," Econometrica, Econometric Society, vol. 55(6), pages 1275-1304, November.
    6. Rees-Jones, Alex, 2018. "Suboptimal behavior in strategy-proof mechanisms: Evidence from the residency match," Games and Economic Behavior, Elsevier, vol. 108(C), pages 317-330.
    7. Alejandro Martínez-Marquina & Muriel Niederle & Emanuel Vespa, 2019. "Failures in Contingent Reasoning: The Role of Uncertainty," American Economic Review, American Economic Association, vol. 109(10), pages 3437-3474, October.
    8. ,, 2015. "Serial dictatorship: the unique optimal allocation rule when information is endogenous," Theoretical Economics, Econometric Society, vol. 10(2), May.
    9. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    10. Luyao Zhang & Dan Levin, 2017. "Bounded Rationality and Robust Mechanism Design: An Axiomatic Approach," American Economic Review, American Economic Association, vol. 107(5), pages 235-239, May.
    11. Fujinaka, Yuji & Miyakawa, Toshiji, 2020. "Ex-post incentive compatible and individually rational assignments in housing markets with interdependent values," Journal of Mathematical Economics, Elsevier, vol. 91(C), pages 157-164.
    12. Jiangtao Li & Piotr Dworczak, 2020. "Are simple mechanisms optimal when agents are unsophisticated?," GRAPE Working Papers 42, GRAPE Group for Research in Applied Economics.
    13. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    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. Marek Pycia & Peter Troyan, 2021. "A theory of simplicity in games and mechanism design," ECON - Working Papers 393, Department of Economics - University of Zurich.
    2. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    3. Yves Breitmoser & Sebastian Schweighofer-Kodritsch, 2022. "Obviousness around the clock," Experimental Economics, Springer;Economic Science Association, vol. 25(2), pages 483-513, April.
    4. Shengwu Li, 2024. "Designing Simple Mechanisms," Papers 2403.18694, arXiv.org, revised Apr 2024.
    5. Clayton Thomas, 2020. "Classification of Priorities Such That Deferred Acceptance is Obviously Strategyproof," Papers 2011.12367, arXiv.org, revised Feb 2021.
    6. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    7. Louis Golowich & Shengwu Li, 2021. "On the Computational Properties of Obviously Strategy-Proof Mechanisms," Papers 2101.05149, arXiv.org, revised Oct 2022.
    8. Pablo Guillen & Róbert F. Veszteg, 2021. "Strategy-proofness in experimental matching markets," Experimental Economics, Springer;Economic Science Association, vol. 24(2), pages 650-668, June.
    9. Breitmoser, Yves & Schweighofer-Kodritsch, Sebastian, 2019. "Obviousness around the clock," Discussion Papers, Research Unit: Market Behavior SP II 2019-203, WZB Berlin Social Science Center.
    10. Andrew Komo & Scott Duke Kominers & Tim Roughgarden, 2024. "Shill-Proof Auctions," Papers 2404.00475, arXiv.org.
    11. Yannai A. Gonczarowski & Ori Heffetz & Clayton Thomas, 2022. "Strategyproofness-Exposing Mechanism Descriptions," Papers 2209.13148, arXiv.org, revised Jul 2023.
    12. Bó, Inácio & Hakimov, Rustamdjan, 2022. "The iterative deferred acceptance mechanism," Games and Economic Behavior, Elsevier, vol. 135(C), pages 411-433.
    13. Mandal, Pinaki & Roy, Souvik, 2022. "On obviously strategy-proof implementation of fixed priority top trading cycles with outside options," Economics Letters, Elsevier, vol. 211(C).
    14. Jiangtao Li & Piotr Dworczak, 2020. "Are simple mechanisms optimal when agents are unsophisticated?," GRAPE Working Papers 42, GRAPE Group for Research in Applied Economics.
    15. Mandal, Pinaki & Roy, Souvik, 2020. "Obviously Strategy-proof Implementation of Assignment Rules: A New Characterization," MPRA Paper 104044, University Library of Munich, Germany.
    16. Pinaki Mandal, 2022. "Simple dominance of fixed priority top trading cycles," Papers 2204.02154, arXiv.org, revised Feb 2023.
    17. Rodrigo A. Velez & Alexander L. Brown, 2018. "Empirical Equilibrium," Papers 1804.07986, arXiv.org, revised Jul 2020.
    18. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    19. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    20. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2023. "All sequential allotment rules are obviously strategy-proof," Theoretical Economics, Econometric Society, vol. 18(3), July.

    More about this item

    Keywords

    Obvious strategy-proofness; Mechanism design;

    JEL classification:

    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • D90 - Microeconomics - - Micro-Based Behavioral Economics - - - General

    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:ott:wpaper:2104e. 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: Aggey Semenov (email available below). General contact details of provider: https://edirc.repec.org/data/deottca.html .

    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.