IDEAS home Printed from https://ideas.repec.org/p/lsu/lsuwpp/2011-03.html

Implementing Efficient Graphs in Connection Networks

Author

Listed:
  • Rajnish Kumar
  • Ruben Juarez

Abstract

We consider the problem of sharing the cost of a network that meets the connection demands of a set of agents. The agents simultaneously choose paths in the network connecting their demand nodes. A mechanism splits the total cost of the network formed among the participants. We introduce two new properties of implementation. The first prop- erty, Pareto Nash Implementation (PNI), requires that the efficient out- come is always implemented in a Nash equilibrium, and that the efficient outcome Pareto dominates any other Nash equilibrium. The average cost mechanism (AC) and other assymetric variations, are the only rules that meet PNI. These mechanisms are also characterized under Strong Nash Implementation. The second property, Weakly Pareto Nash Implementation (WPNI), requires that the least inefficient equilibrium Pareto dominate any other equilibrium. The egalitarian mechanism (EG), a variation of AC that meets individual rationality, and other assymetric mechanisms are the only rules that meet WPNI and Individual Rationality. PNI and WPNI provide the first economic justification of the Price of Stability (PoS), a seemingly natural measure in the computer science literature but not easily embraced in economics. EG minimizes the PoS across all individually rational mechanisms.ntable SCFs in our environment if we add a few desirable axioms.

Suggested Citation

  • Rajnish Kumar & Ruben Juarez, 2011. "Implementing Efficient Graphs in Connection Networks," Departmental Working Papers 2011-03, Department of Economics, Louisiana State University.
    • Handle: RePEc:lsu:lsuwpp:2011-03
    as

    Download full text from publisher

    File URL: https://www.lsu.edu/business/economics/files/workingpapers/pap11_03.pdf
    Download Restriction: no
    ---><---

    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. Ruben Juarez & Michael Wu, 2019. "Routing-Proofness in Congestion-Prone Networks," Games, MDPI, vol. 10(2), pages 1-18, April.
    2. Jens Leth Hougaard & Mich Tvede, 2020. "Implementation of Optimal Connection Networks," IFRO Working Paper 2020/06, University of Copenhagen, Department of Food and Resource Economics.
    3. Jung S. You & Ruben Juarez, 2021. "Incentive-compatible simple mechanisms," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 71(4), pages 1569-1589, June.
    4. Bhardwaj, Bhavook & Kumar, Rajnish & Ortega, Josué, 2020. "Fairness and efficiency in cake-cutting with single-peaked preferences," Economics Letters, Elsevier, vol. 190(C).
    5. Hougaard, Jens Leth & Tvede, Mich, 2015. "Minimum cost connection networks: Truth-telling and implementation," Journal of Economic Theory, Elsevier, vol. 157(C), pages 76-99.
    6. Jens Leth Hougaard & Mich Tvede, 2020. "Trouble Comes in Threes: Core stability in Minimum Cost Connection Networks," IFRO Working Paper 2020/07, University of Copenhagen, Department of Food and Resource Economics.
    7. Sinan Ertemel & Rajnish Kumar, 2018. "Proportional rules for state contingent claims," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 229-246, March.
    8. Emre Doğan & İbrahim Barış Esmerok, 2024. "An egalitarian solution to minimum cost spanning tree problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(1), pages 127-141, March.
    9. Andreas Darmann & Christian Klamler & Ulrich Pferschy, 2015. "Sharing the Cost of a Path," Studies in Microeconomics, , vol. 3(1), pages 1-12, June.
    10. Hougaard, Jens Leth & Tvede, Mich, 2012. "Truth-telling and Nash equilibria in minimum cost spanning tree models," European Journal of Operational Research, Elsevier, vol. 222(3), pages 566-570.
    11. Ruben Juarez & Kohei Nitta, 2017. "Profit-Sharing and Implementation of Efficient Outcomes," Working Papers 201702, University of Hawaii at Manoa, Department of Economics.
    12. Han, Lining & Juarez, Ruben, 2018. "Free intermediation in resource transmission," Games and Economic Behavior, Elsevier, vol. 111(C), pages 75-84.
    13. Hougaard, Jens Leth & Tvede, Mich, 2022. "Trouble comes in threes: Core stability in minimum cost connection networks," European Journal of Operational Research, Elsevier, vol. 297(1), pages 319-324.
    14. Julio R. Fernández & Inés Gallego & Andrés Jiménez-Losada & Manuel Ordóñez, 2022. "Cost-allocation problems for fuzzy agents in a fixed-tree network," Fuzzy Optimization and Decision Making, Springer, vol. 21(4), pages 531-551, December.
    15. 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.
    16. Juarez, Ruben & Ko, Chiu Yu & Xue, Jingyi, 2018. "Sharing sequential values in a network," Journal of Economic Theory, Elsevier, vol. 177(C), pages 734-779.
    17. Ruben Juarez & Kohei Nitta & Miguel Vargas, 2020. "Profit-sharing and efficient time allocation," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(3), pages 817-846, October.
    18. Juarez, Ruben & Nitta, Kohei & Vargas, Miguel, 2021. "Coalitional efficient profit-sharing," Economics Letters, Elsevier, vol. 204(C).
    19. Kristal K. Trejo & Ruben Juarez & Julio B. Clempner & Alexander S. Poznyak, 2023. "Non-Cooperative Bargaining with Unsophisticated Agents," Computational Economics, Springer;Society for Computational Economics, vol. 61(3), pages 937-974, March.
    20. Jens Leth Hougaard & Mich Tvede, 2010. "Strategyproof Nash Equilibria in Minimum Cost Spanning Tree Models," MSAP Working Paper Series 01_2010, University of Copenhagen, Department of Food and Resource Economics.
    21. María Gómez-Rúa & Juan Vidal-Puga, 2017. "A monotonic and merge-proof rule in minimum cost spanning tree situations," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(3), pages 813-826, March.

    More about this item

    JEL classification:

    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation

    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:lsu:lsuwpp:2011-03. 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: the person in charge The email address of this maintainer does not seem to be valid anymore. Please ask the person in charge to update the entry or send us the correct address (email available below). General contact details of provider: https://edirc.repec.org/data/delsuus.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.