IDEAS home Printed from https://ideas.repec.org/a/spr/joecth/v2y1992i4p509-24.html
   My bibliography  Save this article

Bayesian Incentive Compatible Mechanisms

Author

Listed:
  • Page, Frank H, Jr

Abstract

We study the problem of optimal mechanism design for incomplete information Stackelberg games with several followers in which each follower, guided by his own probability assessments concerning the characteristics of the other followers, behaves as a Bayesian in choosing a reporting strategy. Allowing for uncountably many types and infinite dimensional type descriptions, we present a new, general existence result for Bayesian incentive compatible (BIC) mechanisms. Because the existence problem is infinite dimensional, novel existence arguments are required. Our existence proof is based on two results: one on the sequential closure of the subset of BIC mechanisms with respect to K-convergence, and the other, a new result on sequential compactness in spaces of vector-valued functions.

Suggested Citation

  • Page, Frank H, Jr, 1992. "Bayesian Incentive Compatible Mechanisms," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(4), pages 509-524, October.
    • Handle: RePEc:spr:joecth:v:2:y:1992:i:4:p:509-24
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Beth Allen, 1996. "Implementation theory with incomplete information," Staff Report 226, Federal Reserve Bank of Minneapolis.
    2. Monteiro, Paulo Klinger, 2002. "Optimal auctions in a general model of identical goods," Journal of Mathematical Economics, Elsevier, vol. 37(1), pages 71-79, February.
    3. Bo Chen & Yu Chen & David Rietzke, 2020. "Simple contracts under observable and hidden actions," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 69(4), pages 1023-1047, June.
    4. Atin Basuchoudhary & John R. Conlon, 2000. "Are People Sometimes Too Honest? Increasing, Decreasing, and Negative Returns to Honesty," Southern Economic Journal, John Wiley & Sons, vol. 67(1), pages 139-154, July.
    5. Page Jr., Frank H., 1998. "Existence of optimal auctions in general environments," Journal of Mathematical Economics, Elsevier, vol. 29(4), pages 389-418, May.

    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:spr:joecth:v:2:y:1992:i:4:p:509-24. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.