In the paper, we consider a stochastic game model of data transmission with three asymmetric players (i.e. network nodes), in which the network is given and does not change over time. The players aim to transmit as many packages as possible to the corresponding terminal nodes through the common node whose capacity is two. We assume that each player has a finite capacity buffer for storing data packages. The dynamic process of data transmission is modeled as a stochastic game with finite set of states. Existence of the Nash equilibrium and a cooperative solution is proved. We find the cooperative strategy profile and Nash equilibrium in pure strategies. The estimation of the price of anarchy is calculated for a numerical example.
Original languageEnglish
Title of host publicationCONTRIBUTIONS TO GAME THEORY AND MANAGEMENT, VOL XII
EditorsLA Petrosyan, NA Zenkevich
PublisherИздательство Санкт-Петербургского университета
Pages303-315
Number of pages13
ISBN (Print)*****************
StatePublished - 2019
Event12th International Conference on Game Theory and Management, GMT2018 - St Petersburg, Russian Federation
Duration: 27 Jun 201829 Jun 2018

Publication series

NameContributions to Game Theory and Management
PublisherST PETERSBURG UNIV GRAD SCH MANAGEMENT
Volume12
ISSN (Print)2310-2608

Conference

Conference12th International Conference on Game Theory and Management, GMT2018
Country/TerritoryRussian Federation
CitySt Petersburg
Period27/06/1829/06/18

    Research areas

  • ALOHA-like scheme, stochastic game, data transmission, price of anarchy

ID: 47422760