Skip to main content

Decentralized Dynamics for Finite Opinion Games

  • Conference paper
Algorithmic Game Theory (SAGT 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7615))

Included in the following conference series:

Abstract

Game theory studies situations in which strategic players can modify the state of a given system, due to the absence of a central authority. Solution concepts, such as Nash equilibrium, are defined to predict the outcome of such situations. In the spirit of the field, we study the computation of solution concepts by means of decentralized dynamics. These are algorithms in which players move in turns to improve their own utility and the hope is that the system reaches an “equilibrium” quickly.

We study these dynamics for the class of opinion games, recently introduced by [1]. These are games, important in economics and sociology, that model the formation of an opinion in a social network. We study best-response dynamics and show that the convergence to Nash equilibria is polynomial in the number of players. We also study a noisy version of best-response dynamics, called logit dynamics, and prove a host of results about its convergence rate as the noise in the system varies. To get these results, we use a variety of techniques developed to bound the mixing time of Markov chains, including coupling, spectral characterizations and bottleneck ratio.

Work partially supported by EPSRC grant EP/G069239/1 “Efficient Decentralised Approaches in Algorithmic Game Theory” and by PRIN 2008 research project COGENT (COmputational and GamE-theoretic aspects of uncoordinated NeTworks), funded by the Italian Ministry of University and Research.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bindel, D., Kleinberg, J., Oren, S.: How bad is forming your own opinion? In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 57–66 (October 2011)

    Google Scholar 

  2. Acemoglu, D., Ozdaglar, A.: Opinion dynamics and learning in social networks. Dynamic Games and Applications 1, 3–49 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  3. DeMarzo, P.M., Vayanos, D., Zwiebel, J.: Persuasion bias, social influence, and unidimensional opinions. The Quarterly Journal of Economics 118(3), 909–968 (2003)

    Article  MATH  Google Scholar 

  4. Golub, B., Jackson, M.O.: Naïve learning in social networks and the wisdom of crowds. American Economic Journal: Microeconomics 2(1), 112–149 (2010)

    Google Scholar 

  5. Jackson, M.O.: Social and Economic Networks. Princeton University Press, Princeton (2008)

    MATH  Google Scholar 

  6. DeGroot, M.H.: Reaching a consensus. Journal of the American Statistical Association 69(345), 118–121 (1974)

    Article  MATH  Google Scholar 

  7. Friedkin, N.E., Johnsen, E.C.: Social influence and opinions. The Journal of Mathematical Sociology 15(3-4), 193–206 (1990)

    Article  MATH  Google Scholar 

  8. Rosenthal, R.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory 2, 65–67 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  9. Monderer, D., Shapley, L.S.: Potential games. Games and Economic Behavior 14(1), 124–143 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Blume, L.E.: The statistical mechanics of strategic interaction. Games and Economic Behavior 5(3), 387–424 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  11. Auletta, V., Ferraioli, D., Pasquale, F., Persiano, G.: Mixing Time and Stationary Expected Social Welfare of Logit Dynamics. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 54–65. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Auletta, V., Ferraioli, D., Pasquale, F., Penna, P., Persiano, G.: Convergence to equilibrium of logit dynamics for strategic games. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2011, pp. 197–206. ACM (2011)

    Google Scholar 

  13. Levin, D.A., Peres, Y., Wilmer, E.L.: Markov chains and mixing times. American Mathematical Society (2006)

    Google Scholar 

  14. Ellison, G.: Learning, local interaction, and coordination. Econometrica 61(5), 1047–1071 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. Young, H.P.: The diffusion of innovations in social networks. In: Blume, B.L., Durlauf, S.N. (eds.) Economy as an Evolving Complex System. Proceedings volume in the Santa Fe Institute studies in the sciences of complexity, vol. 3, pp. 267–282. Oxford University Press, US (2006)

    Google Scholar 

  16. Montanari, A., Saberi, A.: Convergence to equilibrium in local interaction games. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 303–312 (October 2009)

    Google Scholar 

  17. Asadpour, A., Saberi, A.: On the Inefficiency Ratio of Stable Equilibria in Congestion Games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 545–552. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  18. Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2004, pp. 604–612. ACM, New York (2004)

    Chapter  Google Scholar 

  19. Balcan, M.F., Blum, A., Mansour, Y.: Improved equilibria via public service advertising. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, pp. 728–737. Society for Industrial and Applied Mathematics (2009)

    Google Scholar 

  20. Bhalgat, A., Chakraborty, T., Khanna, S.: Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. In: Proceedings of the 11th ACM Conference on Electronic Commerce, EC 2010, pp. 73–82. ACM (2010)

    Google Scholar 

  21. Dyer, M., Mohanaraj, V.: Pairwise-Interaction Games. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 159–170. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  22. Berger, N., Kenyon, C., Mossel, E., Peres, Y.: Glauber dynamics on trees and hyperbolic graphs. Probability Theory and Related Fields 131, 311–340 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  23. Bubley, R., Dyer, M.: Path coupling: A technique for proving rapid mixing in markov chains, p. 223. IEEE Computer Society, Los Alamitos (1997)

    Google Scholar 

  24. Thilikos, D., Serna, M., Bodlaender, H.: Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 192–203. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  25. Auletta, V., Ferraioli, D., Pasquale, F., Persiano, G.: Metastability of logit dynamics for coordination games. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 1006–1024. SIAM (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferraioli, D., Goldberg, P.W., Ventre, C. (2012). Decentralized Dynamics for Finite Opinion Games. In: Serna, M. (eds) Algorithmic Game Theory. SAGT 2012. Lecture Notes in Computer Science, vol 7615. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33996-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33996-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33995-0

  • Online ISBN: 978-3-642-33996-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics