Abstract
In this work, we are interested in finding the most efficient use of a budget to promote an opinion by paying agents within a group to supplant their true opinions. We model opinions as continuous scalars ranging from 0 to 1 with 1 (0) representing extremely positive (negative) opinion. We focus on asymmetric confidence between agents. The iterative update of an agent corresponds to the best response to other agents’ actions. The resulting confidence matrix can be seen as an equivalent Markov chain. We provide simple and efficient algorithms to solve this problem and we show through an example how to solve the stated problem in practice.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
An FPTAS, short for Fully Polynomial Time Approximation Scheme, is an algorithm that for any ɛ approximates the optimal solution up to an error (1 +ɛ) in time poly(n∕ɛ).
References
Acemoglu D, Dahleh MA, Lobel I, Ozdaglar A (2011) Bayesian learning in social networks. The Review of Economic Studies 78(4):1201–1236
Aho AV, Hopcroft JE, Ullman J (1983) Data Structures and Algorithms, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA
DeGroot MH (1974) Reaching a consensus. Journal of the American Statistical Association 69:118–121
Deuermeyer BL, Friesen DK (1984) A linear-time algorithm for classifying the states of a finite markov chain. Operations Research Letters 2(6):297–301
Doob JL (1953) Stochastic Processes. John Wiley & Sons, New York
Fagnani F, Zampieri S (2008) Randomized consensus algorithms over large scale networks. IEEE Journal on Selected Areas in Communications 26(4):634–649
Ghaderi J, Srikant R (2014) Opinion dynamics in social networks with stubborn agents: Equilibrium and convergence rate. Automatica 50(12):3209–3215
Lawler EL (1977) Fast approximation algorithms for knapsack problems. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, USA, SFCS ’77, pp 206–213
Norris JR (1998) Markov chains. Cambridge series in statistical and probabilistic mathematics, Cambridge University Press
Yildiz ME, Ozdaglar AE, Acemoglu D, Saberi A, Scaglione A (2013) Binary opinion dynamics with stubborn agents. ACM Transactions on Economics and Computation 1(4):19
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Silva, A. (2017). Opinion Manipulation in Social Networks. In: Lasaulce, S., Jimenez, T., Solan, E. (eds) Network Games, Control, and Optimization. NETGCOOP 2016. Static & Dynamic Game Theory: Foundations & Applications. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-51034-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-51034-7_18
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-51033-0
Online ISBN: 978-3-319-51034-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)