A note on competitive diffusion through social networks

From MaRDI portal
Publication:991758

DOI10.1016/j.ipl.2009.12.009zbMath1197.91057OpenAlexW2056621120MaRDI QIDQ991758

Noga Alon, Ariel D. Procaccia, Michal Feldman, Moshe Tennenholtz

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.12.009




Related Items (25)

A probabilistic model for the interaction of an agent with a network environmentComplexity of equilibrium in competitive diffusion games on social networksA novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodesCompetitive Diffusion on Weighted GraphsPure Nash equilibria of competitive diffusion process on toroidal grid graphsAlgebraic formulation and Nash equilibrium of competitive diffusion gamesA game-theoretic approach for modeling competitive diffusion over social networksThe existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordalityPrice of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation FunctionsMulti-player Diffusion Games on Graph ClassesComputing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oraclesExistence of pure Nash equilibria in 2-player information diffusion games with strict public preferencesWelfare maximization with friends-of-friends network externalitiesInformation diffusion on the iterated local transitivity model of online social networksTwo-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash EquilibriumPure-strategy Nash equilibria on competitive diffusion gamesBurning numbers of path forests and spidersGeneral rumor blocking: an efficient random algorithm with martingale approachThe one-round multi-player discrete Voronoi game on grids and treesSpatial competition on 2-dimensional markets and networks when consumers don't always go to the closest firmBurning numbers of \(t\)-unicyclic graphsA comment on pure-strategy Nash equilibria in competitive diffusion gamesFinding Safe Strategies for Competitive Diffusion on TreesFirefighting as a Strategic GameMulti-Player Diffusion Games on Graph Classes



Cites Work


This page was built for publication: A note on competitive diffusion through social networks