Price of Anarchy with multiple information sources under competition
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 a...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2023 |
| País: | España |
| Recursos: | Universidad del País Vasco |
| Repositorio: | Addi. Archivo Digital para la Docencia y la Investigación |
| OAI Identifier: | oai:addi.ehu.eus:10810/63835 |
| Acesso em linha: | http://hdl.handle.net/10810/63835 |
| Access Level: | acceso abierto |
| Palavra-chave: | age of Information price of anarchy single server |
| Resumo: | 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 K , and that otherwise the PoA is unbounded from above. Numerical computations show that the PoA increases with the disparity of the service rates |
|---|