How to Make Money From Fresh Data: Subscription Strategies in Age-Based Systems (2404.16009v1)
Abstract: 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.
- Pricing fresh data. IEEE J. Selected Areas in Communications, 39(5):1211–1225, May 2021.
- Age of information in gossip networks: A friendly introduction and literature survey. Available at arXiv:2312.16163.
- R. D. Yates. The age of gossip in networks. In IEEE ISIT, July 2021.
- P. Kaswan and S. Ulukus. How robust are timely gossip networks to jamming attacks? IEEE J. Sel. Areas in Info. Theory, 4:820–832, 2023.
- A. Srivastava and S. Ulukus. Age of gossip on a grid. In Allerton Conference, September 2023.
- A. Srivastava and S. Ulukus. Age of gossip on generalized rings. In IEEE MILCOM, October 2023.
- Age of gossip in networks with community structure. In IEEE SPAWC, September 2021.
- P. Mitra and S. Ulukus. A learning based scheme for fair timeliness in sparse gossip networks. In IEEE ICMLCN, May 2024.
- S. Ferretti. Publish-subscribe systems via gossip: a study based on complex networks. In ACM SIMPLEX, June 2012.
- G. Egorov and K. Sonin. Persuasion on networks. Technical report, National Bureau of Economic Research, July 2020.