Skip to main navigation Skip to search Skip to main content

Stackelberg games with dynamic spanning trees

  • Wantong Cheng*
  • , Min Cheng
  • , Qirui Sun
  • , Xuanping Fan
  • , Yin Li
  • *Corresponding author for this work
  • Lobachevsky State University of Nizhni Novgorod
  • St. Petersburg State University
  • Yan'an University
  • School of Mathematics, Harbin Institute of Technology

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

Abstract

This article considers a Stackelberg game with dynamic spanning trees. The leader will identify the edges between some of the followers, which will be shown in red. Then the followers will play a two-stage spanning tree game with "shock", which means that after the first stage, a specific follower will leave the game with a certain probability, which depends on the behavior of all the followers in the first stage. The equilibrium of the Stackelberg game with dynamic spanning tree is defined, and correlative conclusions are given.

Original languageEnglish
Title of host publicationProceedings of the 35th Chinese Control and Decision Conference, CCDC 2023
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4255-4258
Number of pages4
ISBN (Electronic)9798350334722
DOIs
StatePublished - 2023
Externally publishedYes
Event35th Chinese Control and Decision Conference, CCDC 2023 - Yichang, China
Duration: 20 May 202322 May 2023

Publication series

NameProceedings of the 35th Chinese Control and Decision Conference, CCDC 2023

Conference

Conference35th Chinese Control and Decision Conference, CCDC 2023
Country/TerritoryChina
CityYichang
Period20/05/2322/05/23

Keywords

  • Stackelberg game
  • cooperative game
  • dynamic spanning tree
  • equilibrium
  • shock

Fingerprint

Dive into the research topics of 'Stackelberg games with dynamic spanning trees'. Together they form a unique fingerprint.

Cite this