Pages that link to "Item:Q991758"
From MaRDI portal
The following pages link to A note on competitive diffusion through social networks (Q991758):
Displaying 30 items.
- A probabilistic model for the interaction of an agent with a network environment (Q269125) (← links)
- Complexity of equilibrium in competitive diffusion games on social networks (Q273917) (← links)
- Pure Nash equilibria of competitive diffusion process on toroidal grid graphs (Q323032) (← links)
- A comment on pure-strategy Nash equilibria in competitive diffusion games (Q763492) (← links)
- A novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodes (Q1620199) (← links)
- Algebraic formulation and Nash equilibrium of competitive diffusion games (Q1649026) (← links)
- A game-theoretic approach for modeling competitive diffusion over social networks (Q1651874) (← links)
- Welfare maximization with friends-of-friends network externalities (Q1693985) (← links)
- Competitive contagion in networks (Q1735734) (← links)
- Pure-strategy Nash equilibria on competitive diffusion games (Q1752579) (← links)
- Burning numbers of path forests and spiders (Q2021650) (← links)
- Spatial competition on 2-dimensional markets and networks when consumers don't always go to the closest firm (Q2051511) (← links)
- Burning numbers of \(t\)-unicyclic graphs (Q2064928) (← links)
- The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality (Q2172410) (← links)
- Dynamic competition over social networks (Q2273916) (← links)
- General rumor blocking: an efficient random algorithm with martingale approach (Q2283009) (← links)
- Competitive profit maximization in social networks (Q2404075) (← links)
- Information diffusion on the iterated local transitivity model of online social networks (Q2446311) (← links)
- Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions (Q2937761) (← links)
- Multi-player Diffusion Games on Graph Classes (Q2948467) (← links)
- Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium (Q3297794) (← links)
- Competitive Diffusion on Weighted Graphs (Q3449840) (← links)
- Finding Safe Strategies for Competitive Diffusion on Trees (Q4985784) (← links)
- Firefighting as a Strategic Game (Q5856433) (← links)
- Multi-Player Diffusion Games on Graph Classes (Q5856441) (← links)
- The one-round multi-player discrete Voronoi game on grids and trees (Q5918936) (← links)
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)
- Existence of pure Nash equilibria in 2-player information diffusion games with strict public preferences (Q6100678) (← links)
- Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source (Q6559029) (← links)
- Nash equilibria in reverse temporal Voronoi games (Q6616234) (← links)
