TY - GEN
T1 - How to Make Money From Fresh Data
T2 - 2024 IEEE Global Communications Conference, GLOBECOM 2024
AU - Kaswan, Priyanka
AU - Bastopcu, Melih
AU - Ulukus, Sennur
AU - Etesami, S. Rasoul
AU - Basar, Tamer
N1 - Research of UIUC authors was supported in part by the ARO MURI Grant AG285 and the AFOSR Grant FA9550-19-1-0353.
PY - 2024
Y1 - 2024
N2 - We consider a communication system consisting of a server that tracks and publishes updates about a time-varying data source or event, and a gossip network of users interested in closely tracking the event. The timeliness of the information is measured through the version age of information. The users wish to have their expected version ages remain below a threshold, and have the option to either rely on gossip from their neighbors or subscribe to the server directly to follow updates about the event if the former option does not meet the timeliness requirements. The server wishes to maximize its profit by increasing the number of subscribers and reducing costs associated with the frequent sampling of the event. We model the problem setup as a Stackelberg game between the server and the users, where the server commits to a frequency of sampling the event, and the users make decisions on whether to subscribe or not. As an initial work, we focus on directed networks with unidirectional flow of information and obtain the optimal equilibrium strategies for all the players. We provide simulation results to confirm the theoretical findings and provide additional insights.
AB - We consider a communication system consisting of a server that tracks and publishes updates about a time-varying data source or event, and a gossip network of users interested in closely tracking the event. The timeliness of the information is measured through the version age of information. The users wish to have their expected version ages remain below a threshold, and have the option to either rely on gossip from their neighbors or subscribe to the server directly to follow updates about the event if the former option does not meet the timeliness requirements. The server wishes to maximize its profit by increasing the number of subscribers and reducing costs associated with the frequent sampling of the event. We model the problem setup as a Stackelberg game between the server and the users, where the server commits to a frequency of sampling the event, and the users make decisions on whether to subscribe or not. As an initial work, we focus on directed networks with unidirectional flow of information and obtain the optimal equilibrium strategies for all the players. We provide simulation results to confirm the theoretical findings and provide additional insights.
UR - http://www.scopus.com/inward/record.url?scp=105000827795&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=105000827795&partnerID=8YFLogxK
U2 - 10.1109/GLOBECOM52923.2024.10901013
DO - 10.1109/GLOBECOM52923.2024.10901013
M3 - Conference contribution
AN - SCOPUS:105000827795
T3 - Proceedings - IEEE Global Communications Conference, GLOBECOM
SP - 2226
EP - 2231
BT - GLOBECOM 2024 - 2024 IEEE Global Communications Conference
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 8 December 2024 through 12 December 2024
ER -