IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2502.08248.html
   My bibliography  Save this paper

Mechanism Design in Max-Flows

Author

Listed:
  • Shengyuan Huang
  • Wenjun Mei
  • Xiaoguang Yang
  • Zhigang Cao

Abstract

This paper studies allocation mechanisms in max-flow games with players' capacities as private information. We first show that no core-selection mechanism is truthful: there may exist a player whose payoff increases if she under-reports her capacity when a core-section mechanism is adopted. We then introduce five desirable properties for mechanisms in max-flow games: DSIC (truthful reporting is a dominant strategy), SIR (individual rationality and positive payoff for each player contributing positively to at least one coalition), SP (no edge has an incentive to split into parallel edges), MP (no parallel edges have incentives to merge), and CM (a player's payoff does not decrease as another player's capacity and max-flow increase). While the Shapley value mechanism satisfies DSIC and SIR, it fails to meet SP, MP and CM. We propose a new mechanism based on minimal cuts that satisfies all five properties.

Suggested Citation

  • Shengyuan Huang & Wenjun Mei & Xiaoguang Yang & Zhigang Cao, 2025. "Mechanism Design in Max-Flows," Papers 2502.08248, arXiv.org.
    • Handle: RePEc:arx:papers:2502.08248
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2502.08248
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Vijay V. Vazirani, 2023. "LP-Duality Theory and the Cores of Games," Papers 2302.07627, arXiv.org, revised Mar 2023.
    2. Xiaotie Deng & Qizhi Fang & Xiaoxun Sun, 2009. "Finding nucleolus of flow game," Journal of Combinatorial Optimization, Springer, vol. 18(1), pages 64-86, July.
    3. Derks, J.J.M. & Tijs, S.H., 1985. "Stable outcomes for multi-commodity flow games," Other publications TiSEM f643e6a4-cf4e-4892-8f00-c, Tilburg University, School of Economics and Management.
    4. Ehud Kalai & Eitan Zemel, 1982. "Generalized Network Problems Yielding Totally Balanced Games," Operations Research, INFORMS, vol. 30(5), pages 998-1008, October.
    5. Xiaotie Deng & Qizhi Fang, 2008. "Algorithmic Cooperative Game Theory," Springer Optimization and Its Applications, in: Altannar Chinchuluun & Panos M. Pardalos & Athanasios Migdalas & Leonidas Pitsoulis (ed.), Pareto Optimality, Game Theory And Equilibria, pages 159-185, Springer.
    6. Itai Ashlagi & Mark Braverman & Avinatan Hassidim & Dov Monderer, 2010. "Monotonicity and Implementability," Econometrica, Econometric Society, vol. 78(5), pages 1749-1772, September.
    7. Potters, Jos & Reijnierse, Hans & Biswas, Amit, 2006. "The nucleolus of balanced simple flow networks," Games and Economic Behavior, Elsevier, vol. 54(1), pages 205-225, January.
    8. Milchtaich, Igal, 2006. "Network topology and the efficiency of equilibrium," Games and Economic Behavior, Elsevier, vol. 57(2), pages 321-346, November.
    9. Lloyd S. Shapley, 1961. "On network flow functions," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 8(2), pages 151-158, June.
    10. Lloyd S. Shapley, 1962. "Complements and substitutes in the opttmal assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 9(1), pages 45-48, March.
    11. Walter Kern & Daniël Paulusma, 2009. "On the Core and f -Nucleolus of Flow Games," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 981-991, November.
    12. Ozan Candogan & Markos Epitropou & Rakesh V. Vohra, 2021. "Competitive Equilibrium and Trading Networks: A Network Flow Approach," Operations Research, INFORMS, vol. 69(1), pages 114-147, January.
    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. Qizhi Fang & Bo Li & Xiaohan Shan & Xiaoming Sun, 2018. "Path cooperative games," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 211-229, July.
    2. Vijay V. Vazirani, 2023. "LP-Duality Theory and the Cores of Games," Papers 2302.07627, arXiv.org, revised Mar 2023.
    3. Márton Benedek & Jörg Fliege & Tri-Dung Nguyen, 2020. "Finding and verifying the nucleolus of cooperative games," CERS-IE WORKING PAPERS 2021, Institute of Economics, Centre for Economic and Regional Studies.
    4. Rasulkhani, Saeid & Chow, Joseph Y.J., 2019. "Route-cost-assignment with joint user and operator behavior as a many-to-one stable matching assignment game," Transportation Research Part B: Methodological, Elsevier, vol. 124(C), pages 60-81.
    5. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    6. Sunghoon Hong & Myrna Wooders, 2010. "Strategic Network Interdiction," Vanderbilt University Department of Economics Working Papers 1010, Vanderbilt University Department of Economics.
    7. Serap Ergün & Pınar Usta & Sırma Zeynep Alparslan Gök & Gerhard Wilhelm Weber, 2023. "A game theoretical approach to emergency logistics planning in natural disasters," Annals of Operations Research, Springer, vol. 324(1), pages 855-868, May.
    8. Walter Kern & Daniël Paulusma, 2009. "On the Core and f -Nucleolus of Flow Games," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 981-991, November.
    9. Nguyen, Tri-Dung & Thomas, Lyn, 2016. "Finding the nucleoli of large cooperative games," European Journal of Operational Research, Elsevier, vol. 248(3), pages 1078-1092.
    10. André Berger & Rudolf Müller & Seyed Hossein Naeemi, 2017. "Characterizing implementable allocation rules in multi-dimensional environments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(2), pages 367-383, February.
    11. Csóka Péter & Pintér Miklós, 2016. "On the Impossibility of Fair Risk Allocation," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 16(1), pages 143-158, January.
    12. Ehud Lehrer, 2009. "A new integral for capacities," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 39(1), pages 157-176, April.
    13. Nishizaki, Ichiro & Sakawa, Masatoshi, 2001. "On computational methods for solutions of multiobjective linear production programming games," European Journal of Operational Research, Elsevier, vol. 129(2), pages 386-413, March.
    14. Tianhang Lu & Han Xian & Qizhi Fang, 2023. "Approximate Core Allocations for Edge Cover Games," Papers 2308.11222, arXiv.org.
    15. Ichiro Nishizaki & Tomohiro Hayashida & Yuki Shintomi, 2016. "A core-allocation for a network restricted linear production game," Annals of Operations Research, Springer, vol. 238(1), pages 389-410, March.
    16. Ichiro Nishizaki & Tomohiro Hayashida & Shinya Sekizaki & Kojiro Furumi, 2023. "A two-stage linear production planning model with partial cooperation under stochastic demands," Annals of Operations Research, Springer, vol. 320(1), pages 293-324, January.
    17. Leanne Streekstra & Christian Trudeau, 2024. "Stable source connection and assignment problems as multi-period shortest path problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(3), pages 939-975, September.
    18. Ata Atay & Eric Bahel & Tamás Solymosi, 2023. "Matching markets with middlemen under transferable utility," Annals of Operations Research, Springer, vol. 322(2), pages 539-563, March.
    19. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Mechanism design without quasilinearity," Theoretical Economics, Econometric Society, vol. 15(2), May.
    20. Saurabh Amin & Patrick Jaillet & Haripriya Pulyassary & Manxi Wu, 2023. "Market Design for Capacity Sharing in Networks," Papers 2307.03994, arXiv.org, revised Nov 2024.

    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:arx:papers:2502.08248. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.