Stochastic Game of Data Transmission with Three Asymmetric Players

Authors

  • Fengyan Sun Saint Petersburg State University; Qingdao University
  • Elena Parilina Saint Petersburg State University

Abstract

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.

Keywords:

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

Downloads

Download data is not yet available.

References

Afghah, F., A. Razi and A. Abedi (2013). Stochastic game theoretical model for packet forwarding in relay network. Telecommunication systems, 52(4), 1877–1893.

Altman, E., D. Barman, R. EI Azouzi and T. Jimenez (2004). A game theoretical approach for delay minimization in slotted ALOHA. 2004 IEEE International Conference on Communications (IEEE Cat. No. 04CH37577), 7, 3999–4003.

Bure, V.M. and E.M. Parilina (2017a). Stochastic models of data transmission in networks with different topologies. Large-Scale Systems Control, 68, 6–29 (in Russian).

Bure, V.M. and E.M. Parilina (2017b). Multiple access game with imperfect information. Mathematical game theory and applications, 9(4), 3–17 (in Russian).

Bure, V.M. and E.M. Parilina (2019). Stochastic game of data transmission in the presence of buffers of finite capacity. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 15(1), 39–46.

Fink, A.M. (1964). Equlibrium in a stochastic n-person game. J. Sci. Hirosima Univ. Ser., A-I 28, 89–93.

Koutsoupias, E. and C. Papadimitriou (1999). Worst-case equilibria. Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, 404–413.

Marban, S., P. van de Ven, P. Borm and H. Hamers (2013). ALOHA network: a game-theoretical approach. Math Meeth Oper Res, 78(2), 221–242.

Raghavan, T.E.S. and J.A. Filar. (1991) Algorithms for stochastic games - a survey. ZOR - Methods and models of operations research, 35, 437–472.

Sagduyu, Y.E. and A. Ephremides. (2006) A game-theoretic look at simple relay channel. Wireless Networks, 12(5), 545–560.

Downloads

Published

2022-03-08

How to Cite

Sun, F., & Parilina, E. (2022). Stochastic Game of Data Transmission with Three Asymmetric Players. Contributions to Game Theory and Management, 12. Retrieved from https://gametheory.spbu.ru/article/view/13032

Issue

Vol. 12 (2019)

Section

Articles

License

Articles of "Contributions to Game Theory and Management" are open access distributed under the terms of the License Agreement with Saint Petersburg State University, which permits to the authors unrestricted distribution and self-archiving free of charge.