A Cooperative Network Packing Game with Simple Paths
Sergei Dotsenko,
Vladimir Mazalov
Affiliations
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
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.
