title: About one multistage non-antagonistic network game
metadata.name: dc.contributor.author
metadata.value: Bulgakova, Maria A.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Petrosyan, Leon A.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2020-03-05T13:32:22Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2020-03-05T13:32:22Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2019-12
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Bulgakova M. A., Petrosyan L. A. About one multistage non-antagonistic network game. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2019, vol. 15, iss. 4, pp. 603–615.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11701/spbu10.2019.415
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/17168
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: In the paper, a multi-step non-antagonistic game is considered. The game has a finite number of stages, at the first stage a network is formed by simultaneously choosing communication
  vectors, and at the next, there are simultaneous non-antagonistic games, the payoffs in which
  depend on the controls chosen in the previous stage, as well as the behavior in the current
  stage. Players, at all stages except the first, have the opportunity to modify the network by
  removing any of their connections. A characteristic function is constructed for the model in
  a new way based on the calculation of optimal controls. For the case of a one-stage subgame,
  the supermodularity of the characteristic function is proved. As a solution, the Shapley value
  is considered, a simplification of the formula for calculating the components of the Shapley
  value for this characteristic function is given. Also, as a solution, a subset of the core (PRDcore)
  is considered. Strong dynamic stability has been proved for it. Work is illustrated by
  an example.
metadata.lang: en_GB
metadata.name: dc.description.sponsorship
metadata.value: This work was supported by the Russian Scientific Found (grant N 17-11-017079).
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: ru
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: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 15; Issue 4
metadata.lang: -
metadata.name: dc.subject
metadata.value: multistage games
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: supermodular function
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: Shapley value
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: characteristic function
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: strongly time consistency
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: PRD-core
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: About one multistage non-antagonistic network game
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 603-615.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/17168/1/603-615.pdf
resources.format: Adobe PDF
resources.size: 334,52 kB