IDEAS home Printed from https://ideas.repec.org/p/urv/wpaper/2072-151621.html
   My bibliography  Save this paper

Signaling in Dynamic Contests: Some Impossibility Results

Author

Listed:
  • Osório Costa, Antonio Miguel

Abstract

General signaling results in dynamic Tullock contests have been missing for long. The reason is the tractability of the problems. In this paper, an uninformed contestant with valuation vx competes against an informed opponent with valuation, either high vh or low vl. We show that; (i) When the hierarchy of valuations is vh ≥ vx ≥ vl, there is no pooling. Sandbagging is too costly for the high type. (ii) When the order of valuations is vx ≥ vh ≥ vl, there is no separation if vh and vl are close. Sandbagging is cheap due to the proximity of valuations. However, if vh and vx are close, there is no pooling. First period cost of pooling is high. (iii) For valuations satisfying vh ≥ vl ≥ vx, there is no separation if vh and vl are close. Bluffing in the first period is cheap for the low valuation type. Conversely, if vx and vl are close there is no pooling. Bluffing in the first stage is too costly. JEL: C72, C73, D44, D82. KEYWORDS: Signaling, Dynamic Contests, Non-existence, Sandbag Pooling, Bluff Pooling, Separating

Suggested Citation

  • Osório Costa, Antonio Miguel, 2010. "Signaling in Dynamic Contests: Some Impossibility Results," Working Papers 2072/151621, Universitat Rovira i Virgili, Department of Economics.
  • Handle: RePEc:urv:wpaper:2072/151621
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/2072/151621
    Download Restriction: no

    References listed on IDEAS

    as
    1. Konrad, Kai A., 2009. "Strategy and Dynamics in Contests," OUP Catalogue, Oxford University Press, number 9780199549603.
    2. Jun Zhang & Ruqu Wang, 2009. "The Role of Information Revelation in Elimination Contests," Economic Journal, Royal Economic Society, vol. 119(536), pages 613-641, March.
    3. Goeree, Jacob K., 2003. "Bidding for the future: signaling in auctions with an aftermarket," Journal of Economic Theory, Elsevier, vol. 108(2), pages 345-364, February.
    4. Johannes Hörner & Nicolas Sahuguet, 2007. "Costly Signalling in Auctions -super-1," Review of Economic Studies, Oxford University Press, vol. 74(1), pages 173-206.
    5. Gradstein, Mark & Konrad, Kai A, 1999. "Orchestrating Rent Seeking Contests," Economic Journal, Royal Economic Society, vol. 109(458), pages 536-545, October.
    6. Moldovanu, Benny & Sela, Aner, 2006. "Contest architecture," Journal of Economic Theory, Elsevier, vol. 126(1), pages 70-96, January.
    7. Rosen, Sherwin, 1986. "Prizes and Incentives in Elimination Tournaments," American Economic Review, American Economic Association, vol. 76(4), pages 701-715, September.
    8. Arye L. Hillman & John G. Riley, 1989. "Politically Contestable Rents And Transfers," Economics and Politics, Wiley Blackwell, vol. 1(1), pages 17-39, March.
    9. Jun Zhang, 2008. "Simultaneous Signaling in Elimination Contests," Working Papers 1184, Queen's University, Department of Economics.
    10. Hurley, Terrance M. & Shogren, Jason F., 1998. "Effort levels in a Cournot Nash contest with asymmetric information," Journal of Public Economics, Elsevier, vol. 69(2), pages 195-210, June.
    11. Stefan Szymanski, 2003. "The Economic Design of Sporting Contests," Journal of Economic Literature, American Economic Association, vol. 41(4), pages 1137-1187, December.
    12. Krishna, Vijay & Morgan, John, 1997. "An Analysis of the War of Attrition and the All-Pay Auction," Journal of Economic Theory, Elsevier, vol. 72(2), pages 343-362, February.
    13. Nitzan, Shmuel, 1994. "Modelling rent-seeking contests," European Journal of Political Economy, Elsevier, vol. 10(1), pages 41-60, May.
    14. Hurley, Terrance M. & Shogren, Jason F., 1998. "Asymmetric information contests," European Journal of Political Economy, Elsevier, vol. 14(4), pages 645-665, November.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    33 - Economia;

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    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:urv:wpaper:2072/151621. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ariadna Casals). General contact details of provider: http://edirc.repec.org/data/deurves.html .

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

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.