Skip to main navigation Skip to search Skip to main content

Dynamic "optimistic" characteristic function in the game with spanning tree

  • Min Cheng*
  • , Peichen Ye
  • , Yin Li
  • *Corresponding author for this work
  • St. Petersburg State University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Consider a two-stage n-person stochastic game with spanning tree. The cooperative action of the players is defined. In the first stage, players construct the associated cost matrix on a complete graph by selecting strategies, and determine the minimum cost spanning tree. After the first stage, the graph constructed by the players changes randomly with a given probability, and the cost of one or more edges is changed, depending on the action of all players in the first stage. This paper defines a dynamic "optimistic"game with spanning tree and new characteristic functions in the two-stage stochastic game. Finally, it is proved that under certain conditions, the core of the dynamic "optimistic"game is not empty.

Original languageEnglish
Title of host publicationProceedings of the 34th Chinese Control and Decision Conference, CCDC 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages5427-5432
Number of pages6
ISBN (Electronic)9781665478960
DOIs
StatePublished - 2022
Externally publishedYes
Event34th Chinese Control and Decision Conference, CCDC 2022 - Hefei, China
Duration: 15 Aug 202217 Aug 2022

Publication series

NameProceedings of the 34th Chinese Control and Decision Conference, CCDC 2022

Conference

Conference34th Chinese Control and Decision Conference, CCDC 2022
Country/TerritoryChina
CityHefei
Period15/08/2217/08/22

Keywords

  • characteristic function
  • cooperative game
  • dynamic optimistic game

Fingerprint

Dive into the research topics of 'Dynamic "optimistic" characteristic function in the game with spanning tree'. Together they form a unique fingerprint.

Cite this