36 citations · 167 across the 66 of their papers we have counts for
4 papers · 1 filter
Multi-Player Diffusion Games on Graph Classes
Laurent Bulteau, Vincent Froese, Nimrod Talmon
We study competitive diffusion games on graphs introduced by Alon et al. [1] to model the spread of influence in social networks. Extending results of Roshanbin [8] for two players…
The Complexity of Finding Effectors
Laurent Bulteau, Stefan Fafianie, Vincent Froese +2
The NP-hard EFFECTORS problem on directed graphs is motivated by applications in network mining, particularly concerning the analysis of probabilistic information-propagation proce…
Elections with Few Voters: Candidate Control Can Be Easy
Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier +1
We study the computational complexity of candidate control in elections with few voters, that is, we consider the parameterized complexity of candidate control in elections with re…
Combinatorial Voter Control in Elections
Laurent Bulteau, Jiehua Chen, Piotr Faliszewski +2
Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who wou…