IDEAS home Printed from https://ideas.repec.org/p/cfi/fseres/cf292.html
   My bibliography  Save this paper

Optimal Multiunit Exchange Design with Single-Dimensionality

Author

Listed:
  • Hitoshi Matsushima

    (Graduate School of Economics, The University of Tokyo, Tokyo)

Abstract

We investigate allocation problems that generalize auction and bargaining, namely multiunit exchanges, where both a central planner and participants bring homogeneous commodities to sell altogether, and there exist restrictions on feasible allocations. We characterize the optimal mechanism in terms of revenue-maximization under dominant strategy incentive compatibility and ex-post individual rationality. We introduce modified virtual valuation, and show that, irrespective of the restrictions, the optimization can be replaced with the maximization of the sum of modified virtual valuations. We apply this result to an important class of allocation problems for heterogeneous items with single-item demands based on Mussa and Rosen (1978).

Suggested Citation

  • Hitoshi Matsushima, 2012. "Optimal Multiunit Exchange Design with Single-Dimensionality," CARF F-Series CARF-F-292, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo, revised Sep 2012.
    • Handle: RePEc:cfi:fseres:cf292
    as

    Download full text from publisher

    File URL: https://www.carf.e.u-tokyo.ac.jp/old/pdf/workingpaper/fseries/304.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Susan Athey & Glenn Ellison, 2011. "Position Auctions with Consumer Search," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 126(3), pages 1213-1270.
    2. Alex Gershkov & Jacob K. Goeree & Alexey Kushnir & Benny Moldovanu & Xianwen Shi, 2013. "On the Equivalence of Bayesian and Dominant Strategy Implementation," Econometrica, Econometric Society, vol. 81(1), pages 197-220, January.
    3. Fernando Branco, 1996. "Multiple unit auctions of an indivisible good," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 77-101.
    4. Benjamin Edelman & Michael Schwarz, 2010. "Optimal Auction Design and Equilibrium Selection in Sponsored Search Auctions," American Economic Review, American Economic Association, vol. 100(2), pages 597-602, May.
    5. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721, September.
    6. 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.
    7. Varian, Hal R., 2007. "Position auctions," International Journal of Industrial Organization, Elsevier, vol. 25(6), pages 1163-1178, December.
    8. Hitoshi Matsushima, 2011. "Efficient Combinatorial Exchanges with Opt-Out Types (Revised version of CARF-F-258)(Published in the B. E. Journal of Theoretical Economics 19 (1), 2019.)," CARF F-Series CARF-F-294, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo, revised Aug 2012.
    9. Myerson, Roger B. & Satterthwaite, Mark A., 1983. "Efficient mechanisms for bilateral trading," Journal of Economic Theory, Elsevier, vol. 29(2), pages 265-281, April.
    10. Benjamin Edelman & Michael Schwarz, 2010. "Optimal Auction Design and Equilibrium Selection in Sponsored Search Auctions," Harvard Business School Working Papers 10-054, Harvard Business School.
    11. Mussa, Michael & Rosen, Sherwin, 1978. "Monopoly and product quality," Journal of Economic Theory, Elsevier, vol. 18(2), pages 301-317, August.
    12. Alex Gershkov & Benny Moldovanu, 2009. "Dynamic Revenue Maximization with Heterogeneous Objects: A Mechanism Design Approach," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 168-198, August.
    13. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    14. Levent Ülkü, 2013. "Optimal combinatorial mechanism design," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 53(2), pages 473-498, June.
    15. Kalyan Chatterjee & William Samuelson, 1983. "Bargaining under Incomplete Information," Operations Research, INFORMS, vol. 31(5), pages 835-851, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Hitoshi Matsushima, 2018. "Optimal Deterministic Mechanism Design: Type-Independent Preference Orderings," The Japanese Economic Review, Springer, vol. 69(4), pages 363-373, December.
    2. Hitoshi Matsushima, 2015. "Optimal Mechanism Design: Type-Independent Preference Orderings (Published in the Japanese Economic Review 69 (4), 2018.)," CARF F-Series CARF-F-357, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    3. Hitoshi Matsushima, 2015. "Optimal Mechanism Design: Type-Independent Preference Orderings," CIRJE F-Series CIRJE-F-955, CIRJE, Faculty of Economics, University of Tokyo.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gomes, Renato & Sweeney, Kane, 2014. "Bayes–Nash equilibria of the generalized second-price auction," Games and Economic Behavior, Elsevier, vol. 86(C), pages 421-437.
    2. Hummel, Patrick, 2016. "Position auctions with dynamic resizing," International Journal of Industrial Organization, Elsevier, vol. 45(C), pages 38-46.
    3. Yi Zhu & Kenneth C. Wilbur, 2011. "Hybrid Advertising Auctions," Marketing Science, INFORMS, vol. 30(2), pages 249-273, 03-04.
    4. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    5. Estrella Alonso & Joaquín Sánchez-Soriano & Juan Tejada, 2020. "Mixed Mechanisms for Auctioning Ranked Items," Mathematics, MDPI, vol. 8(12), pages 1-26, December.
    6. Hitoshi Matsushima, 2018. "Optimal Deterministic Mechanism Design: Type-Independent Preference Orderings," The Japanese Economic Review, Springer, vol. 69(4), pages 363-373, December.
    7. Nicolás Figueroa & Vasiliki Skreta, 2011. "Optimal allocation mechanisms with single-dimensional private information," Review of Economic Design, Springer;Society for Economic Design, vol. 15(3), pages 213-243, September.
    8. Hitoshi Matsushima, 2015. "Optimal Mechanism Design: Type-Independent Preference Orderings," CIRJE F-Series CIRJE-F-955, CIRJE, Faculty of Economics, University of Tokyo.
    9. Hitoshi Matsushima, 2015. "Optimal Mechanism Design: Type-Independent Preference Orderings (Published in the Japanese Economic Review 69 (4), 2018.)," CARF F-Series CARF-F-357, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    10. Renato Gomes, 2014. "Optimal auction design in two-sided markets," RAND Journal of Economics, RAND Corporation, vol. 45(2), pages 248-272, June.
    11. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    12. Emanuele Tarantino, 2012. "A Note on Vertical Search Engines’ Foreclosure," Chapters, in: Joseph E. Harrington Jr & Yannis Katsoulacos (ed.), Recent Advances in the Analysis of Competition Policy and Regulation, chapter 8, Edward Elgar Publishing.
    13. Avi Goldfarb, 2014. "What is Different About Online Advertising?," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 44(2), pages 115-129, March.
    14. Loertscher, Simon & Marx, Leslie M., 2020. "Asymptotically optimal prior-free clock auctions," Journal of Economic Theory, Elsevier, vol. 187(C).
    15. Burguet, Roberto & Caminal, Ramon & Ellman, Matthew, 2015. "In Google we trust?," International Journal of Industrial Organization, Elsevier, vol. 39(C), pages 44-55.
    16. Hu Lu & Jacques Robert, 1997. "Optimal Trading Mechanisms with Ex Ante Unidentified Traders," CIRANO Working Papers 97s-29, CIRANO.
    17. Michael Ostrovsky & Michael Schwarz, 2023. "Reserve Prices in Internet Advertising Auctions: A Field Experiment," Journal of Political Economy, University of Chicago Press, vol. 131(12), pages 3352-3376.
    18. Hu Lu & Jacques Robert, 2000. "Optimal Trading Mechanisms with Ex Ante Unidentified Traders," Econometric Society World Congress 2000 Contributed Papers 1612, Econometric Society.
    19. Patrick Hummel, 2018. "Hybrid mechanisms for Vickrey–Clarke–Groves and generalized second-price bids," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 331-350, March.
    20. Hitoshi Matsushima, 2012. "Optimal Multiunit Exchange Design," CARF F-Series CARF-F-279, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:cfi:fseres:cf292. 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.

    If CitEc recognized a bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/catokjp.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.