IDEAS home Printed from https://ideas.repec.org/a/oup/restud/v52y1985i3p525-528..html
   My bibliography  Save this article

A Class of Dominance Solvable Common-Value Auctions

Author

Listed:
  • Ronald M. Harstad
  • Dan Levin

Abstract

Dominant strategies seldom exist in non-cooperative games. Moulin's concept of a dominance solvable game generalizes, dominant strategy without dramatic loss in appeal. We consider a class of common-value auctions characterized by the property that the maximum of a collection of informative signals is a sufficient statistic for the entire collection. We demonstrate that this class of second-price auctions is dominance solvable.

Suggested Citation

  • Ronald M. Harstad & Dan Levin, 1985. "A Class of Dominance Solvable Common-Value Auctions," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 52(3), pages 525-528.
    • Handle: RePEc:oup:restud:v:52:y:1985:i:3:p:525-528.
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.2307/2297669
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

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


    Cited by:

    1. Azrieli, Yaron & Levin, Dan, 2011. "Dominance-solvable common-value large auctions," Games and Economic Behavior, Elsevier, vol. 73(2), pages 301-309.
    2. Cuihong Fan & Byoung Jun & Elmar Wolfstetter, 2014. "Licensing a common value innovation when signaling strength may backfire," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(1), pages 215-244, February.
    3. Kim-Sau Chung & Jeffrey C. Ely, 2019. "Efficient and Dominance Solvable Auctions with Interdependent Valuations," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 4(1), pages 1-38, November.
    4. Forges, Françoise & Orzach, Ram, 2011. "Core-stable rings in second price auctions with common values," Journal of Mathematical Economics, Elsevier, vol. 47(6), pages 760-767.
    5. Einy, Ezra & Haimanko, Ori & Orzach, Ram & Sela, Aner, 2002. "Dominance solvability of second-price auctions with differential information," Journal of Mathematical Economics, Elsevier, vol. 37(3), pages 247-258, May.
    6. John H. Kagel & Colin M. Campbell & Dan Levin, 1999. "The Winner's Curse and Public Information in Common Value Auctions: Reply," American Economic Review, American Economic Association, vol. 89(1), pages 325-334, March.
    7. Burkhard Schipper & Martin Meier & Aviad Heifetz, 2017. "Comprehensive Rationalizability," Working Papers 174, University of California, Davis, Department of Economics.
    8. Liu, Heng, 2014. "Equilibrium selection in common-value second-price auctions," Games and Economic Behavior, Elsevier, vol. 84(C), pages 1-6.
    9. Vleugels, Jan, 1997. "Bidding against an unknown number of competitiors sharing affiliated information," Sonderforschungsbereich 504 Publications 97-13, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
    10. Heifetz, Aviad & Meier, Martin & Schipper, Burkhard C., 2019. "Comprehensive rationalizability," Games and Economic Behavior, Elsevier, vol. 116(C), pages 185-202.
    11. Abraham, Ittai & Athey, Susan & Babaioff, Moshe & Grubb, Michael D., 2020. "Peaches, lemons, and cookies: Designing auction markets with dispersed information," Games and Economic Behavior, Elsevier, vol. 124(C), pages 454-477.
    12. Mares, Vlad & Harstad, Ronald M., 2003. "Private information revelation in common-value auctions," Journal of Economic Theory, Elsevier, vol. 109(2), pages 264-282, April.

    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:oup:restud:v:52:y:1985:i:3:p:525-528.. 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: Oxford University Press (email available below). General contact details of provider: https://academic.oup.com/restud .

    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.