Skip to Main content Skip to Navigation
Conference papers

A Time and Space Routing Game Model applied to Visibility Competition on Online Social Networks

Abstract : Companies or users that want to do advertising on Online Social Networks, need to know in which News Feed it would be more efficient to post, at what time of day the posts would have more visibility and which topic of message they should choose to reach popularity. We propose to answer these questions with the help of the Routing Game Theory, which considers a finite number of players and splittable demands. First, we propose a visibility measure on a News Feed. Next, we present our game based on visibility measures, which is similar to the Weighted Allocation Game. Following this consideration, we provide the uniqueness of the Nash Equilibrium, a characterization via concave programming, and its closed form. Then, we propose a two time scale decentralized algorithm where each user estimates the total flow of messages in each News Feed and uses stochastic gradient algorithm to update their own flows. Finally, we use a real data set in order to estimate the parameters of our model. The goal of this model is to provide to the Online Social Network Authority a better knowledge of posting behavior of competitive users.
Document type :
Conference papers
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Eitan Altman Connect in order to contact the contributor
Submitted on : Saturday, September 20, 2014 - 2:30:07 PM
Last modification on : Monday, July 26, 2021 - 9:12:01 AM
Long-term archiving on: : Friday, April 14, 2017 - 1:09:46 PM


Files produced by the author(s)


  • HAL Id : hal-01066455, version 1



Alexandre Reiffers-Masson, Eitan Altman, Yezekael Hayel. A Time and Space Routing Game Model applied to Visibility Competition on Online Social Networks. 7th International Conference on NETwork Games COntrol and OPtimization (NETGCOOP 2014), Oct 2014, Trento, Italy. ⟨hal-01066455⟩



Les métriques sont temporairement indisponibles