A Cooperative Network Packing Game with Simple Paths
| Autor: | Vladimir Mazalov, Sergei Dotsenko |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Characteristic function (convex analysis)
Computer Science::Computer Science and Game Theory Linear programming simple paths Computer science General Mathematics 010102 general mathematics core linear programming Topology 01 natural sciences 010104 statistics & probability Core (game theory) Simple (abstract algebra) QA1-939 Computer Science (miscellaneous) 0101 mathematics Fixed length network packing game Engineering (miscellaneous) Mathematics |
| Zdroj: | Mathematics Volume 9 Issue 14 Mathematics, Vol 9, Iss 1683, p 1683 (2021) |
| ISSN: | 2227-7390 |
| DOI: | 10.3390/math9141683 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|