This article is cited in 2 scientific papers (total in 2 papers)
Multiple access game with imperfect information
Vladimir M. Bure, Elena M. Parilina
Saint Petersburg State University
We propose a model of data transmission in the network of a special topology,
in which two players (nodes of the network) tend to send as many randomly appeared data packages as they can through a common node. We assume that the player does not have complete information on the number
of data packages of the other player for possible transfer to the destination node.
To solve the game, we propose to use cooperative and noncooperative approaches, according
to which the cooperative solution and Nash equilibrium are found. To compare the players' payoffs in
the cooperative solution and the Nash equilibrium,
the price of anarchy is calculated.
data transmission, multiple access, stochastic game, imperfect information.
PDF file (315 kB)
Vladimir M. Bure, Elena M. Parilina, “Multiple access game with imperfect information”, Mat. Teor. Igr Pril., 9:4 (2017), 3–17
Citation in format AMSBIB
\by Vladimir~M.~Bure, Elena~M.~Parilina
\paper Multiple access game with imperfect information
\jour Mat. Teor. Igr Pril.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
F. Sun, E. Parilina, “Stochastic game of data transmission with three asymmetric players”, Contributions to Game Theory and Management, Vol Xii, Contributions to Game Theory and Management, 12, eds. L. Petrosyan, N. Zenkevich, St Petersburg Univ Grad Sch Management, 2019, 303–315
V. M. Bure, E. M. Parilina, “Stochastic game of data transmission in the presence of buffers of finite capacity”, Vestn. St.-Peterbg. Univ. Ser. 10 Prikl. Mat. Inform. Protsessy, 15:1 (2019), 39–46
|Number of views:|