Skip to main content

Exploiting Myopic Learning

  • Conference paper
Internet and Network Economics (WINE 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6484))

Included in the following conference series:

Abstract

We show how a principal can exploit myopic social learning in a population of agents in order to implement social or selfish outcomes that would not be possible under the traditional fully-rational agent model. Learning in our model takes a simple form of imitation, or replicator dynamics; a class of learning dynamics that often leads the population to converge to a Nash equilibrium of the underlying game. We show that, for a large class of games, the principal can always obtain strictly better outcomes than the corresponding Nash solution and explicitly specify how such outcomes can be implemented. The methods applied are general enough to accommodate many scenarios, and powerful enough to generate predictions that allude to some empirically-observed behavior.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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. Acemoglu, D., Bimpikis, K., Ozdaglar, A.: Communication Dynamics in Endogenous Social Networks. Working Paper (2010)

    Google Scholar 

  2. Acemoglu, D., Dahleh, M., Lobel, I., Ozdaglar, A.E.: Bayesian learning in social networks. NBER Working Paper (2008)

    Google Scholar 

  3. Borgers, T., Sarin, R.: Learning through reinforcement and replicator dynamics. Journal of Economic Theory 77(1), 1–14 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Crawford, V.P., Kugler, T., Neeman, Z., Pauzner, A.: Behaviorally Optimal Auction Design: Examples and Observations. Journal of the European Economic Association 7(2-3), 377–387 (2009)

    Article  Google Scholar 

  5. Eeckhout, J., Persico, N., Todd, P.: A Theory of Optimal Random Crackdowns. American Economic Review (2010)

    Google Scholar 

  6. Fischer, S., Vöcking, B.: On the evolution of selfish routing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 323–334. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Fudenberg, D., Levine, D.K.: The theory of learning in games. The MIT Press, Cambridge (1998)

    MATH  Google Scholar 

  8. Fudenberg, D., Maskin, E.: The folk theorem in repeated games with discounting or with incomplete information. Econometrica: Journal of the Econometric Society 54(3), 533–554 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kamenica, E., Gentzkow, M.: Bayesian persuasion. NBER Working Paper (2009)

    Google Scholar 

  10. Myerson, R.B.: Optimal auction design. Mathematics of operations research 6(1), 58 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  11. Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behavior 35(1-2), 166–196 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mostagir, M. (2010). Exploiting Myopic Learning. In: Saberi, A. (eds) Internet and Network Economics. WINE 2010. Lecture Notes in Computer Science, vol 6484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17572-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17572-5_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17571-8

  • Online ISBN: 978-3-642-17572-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics