A Cooperative Network Packing Game with Simple Paths

Sergei Dotsenko and Vladimir Mazalov
Additional contact information
Sergei Dotsenko: Faculty of Information Technology, Taras Shevchenko National University of Kyiv, Gavrilishina Str. 24, 04116 Kyiv, Ukraine
Vladimir Mazalov: Institute of Applied Mathematical Research, Karelian Research Center of the Russian Academy of Sciences, Pushkinskaya Str. 11, 185910 Petrozavodsk, Russia

Mathematics, 2021, vol. 9, issue 14, 1-18

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.

Keywords: network packing game; simple paths; core; linear programming (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/14/1683/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/14/1683/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:14:p:1683-:d:596198

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().