IDEAS home Printed from https://ideas.repec.org/p/kyo/wpaper/592.html
   My bibliography  Save this paper

Optimal Auction Design with Discrete Bidding

Author

Listed:
  • Harrison Cheng

    (University of Southern California, visiting Institute of Economic Research, Kyoto University)

Abstract

We develop the theory of optimal auction design in a discrete bidding model. Examples show that many of the equivalence results or other well-known results may fail in an auction with discrete bidding. We show that the optimal auciton problem, however, has a similar solution. We formulate a payoff formula which is a discrete version of the one for the continuous bidding model. We show that an optimal auction must satisfy the payoff formula, and the payoff formula is used to reduce the problem into the design of winning rules. We then use a simple algorithm and the duality theory of linear programming to build a general solution of the problem.

Suggested Citation

  • Harrison Cheng, 2004. "Optimal Auction Design with Discrete Bidding," KIER Working Papers 592, Kyoto University, Institute of Economic Research.
    • Handle: RePEc:kyo:wpaper:592
    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. Ricardo Gonçalves, 2008. "A communication equilibrium in English auctions with discrete bidding," Working Papers de Economia (Economics Working Papers) 042008, Católica Porto Business School, Universidade Católica Portuguesa.
    2. Gonçalves, Ricardo & Ray, Indrajit, 2017. "Partition Equilibria in a Japanese-English Auction with Discrete Bid Levels for the Wallet Game," CRETA Online Discussion Paper Series 34, Centre for Research in Economic Theory and its Applications CRETA.
    3. Gonçalves, Ricardo & Ray, Indrajit, 2017. "A note on the wallet game with discrete bid levels," Economics Letters, Elsevier, vol. 159(C), pages 177-179.
    4. William S. Lovejoy, 2006. "Optimal Mechanisms with Finite Agent Types," Management Science, INFORMS, vol. 52(5), pages 788-803, May.
    5. Gon alves, Ricardo & Ray, Indrajit, 2016. "Equilibria in a Japanese-English Auction with Discrete Bid Levels for the Wallet Game," Cardiff Economics Working Papers E2016/13, Cardiff University, Cardiff Business School, Economics Section.

    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:kyo:wpaper:592. 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: Makoto Watanabe (email available below). General contact details of provider: https://edirc.repec.org/data/iekyojp.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.