Game of Ages

Kumar, Sunil; Vaze, Rahul

doi:10.1109/infocomwkshps50562.2020.9162930

Cited by 13 publications

(5 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In e.g. [65] 20 , it was proven that the probability of transmission at the time instant 𝑡 + 1 at the 𝑖 node is given by 𝒫…”

Section: Appendix J Proof Of Proposition 10: Age-of-informationmentioning

confidence: 99%

Adversarial Robustness in Cognitive Radio Networks

Zamanipour¹

2022

Preprint

View full text Add to dashboard Cite

When an adversary gets access to the data sample in the adversarial robustness models and can make data-dependent changes, how has the decision maker consequently, relying deeply upon the adversarially-modified data, to make statistical inference? How can the resilience and elasticity of the network be literally justified from a game theoretical viewpoint − if there exists a tool to measure the aforementioned elasticity? The principle of byzantine resilience distributed hypothesis testing (BRDHT) is considered in this paper for cognitive radio networks (CRNs) − withoutloss-of-generality, something that can be extended to any type of homogeneous or heterogeneous networks. We use the temporal rate of the 𝛼−leakage as the appropriate tool which we measure the aforementioned resilience through. We take into account the main problem from an information theoretic point of view via an exploration over the adversarial robustness of distributed hypothesis testing rules. We chiefly examine if one can write F = 𝑚𝑎 for the main problem, consequently, we define a nested bilevel − even 3-level including a hidden control-law − mean-fieldgame (MFG) realisation solving the control dynamics as well. Further discussions are also provided e.g. the synchronisation. Our novel online algorithm − which is named OBRDHT − and solution are both unique and generic over which an evaluation is finally performed by simulations.

show abstract

“…In e.g. [65] 20 , it was proven that the probability of transmission at the time instant 𝑡 + 1 at the 𝑖 node is given by 𝒫…”

Section: Appendix J Proof Of Proposition 10: Age-of-informationmentioning

confidence: 99%

Adversarial Robustness in Cognitive Radio Networks

Zamanipour¹

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Here, a generic carrier-sense multiple access is considered, for which the nodes switch through idle, waiting, or transmitting states. Also [26] considers nodes competing over a shared resource to get low AoI, but the access protocol is once again modeled as a plain collision-based model. Finally, [27] considers instead a game between two transmitter/receiver pairs but the shared medium is an interference channel, so the analysis refers to the physical layer and the achievable capacity, and not the medium access control.…”

Section: Related Workmentioning

confidence: 99%

A Game Theoretic Approach to Age of Information in Modern Random Access Systems

Badia

Munari

2021

2021 IEEE Globecom Workshops (GC Wkshps)

View full text Add to dashboard Cite

The age of information is a performance metric describing the freshness of updates, and is of particular interest for remote sensing scenarios involving high number of nodes, as is expected to happen, e.g., in emergency scenarios or industrial applications of the Internet of Things. Only recently, this metric received a rigorous treatment in the context of modern random access techniques that are realistic for this kind of systems. In this paper, we extend these investigations from the perspective of game theory, to discuss the role of individual strategic choices on the resulting system performance. We highlight how the introduction and fine-tuning of some parameters, specifically a cost for transmission from the nodes, can regulate the overall performance and achieve system-wide efficient allocations that are also equilibria for the selfish needs of the individual users.

show abstract

“…However, when collisions are longer, no weakly dominant strategy exists and a mixed strategy Nash equilibrium was derived. In [225], authors considered a distributed competition mode where each node wants to minimize a function of its age and transmission cost but information such as the number of nodes in the network and their strategies is not available. A learning strategy was proposed for each node to use its current empirical average of age and transmission cost to determine its transmit probability in each slot.…”

Section: A Age and Gamesmentioning

confidence: 99%

“…In [224] and [225], authors studied the coexistence of nodes that value timeliness of their information at others and provided insights into how competing nodes would coexist. In [224], authors proposed a one-shot multiple access game with nodes as players, where each node shares the spectrum using a CSMA/CA based access mechanism.…”

Section: A Age and Gamesmentioning

confidence: 99%

Age of Information: An Introduction and Survey

Yates¹,

Yin²,

Brown³

et al. 2020

Preprint

View full text Add to dashboard Cite

We summarize recent contributions in the broad area of age of information (AoI). In particular, we describe the current state of the art in the design and optimization of low-latency cyberphysical systems and applications in which sources send time-stamped status updates to interested recipients. These applications desire status updates at the recipients to be as timely as possible; however, this is typically constrained by limited system resources. We describe AoI timeliness metrics and present general methods of AoI evaluation analysis that are applicable to a wide variety of sources and systems. Starting from elementary single-server queues, we apply these AoI methods to a range of increasingly complex systems, including energy harvesting sensors transmitting over noisy channels, parallel server systems, queueing networks, and various single-hop and multi-hop wireless networks. We also explore how update age is related to MMSE methods of sampling, estimation and control of stochastic processes. The paper concludes with a review of efforts to employ age optimization in cyberphysical applications.

show abstract

Game of Ages

Cited by 13 publications

References 22 publications

Adversarial Robustness in Cognitive Radio Networks

Adversarial Robustness in Cognitive Radio Networks

A Game Theoretic Approach to Age of Information in Modern Random Access Systems

Age of Information: An Introduction and Survey

Contact Info

Product

Resources

About