title: Game Theoretic Approach to Multi-Agent Transportation Problems on Network
metadata.name: dc.contributor.author
metadata.value: Alkhaled, Khaled
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Petrosyan, Leon
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2023-05-05T11:37:02Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2023-05-05T11:37:02Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2022
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Khaled, A., & Petrosyan, L. (2022). Game Theoretic Approach to Multi-Agent Transportation Problems on Network. Contributions to Game Theory and Management, 15, 8-17.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11701/spbu31.2022.01
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/41418
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: In this paper, we consider a network game where players are
  multi-agent systems (we call them in this paper ′′coalitions′′) under the condition
  that the trajectories of players (coalitions) should (have no common
  arcs, or have no common vertices) i. e. must not intersect. In the same time
  the trajectories of players inside coalition can intersect (have common arcs,or
  have common vertices). The last condition complicates the problem, since
  the sets of strategies turn out to be mutually dependent. A family of Nash
  equilibrium is constructed and it is also shown that the minimum total time
  (cost) of players is achieved in a strategy profile that is a Nash equilibrium.
  A cooperative approach to solving the problem is proposed. Also, another
  cooperative mini maximal approach to solving the problem is investigated.
  We also consider the proportional solution and the Shapley value to allocate
  total minimal costs between players. Two approaches for constructing the
  characteristic function have been developed.
metadata.lang: en_GB
metadata.name: dc.description.sponsorship
metadata.value: This research was supported by the Russian Science Foundation grant No. 22-11-
  00051, https://rscf.ru/en/project/22-11-00051/
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: en
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Contributions to Game Theory and Management;volume 15
metadata.lang: -
metadata.name: dc.subject
metadata.value: Nash equilibrium
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: the Shapley value
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: the proportional solution
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Game Theoretic Approach to Multi-Agent Transportation Problems on Network
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 01.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/41418/1/01.pdf
resources.format: Adobe PDF
resources.size: 616,14 kB