A Multiple Access Game with Incomplete Information

Standard

A Multiple Access Game with Incomplete Information. / Bure, V. M.; Parilina, E. M.

In: Automation and Remote Control, Vol. 83, No. 9, 01.09.2022, p. 1467-1475.

Research output: Contribution to journal › Article › peer-review

Author

Bure, V. M. ; Parilina, E. M. / A Multiple Access Game with Incomplete Information. In: Automation and Remote Control. 2022 ; Vol. 83, No. 9. pp. 1467-1475.

BibTeX

@article{fa7349d20b19406fad7951856c5bd679,

title = "A Multiple Access Game with Incomplete Information",

abstract = "Abstract: We propose a data transmission model in a special topology network in which two players(network nodes) seek to send as many randomly appearing data packets as possible through acommon node. It is assumed that the players do not have complete information about whether theother player has a data packet for possible transfer. For the solution, it is proposed to usecooperative and noncooperative approaches in accordance with which a cooperative solution andNash equilibrium are found. The price of anarchy is calculated to compare the total payoffs of theplayers in the cooperative solution and the Nash equilibrium.",

keywords = "data transmission, incomplete information, multiple access, stochastic game",

author = "Bure, {V. M.} and Parilina, {E. M.}",

note = "Publisher Copyright: {\textcopyright} 2022, Pleiades Publishing, Ltd.",

year = "2022",

month = sep,

day = "1",

doi = "10.1134/s0005117922090090",

language = "English",

volume = "83",

pages = "1467--1475",

journal = "Automation and Remote Control",

issn = "0005-1179",

publisher = "МАИК {"}Наука/Интерпериодика{"}",

number = "9",

}

RIS

TY - JOUR

T1 - A Multiple Access Game with Incomplete Information

AU - Bure, V. M.

AU - Parilina, E. M.

PY - 2022/9/1

Y1 - 2022/9/1

N2 - Abstract: We propose a data transmission model in a special topology network in which two players(network nodes) seek to send as many randomly appearing data packets as possible through acommon node. It is assumed that the players do not have complete information about whether theother player has a data packet for possible transfer. For the solution, it is proposed to usecooperative and noncooperative approaches in accordance with which a cooperative solution andNash equilibrium are found. The price of anarchy is calculated to compare the total payoffs of theplayers in the cooperative solution and the Nash equilibrium.

AB - Abstract: We propose a data transmission model in a special topology network in which two players(network nodes) seek to send as many randomly appearing data packets as possible through acommon node. It is assumed that the players do not have complete information about whether theother player has a data packet for possible transfer. For the solution, it is proposed to usecooperative and noncooperative approaches in accordance with which a cooperative solution andNash equilibrium are found. The price of anarchy is calculated to compare the total payoffs of theplayers in the cooperative solution and the Nash equilibrium.

KW - data transmission

KW - incomplete information

KW - multiple access

KW - stochastic game

UR - http://www.scopus.com/inward/record.url?scp=85140927045&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/e0be9b35-339f-36b4-b754-fe777fc2a862/

U2 - 10.1134/s0005117922090090

DO - 10.1134/s0005117922090090

M3 - Article

AN - SCOPUS:85140927045

VL - 83

SP - 1467

EP - 1475

JO - Automation and Remote Control

JF - Automation and Remote Control

SN - 0005-1179

IS - 9

ER -

ID: 100063288