IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v86y2017icp1-8.html
   My bibliography  Save this article

Spanning tree auctions: A complete characterization

Author

Listed:
  • Quadir, Abdul

Abstract

We consider a mechanism design problem over a connected graph in private value environment where the type of an agent is a single number. The preference over transfers is quasi-linear for every agent. We give a complete characterization of dominant strategy incentive compatible mechanisms for this problem. Further, by imposing a suitable version of anonymity and non-bossiness along with dominant strategy incentive compatibility, we find that the only mechanisms satisfying all these conditions are the Groves mechanisms.

Suggested Citation

  • Quadir, Abdul, 2017. "Spanning tree auctions: A complete characterization," Mathematical Social Sciences, Elsevier, vol. 86(C), pages 1-8.
    • Handle: RePEc:eee:matsoc:v:86:y:2017:i:c:p:1-8
    DOI: 10.1016/j.mathsocsci.2016.12.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489616301950
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2016.12.001?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Mishra, Debasis & Sen, Arunava, 2012. "Robertsʼ Theorem with neutrality: A social welfare ordering approach," Games and Economic Behavior, Elsevier, vol. 75(1), pages 283-298.
    2. Carbajal, Juan Carlos & McLennan, Andrew & Tourky, Rabee, 2013. "Truthful implementation and preference aggregation in restricted domains," Journal of Economic Theory, Elsevier, vol. 148(3), pages 1074-1101.
    3. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    4. Mark A. Satterthwaite & Hugo Sonnenschein, 1981. "Strategy-Proof Allocation Mechanisms at Differentiable Points," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 48(4), pages 587-597.
    5. Birgit Heydenreich & Rudolf Müller & Marc Uetz & Rakesh V. Vohra, 2009. "Characterization of Revenue Equivalence," Econometrica, Econometric Society, vol. 77(1), pages 307-316, January.
    6. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    7. Partha Dasgupta & Eric Maskin, 2000. "Efficient Auctions," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 115(2), pages 341-388.
    8. Cremer, Jacques & McLean, Richard P, 1985. "Optimal Selling Strategies under Uncertainty for a Discriminating Monopolist When Demands Are Interdependent," Econometrica, Econometric Society, vol. 53(2), pages 345-361, March.
    9. Conan Mukherjee, 2014. "Fair and group strategy-proof good allocation with money," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(2), pages 289-311, February.
    10. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    11. Holmstrom, Bengt, 1979. "Groves' Scheme on Restricted Domains," Econometrica, Econometric Society, vol. 47(5), pages 1137-1144, September.
    12. Motty Perry & Philip J. Reny, 2002. "An Efficient Auction," Econometrica, Econometric Society, vol. 70(3), pages 1199-1212, May.
    13. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    Full references (including those not matched with items on IDEAS)

    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. Debasis Mishra & Abdul Quadir, 2012. "Deterministic single object auctions with private values," Discussion Papers 12-06, Indian Statistical Institute, Delhi.
    2. Jehiel, Philippe & Moldovanu, Benny, 2005. "Allocative and Informational Externalities in Auctions and Related Mechanisms," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 142, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
    3. Eric Maskin, 2004. "The Unity of Auction Theory: Paul Milgrom's Masterclass," Economics Working Papers 0044, Institute for Advanced Study, School of Social Science.
    4. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
    5. M. Yenmez, 2015. "Incentive compatible market design with applications," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 543-569, August.
    6. , & ,, 2015. "Implementation with interdependent valuations," Theoretical Economics, Econometric Society, vol. 10(3), September.
    7. Lorentziadis, Panos L., 2016. "Optimal bidding in auctions from a game theory perspective," European Journal of Operational Research, Elsevier, vol. 248(2), pages 347-371.
    8. Carbajal, Juan Carlos & Ely, Jeffrey C., 2013. "Mechanism design without revenue equivalence," Journal of Economic Theory, Elsevier, vol. 148(1), pages 104-133.
    9. Carbajal, Juan Carlos, 2010. "On the uniqueness of Groves mechanisms and the payoff equivalence principle," Games and Economic Behavior, Elsevier, vol. 68(2), pages 763-772, March.
    10. Thierry Marchant & Debasis Mishra, 2015. "Mechanism design with two alternatives in quasi-linear environments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(2), pages 433-455, February.
    11. 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.
    12. Song, Yangwei, 2018. "Efficient Implementation with Interdependent Valuations and Maxmin Agents," Rationality and Competition Discussion Paper Series 92, CRC TRR 190 Rationality and Competition.
    13. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Mechanism design without quasilinearity," Theoretical Economics, Econometric Society, vol. 15(2), May.
    14. Bierbrauer, Felix & Netzer, Nick, 2016. "Mechanism design and intentions," Journal of Economic Theory, Elsevier, vol. 163(C), pages 557-603.
    15. Claude d'Aspremont & Jacques Crémer & Louis-André Gérard-Varet, 2003. "Correlation, independence, and Bayesian incentives," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 281-310, October.
    16. Hyoung-Goo Kang & Richard M. Burton & Will Mitchell, 2021. "How firm boundaries and relatedness jointly affect diversification value: trade-offs between governance and flexibility," Computational and Mathematical Organization Theory, Springer, vol. 27(1), pages 1-34, March.
    17. Philippe Jehiel & Moritz Meyer-ter-Vehn & Benny Moldovanu & William R. Zame, 2006. "The Limits of ex post Implementation," Econometrica, Econometric Society, vol. 74(3), pages 585-610, May.
    18. Aristotelis Boukouras & Kostas Koufopoulos, 2017. "Efficient allocations in economies with asymmetric information when the realized frequency of types is common knowledge," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 64(1), pages 75-98, June.
    19. , & , & ,, 2007. "Secure implementation," Theoretical Economics, Econometric Society, vol. 2(3), September.
    20. Georgiou, Konstantinos & Swamy, Chaitanya, 2019. "Black-box reductions for cost-sharing mechanism design," Games and Economic Behavior, Elsevier, vol. 113(C), pages 17-37.

    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:eee:matsoc:v:86:y:2017:i:c:p:1-8. 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/505565 .

    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.