IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v86y2014icp392-404.html
   My bibliography  Save this article

Destroy to save

Author

Listed:
  • de Clippel, Geoffroy
  • Naroditskiy, Victor
  • Polukarov, Maria
  • Greenwald, Amy
  • Jennings, Nicholas R.

Abstract

We study the problem of allocating m identical items among n>m agents with unit demand and private value for consuming the good. We allow payments and focus on dominant-strategy implementation. In the absence of an auctioneer who can absorb payments collected from the agents, the payments must be burnt to support dominant-strategy implementation.

Suggested Citation

  • de Clippel, Geoffroy & Naroditskiy, Victor & Polukarov, Maria & Greenwald, Amy & Jennings, Nicholas R., 2014. "Destroy to save," Games and Economic Behavior, Elsevier, vol. 86(C), pages 392-404.
    • Handle: RePEc:eee:gamebe:v:86:y:2014:i:c:p:392-404
    DOI: 10.1016/j.geb.2012.11.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825612001662
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2012.11.002?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Other versions of this item:

    • Geoffroy de Clippel & Louis Putterman & Victor Naroditskiy & Maria Polukarov & Amy Greenwald & Nicholas R. Jennings, 2012. "Destroy to Save," Working Papers 2012-9, Brown University, Department of Economics.

    References listed on IDEAS

    as
    1. Moulin, Hervé, 2009. "Almost budget-balanced VCG mechanisms to assign multiple objects," Journal of Economic Theory, Elsevier, vol. 144(1), pages 96-119, January.
    2. Nisan,Noam & Roughgarden,Tim & Tardos,Eva & Vazirani,Vijay V. (ed.), 2007. "Algorithmic Game Theory," Cambridge Books, Cambridge University Press, number 9780521872829, September.
    3. Porter, Ryan & Shoham, Yoav & Tennenholtz, Moshe, 2004. "Fair imposition," Journal of Economic Theory, Elsevier, vol. 118(2), pages 209-228, October.
    4. Bailey, Martin J, 1997. "The Demand Revealing Process: To Distribute the Surplus," Public Choice, Springer, vol. 91(2), pages 107-126, April.
    5. Guo, Mingyu & Conitzer, Vincent, 2009. "Worst-case optimal redistribution of VCG payments in multi-unit auctions," Games and Economic Behavior, Elsevier, vol. 67(1), pages 69-98, September.
    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. Sprumont, Yves, 2013. "Constrained-optimal strategy-proof assignment: Beyond the Groves mechanisms," Journal of Economic Theory, Elsevier, vol. 148(3), pages 1102-1121.
    2. Yan Long, 2020. "Optimal budget-balanced ranking mechanisms to assign identical objects," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 467-502, September.
    3. Shao, Ran & Zhou, Lin, 2016. "Optimal allocation of an indivisible good," Games and Economic Behavior, Elsevier, vol. 100(C), pages 95-112.
    4. Kazuhiko Hashimoto, 2015. "Strategy-Proof Rule in Probabilistic Allocation Problem of an Indivisible Good and Money," ISER Discussion Paper 0931, Institute of Social and Economic Research, Osaka University.
    5. Naroditskiy, Victor & Steinberg, Richard, 2015. "Maximizing social welfare in congestion games via redistribution," Games and Economic Behavior, Elsevier, vol. 93(C), pages 24-41.
    6. Drexl, Moritz & Kleiner, Andreas, 2015. "Optimal private good allocation: The case for a balanced budget," Games and Economic Behavior, Elsevier, vol. 94(C), pages 169-181.
    7. Athanasiou, Efthymios, 2013. "A Solomonic solution to the problem of assigning a private indivisible good," Games and Economic Behavior, Elsevier, vol. 82(C), pages 369-387.

    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. Sprumont, Yves, 2013. "Constrained-optimal strategy-proof assignment: Beyond the Groves mechanisms," Journal of Economic Theory, Elsevier, vol. 148(3), pages 1102-1121.
    2. You, Jung S., 2015. "Optimal VCG mechanisms to assign multiple bads," Games and Economic Behavior, Elsevier, vol. 92(C), pages 166-190.
    3. Kazuhiko Hashimoto, 2015. "Strategy-Proof Rule in Probabilistic Allocation Problem of an Indivisible Good and Money," ISER Discussion Paper 0931, Institute of Social and Economic Research, Osaka University.
    4. Naroditskiy, Victor & Steinberg, Richard, 2015. "Maximizing social welfare in congestion games via redistribution," LSE Research Online Documents on Economics 62771, London School of Economics and Political Science, LSE Library.
    5. Blumrosen, Liad & Solan, Eilon, 2023. "Selling spectrum in the presence of shared networks: The case of the Israeli 5G auction," Telecommunications Policy, Elsevier, vol. 47(2).
    6. Efthymios Athanasiou & Giacomo Valletta, 2021. "Undominated mechanisms and the provision of a pure public good in two agent economies," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(4), pages 763-795, November.
    7. Yan Long, 2020. "Optimal budget-balanced ranking mechanisms to assign identical objects," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 467-502, September.
    8. Naroditskiy, Victor & Steinberg, Richard, 2015. "Maximizing social welfare in congestion games via redistribution," Games and Economic Behavior, Elsevier, vol. 93(C), pages 24-41.
    9. Nath, Swaprava & Sandholm, Tuomas, 2019. "Efficiency and budget balance in general quasi-linear domains," Games and Economic Behavior, Elsevier, vol. 113(C), pages 673-693.
    10. Athanasiou, Efthymios, 2013. "A Solomonic solution to the problem of assigning a private indivisible good," Games and Economic Behavior, Elsevier, vol. 82(C), pages 369-387.
    11. Toyotaka Sakai, 2017. "Considering Collective Choice: The Route 328 Problem in Kodaira City," The Japanese Economic Review, Japanese Economic Association, vol. 68(3), pages 323-332, September.
    12. Balmaceda, Felipe & Balseiro, Santiago R. & Correa, José R. & Stier-Moses, Nicolás E., 2016. "Bounds on the welfare loss from moral hazard with limited liability," Games and Economic Behavior, Elsevier, vol. 95(C), pages 137-155.
    13. de Clippel, Geoffroy & Pérez-Castrillo, David & Wettstein, David, 2012. "Egalitarian equivalence under asymmetric information," Games and Economic Behavior, Elsevier, vol. 75(1), pages 413-423.
    14. Long, Yan & Mishra, Debasis & Sharma, Tridib, 2017. "Balanced ranking mechanisms," Games and Economic Behavior, Elsevier, vol. 105(C), pages 9-39.
    15. Yan Long, 2018. "Envy-free and budget-balanced assignment of identical objects," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(4), pages 705-719, April.
    16. Shao, Ran & Zhou, Lin, 2016. "Optimal allocation of an indivisible good," Games and Economic Behavior, Elsevier, vol. 100(C), pages 95-112.
    17. Thirumulanathan, D. & Vinay, H. & Bhashyam, Srikrishna & Sundaresan, Rajesh, 2017. "Almost budget balanced mechanisms with scalar bids for allocation of a divisible good," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1196-1207.
    18. Guo, Mingyu & Conitzer, Vincent, 2009. "Worst-case optimal redistribution of VCG payments in multi-unit auctions," Games and Economic Behavior, Elsevier, vol. 67(1), pages 69-98, September.
    19. Sambuddha Ghosh & Yan Long & Manipushpak Mitra, 2021. "Prior-free online mechanisms for queueing with arrivals," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(2), pages 671-700, September.
    20. Ruben Juarez & Jung S. You, 2019. "Optimality of the uniform rule under single-peaked preferences," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(1), pages 27-36, May.

    More about this item

    Keywords

    Redistribution mechanisms; Budget balance; Inefficient allocation;
    All these keywords.

    JEL classification:

    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory

    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:eee:gamebe:v:86:y:2014:i:c:p:392-404. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.