IDEAS home Printed from https://ideas.repec.org/a/oup/jeurec/v18y2020i3p1284-1320..html

Revenue-Capped Efficient Auctions

Author

Listed:
  • Nozomu Muto
  • Yasuhiro Shirata
  • Takuro Yamashita

Abstract

We study an auction that maximizes the expected social surplus under an upper-bound constraint on the seller’s expected revenue, which we call a revenue cap. Such a constrained-efficient auction may arise, for example, when (i) the auction designer is “pro-buyer”, that is, he maximizes the weighted sum of the buyers’ and seller’s auction payoffs, where the weight for the buyers is greater than that for the seller; (ii) the auction designer maximizes the (unweighted) total surplus in a multiunit auction in which the number of units the seller owns is private information; or (iii) multiple sellers compete to attract buyers before the auction. We characterize the mechanisms for constrained-efficient auctions and identify their important properties. First, the seller sets no reserve price and sells the good for sure. Second, with a nontrivial revenue cap, “bunching” is necessary. Finally, with a sufficiently severe revenue cap, the constrained-efficient auction has a bid cap, so that bunching occurs at least “at the top,” that is, “no distortion at the top” fails.

Suggested Citation

  • Nozomu Muto & Yasuhiro Shirata & Takuro Yamashita, 2020. "Revenue-Capped Efficient Auctions," Journal of the European Economic Association, European Economic Association, vol. 18(3), pages 1284-1320.
    • Handle: RePEc:oup:jeurec:v:18:y:2020:i:3:p:1284-1320.
    as

    Download full text from publisher

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

    As the access to this document is restricted, you may want to look for a different version below or

    for a different version of it.

    Other versions of this item:

    Citations

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


    Cited by:

    1. Zhonghao Shui, 2023. "Rejection prices and an auctioneer with non-monotonic utility," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 925-951, September.
    2. Sebastián D. Bauer, 2023. "Buyers’ welfare maximizing auction design," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(2), pages 555-567, June.
    3. Muto, Nozomu & Shirata, Yasuhiro, 2017. "Manipulation via endowments in auctions with multiple goods," Mathematical Social Sciences, Elsevier, vol. 87(C), pages 75-84.

    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:jeurec:v:18:y:2020:i:3:p:1284-1320.. 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/jeea .

    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.