IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i14p1683-d596198.html
   My bibliography  Save this article

A Cooperative Network Packing Game with Simple Paths

Author

Listed:
  • Sergei Dotsenko

    (Faculty of Information Technology, Taras Shevchenko National University of Kyiv, Gavrilishina Str. 24, 04116 Kyiv, Ukraine
    These authors contributed equally to this work.)

  • Vladimir Mazalov

    (Institute of Applied Mathematical Research, Karelian Research Center of the Russian Academy of Sciences, Pushkinskaya Str. 11, 185910 Petrozavodsk, Russia
    Faculty of Applied Mathematics-Control Processes, Saint-Petersburg State University, 7/9 Universitetskaya nab., 199034 Saint Petersburg, Russia
    These authors contributed equally to this work.)

Abstract

We consider a cooperative packing game in which the characteristic function is defined as the maximum number of independent simple paths of a fixed length included in a given coalition. The conditions under which the core exists in this game are established, and its form is obtained. For several particular graphs, the explicit form of the core is presented.

Suggested Citation

  • Sergei Dotsenko & Vladimir Mazalov, 2021. "A Cooperative Network Packing Game with Simple Paths," Mathematics, MDPI, vol. 9(14), pages 1-18, July.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:14:p:1683-:d:596198
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/14/1683/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/14/1683/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jackson, Matthew O. & Wolinsky, Asher, 1996. "A Strategic Model of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 71(1), pages 44-74, October.
    2. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    3. Thomas Bietenhader & Yoshio Okamoto, 2006. "Core Stability of Minimum Coloring Games," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 418-431, May.
    4. Xiaotie Deng & Toshihide Ibaraki & Hiroshi Nagamochi, 1999. "Algorithmic Aspects of the Core of Combinatorial Optimization Games," Mathematics of Operations Research, INFORMS, vol. 24(3), pages 751-766, August.
    5. Xiaotie Deng & Qizhi Fang & Xiaoxun Sun, 2009. "Finding nucleolus of flow game," Journal of Combinatorial Optimization, Springer, vol. 18(1), pages 64-86, July.
    6. Gusev, Vasily V., 2020. "The vertex cover game: Application to transport networks," Omega, Elsevier, vol. 97(C).
    7. Gérard Hamiache, 2001. "The Owen value values friendship," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(4), pages 517-532.
    8. Yoshio Okamoto, 2003. "Submodularity of some classes of the combinatorial optimization games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 58(1), pages 131-139, September.
    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. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Other publications TiSEM efae8d09-83e6-4fe4-9623-e, Tilburg University, School of Economics and Management.
    2. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Discussion Paper 2011-016, Tilburg University, Center for Economic Research.
    3. M. Musegaas & P. E. M. Borm & M. Quant, 2016. "Simple and three-valued simple minimum coloring games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(2), pages 239-258, October.
    4. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    5. Rodrigo J. Harrison & Roberto Munoz, 2003. "Stability and Equilibrium Selection in a Link Formation Game," Game Theory and Information 0306004, University Library of Munich, Germany.
    6. Sergio Currarini & Carmen Marchiori & Alessandro Tavoni, 2016. "Network Economics and the Environment: Insights and Perspectives," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 65(1), pages 159-189, September.
    7. Caulier, Jean-François & Mauleon, Ana & Vannetelbosch, Vincent, 2015. "Allocation rules for coalitional network games," Mathematical Social Sciences, Elsevier, vol. 78(C), pages 80-88.
    8. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Discounted Tree Solutions," Working Papers hal-01377923, HAL.
    9. Joost Vandenbossche & Thomas Demuynck, 2013. "Network Formation with Heterogeneous Agents and Absolute Friction," Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.
    10. Slikker, M. & Gilles, R.P. & Norde, H.W. & Tijs, S.H., 2000. "Directed Communication Networks," Discussion Paper 2000-84, Tilburg University, Center for Economic Research.
    11. Arcaute, E. & Dyagilev, K. & Johari, R. & Mannor, S., 2013. "Dynamics in tree formation games," Games and Economic Behavior, Elsevier, vol. 79(C), pages 1-29.
    12. Tesfatsion, Leigh, 1998. "Ex Ante Capacity Effects in Evolutionary Labor Markets with Adaptive Search," ISU General Staff Papers 199810010700001046, Iowa State University, Department of Economics.
    13. Jean-François Caulier & Ana Mauleon & Vincent Vannetelbosch, 2013. "Contractually stable networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 483-499, May.
    14. Sofia Priazhkina & Samuel Palmer & Pablo Martín-Ramiro & Román Orús & Samuel Mugel & Vladimir Skavysh, 2024. "Digital Payments in Firm Networks: Theory of Adoption and Quantum Algorithm," Staff Working Papers 24-17, Bank of Canada.
    15. Roland Pongou & Roberto Serrano, 2009. "A dynamic theory of fidelity networks with an application to the spread of HIV/AIDS," Working Papers 2009-03, Instituto Madrileño de Estudios Avanzados (IMDEA) Ciencias Sociales.
    16. Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
    17. González–Arangüena, E. & Manuel, C. & Owen, G. & del Pozo, M., 2017. "The within groups and the between groups Myerson values," European Journal of Operational Research, Elsevier, vol. 257(2), pages 586-600.
    18. Navarro, Noemi, 2007. "Fair allocation in networks with externalities," Games and Economic Behavior, Elsevier, vol. 58(2), pages 354-364, February.
    19. Sanjeev Goyal & Adrien Vigier, 2014. "Attack, Defence, and Contagion in Networks," Review of Economic Studies, Oxford University Press, vol. 81(4), pages 1518-1542.
    20. Britta Hoyer & Kris De Jaegher, 2023. "Network disruption and the common-enemy effect," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 117-155, March.

    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:gam:jmathe:v:9:y:2021:i:14:p:1683-:d:596198. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.