University of Southampton Institutional Repository

Influence maximization for dynamic allocation in voter dynamics

Influence maximization for dynamic allocation in voter dynamics
Influence maximization for dynamic allocation in voter dynamics
In this paper, we study the competition between external controllers with fixed campaign budgets in which one of the controllers attempts to maximize the share of a desired opinion in a group of agents who exchange opinions on a social network subject to voting dynamics. In contrast to allocating all the budgets at the beginning of the campaign, we consider a version of a temporal influence maximization problem, where the controller has the flexibility to determine when to start control. We then explore the dependence of optimal starting times to achieve maximum vote shares at a finite time horizon on network heterogeneity. We find that, for short time horizons, maximum influence is achieved by starting relatively later on more heterogeneous networks than in less homogeneous networks, while the opposite holds for long time horizons.
Cai, Zhongqi
b3ce4c1b-e545-4a86-9592-960542756e14
Brede, Markus
bbd03865-8e0b-4372-b9d7-cd549631f3f7
Gerding, Enrico
d9e92ee5-1a8c-4467-a689-8363e7743362
Cai, Zhongqi
b3ce4c1b-e545-4a86-9592-960542756e14
Brede, Markus
bbd03865-8e0b-4372-b9d7-cd549631f3f7
Gerding, Enrico
d9e92ee5-1a8c-4467-a689-8363e7743362

Cai, Zhongqi, Brede, Markus and Gerding, Enrico (2020) Influence maximization for dynamic allocation in voter dynamics. The 9th International Conference on Complex Networks and their Applications, , Madrid, Spain. 01 - 03 Dec 2020. 12 pp . (In Press)

Record type: Conference or Workshop Item (Paper)

Abstract

In this paper, we study the competition between external controllers with fixed campaign budgets in which one of the controllers attempts to maximize the share of a desired opinion in a group of agents who exchange opinions on a social network subject to voting dynamics. In contrast to allocating all the budgets at the beginning of the campaign, we consider a version of a temporal influence maximization problem, where the controller has the flexibility to determine when to start control. We then explore the dependence of optimal starting times to achieve maximum vote shares at a finite time horizon on network heterogeneity. We find that, for short time horizons, maximum influence is achieved by starting relatively later on more heterogeneous networks than in less homogeneous networks, while the opposite holds for long time horizons.

Text
competitive_influence_maximization - Accepted Manuscript
Restricted to Repository staff only
Request a copy

More information

Accepted/In Press date: 30 September 2020
Venue - Dates: The 9th International Conference on Complex Networks and their Applications, , Madrid, Spain, 2020-12-01 - 2020-12-03
Related URLs:

Identifiers

Local EPrints ID: 445019
URI: http://eprints.soton.ac.uk/id/eprint/445019
PURE UUID: bc14c22e-e6d3-4b19-91b3-57b6c90261ff
ORCID for Enrico Gerding:

Catalogue record

Date deposited: 18 Nov 2020 13:16
Last modified: 18 Nov 2020 13:16

Export record

Contributors

Author: Zhongqi Cai
Author: Markus Brede
Author: Enrico Gerding

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using , developed at the University of Southampton, but available to everyone to use.

If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×