2015
DOI: 10.1002/dac.3043
|View full text |Cite
|
Sign up to set email alerts
|

Repeated game theory as a framework for algorithm development in communication networks

Abstract: This article presents a tutorial on how to use repeated game theory as a framework for algorithm development in communication networks. The article starts by introducing the basis of one-stage games and how the outcome of such games can be predicted, through iterative elimination and Nash equilibrium. In communication networks, however, not all problems can be modeled using one-stage games. Some problems can be better modeled through multi-stage games, as many problems in communication networks consist of seve… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 16 publications
0
5
0
Order By: Relevance
“…Here, mobility issues and selection for N‐person cooperative game is left for future work. The use of repeated game theory for selection is explained in the study of Coimbra and Correia . In this, it is shown how repeated interaction of user with network needs to be made over time for efficient network selection.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Here, mobility issues and selection for N‐person cooperative game is left for future work. The use of repeated game theory for selection is explained in the study of Coimbra and Correia . In this, it is shown how repeated interaction of user with network needs to be made over time for efficient network selection.…”
Section: Related Workmentioning
confidence: 99%
“…The use of repeated game theory for selection is explained in the study of Coimbra and Correia. 18 In this, it is shown how repeated interaction of user with network needs to be made over time for efficient network selection. The study of network operator's attitude towards profit is left as future work.…”
Section: Related Workmentioning
confidence: 99%
“…With the development of communication networks, the network architecture is becoming increasingly complex. The phase and carrier frequency estimation of received signals is made possible by capturing weak signals, which is the first step in electronic communication networks [1][2][3]. In recent years, scientists have conducted much research on the subject of weak signal capture and have developed typical methods such as time-domain-based serial capture method, frequency-domain based parallel phase search capture method, etc.…”
Section: Introductionmentioning
confidence: 99%
“…The standard solution for such games is subgame perfect equilibrium (SPE), 29 which theoretically represents the final outcome of the game for each player involved and can be computed via a fundamental algorithm called backward induction (BI) 11 . By capturing sequential actions over time, extensive‐form games offer a mathematical tool for dynamic scenarios that can be structured as trees, for example, software evolutions, 30 cryptographic protocols, 31 and communication networks 32 …”
Section: Introductionmentioning
confidence: 99%
“…11 By capturing sequential actions over time, extensive-form games offer a mathematical tool for dynamic scenarios that can be structured as trees, for example, software evolutions, 30 cryptographic protocols, 31 and communication networks. 32 However, one issue that is quite natural but ignored in traditional game models is that decision-making usually entails resource costs, for instance, time, energy, space, and so on. In many cases, the resources available for players' actions (e.g., for searching the strategy space) are limited.…”
Section: Introductionmentioning
confidence: 99%