Price of Anarchy with multiple information sources under competition
Fecha
2023Versión
Acceso abierto / Sarbide irekia
Tipo
Artículo / Artikulua
Versión
Versión publicada / Argitaratu den bertsioa
Impacto
|
10.1016/j.orl.2023.10.004
Resumen
We characterize the Price of Anarchy (PoA) in a single channel under the presence of K competing sources. As performance metric we consider the Age of Information, which measures the freshness of information in a remote system. In our main results we show that when the service times of all sources are equal the PoA is 2−1𝐾, and that otherwise the PoA is unbounded from above. Numerical computatio ...
[++]
We characterize the Price of Anarchy (PoA) in a single channel under the presence of K competing sources. As performance metric we consider the Age of Information, which measures the freshness of information in a remote system. In our main results we show that when the service times of all sources are equal the PoA is 2−1𝐾, and that otherwise the PoA is unbounded from above. Numerical computations show that the PoA increases with the disparity of the service rates. [--]
Materias
Age of information,
Price of Anarchy,
Single server
Editor
Elsevier
Publicado en
Operations Research Letters 51(6), 2023, 605–611
Departamento
Universidad Pública de Navarra. Departamento de Estadística, Informática y Matemáticas /
Nafarroako Unibertsitate Publikoa. Estatistika, Informatika eta Matematika Saila /
Universidad Pública de Navarra/Nafarroako Unibertsitate Publikoa. Institute for Advanced Materials and Mathematics - INAMAT2
Versión del editor
Entidades Financiadoras
U. Ayesta and J. Doncel have received funding from the Department of Education of the Basque Government through the Consolidated Research Group MATHMODE ( IT1456-22 ).