The Social Medium Selection Game

We consider in this paper competition of content creators in routing their content through various media. The routing decisions may correspond to the selection of a social network (e.g. twitter versus facebook or linkedin) or of a group within a given social network. The utility for a player to send its content to some medium is given as the difference between the dissemination utility at this medium and some transmission cost. We model this game as a congestion game and compute the pure potential of the game. In contrast to the continuous case, we show that there may be various equilibria. We show that the potential is M-concave which allows us to characterize the equilibria and to propose an algorithm for computing it. We then give a learning mechanism which allow us to give an efficient algorithm to determine an equilibrium. We finally determine the asymptotic form of the equilibrium and discuss the implications on the social medium selection problem.

[1]  AVNER MAY,et al.  X Game in the Newsroom : Greedy Bloggers for Picky Audience , 2013 .

[2]  Y. Narahari,et al.  A game theory inspired, decentralized, local information based algorithm for community detection in social graphs , 2012, Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012).

[3]  L. Shapley,et al.  Potential Games , 1994 .

[4]  Kazuo Murota,et al.  A framework of discrete DC programming by discrete convex analysis , 2015, Math. Program..

[5]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[6]  Boaz Patt-Shamir,et al.  A game of timing and visibility , 2008, Games Econ. Behav..

[7]  I. Milchtaich,et al.  Congestion Games with Player-Specific Payoff Functions , 1996 .

[8]  Y. Narahari,et al.  A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks , 2011, IEEE Transactions on Automation Science and Engineering.

[9]  Kazuo Murota,et al.  Scaling Algorithms for M-Convex Function Minimization , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[10]  電子情報通信学会.  IEICE transactions on fundamentals of electronics, communications and computer sciences , 1992 .

[11]  Y. Narahari,et al.  Game theoretic models for social network analysis , 2011, WWW.

[12]  L. Shapley,et al.  REGULAR ARTICLEPotential Games , 1996 .

[13]  Eitan Altman,et al.  A time and space routing game model applied to visibility competition on online social networks , 2014, 2014 7th International Conference on NETwork Games, COntrol and OPtimization (NetGCoop).

[14]  Kazuo Murota,et al.  Discrete convex analysis , 1998, Math. Program..

[15]  Laurent Massoulié,et al.  Self-organizing Flows in Social Networks , 2013, SIROCCO.

[16]  Francesco De Pellegrini,et al.  Cooperative online native advertisement: A game theoretical scheme leveraging on popularity dynamics , 2014, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[17]  Eitan Altman.  A semi-dynamic model for competition over popularity and over advertisement space in social networks , 2012, 6th International ICST Conference on Performance Evaluation Methodologies and Tools.

[18]  Vishal Misra,et al.  On Resource Management for Cloud Users: A Generalized Kelly Mechanism Approach , 2010 .

[19]  G. Tullock.  Efficient Rent Seeking , 2001 .