Skip to main content
SpringerLink
Log in

Population Games with Vector Payoff and Approachability

  • Conference paper
Computational Management Science

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 682))

  • 1147 Accesses

Abstract

This paper studies population games with vector payoffs. It provides a new perspective on approachability based on mean-field game theory. The model involves a Hamilton-Jacobi-Bellman equation which describes the best-response of every player given the population distribution and an advection equation, capturing the macroscopic evolution of average payoffs if every player plays its best response.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

References

  1. Aumann, R.J.: Markets with a continuum of traders. Econometrica 32(1–2), 39–50 (1964)

    Article  Google Scholar 

  2. Bauso, D., Notarstefano, G.: Distributed n-player approachability and consensus in coalitional games. IEEE Trans. Autom. Control (2014), (in print). Available online at doi: 10.1109/TAC.2015.2411873

  3. Bauso, D., Lehrer, E., Solan, E., Venel, X.: Attainability in repeated games with vector payoffs. INFORMS Math. Oper. Res. 6054 (2014) Online version http://dx.doi.org/10.1287/moor.2014.0693

  4. Blackwell, D.: An analog of the minimax theorem for vector payoffs. Pacific J. Math. 6(1), 1–8 (1956)

    Article  Google Scholar 

  5. Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning and Games. Cambridge University Press, Cambridge (2006)

    Google Scholar 

  6. Foster, D., Vohra, R.: Regret in the on-line decision problem. Games Econ. Behav. 29, 7–35 (1999)

    Article  Google Scholar 

  7. Hart, S.: Adaptive heuristics. Econometrica 73, 1401–1430 (2005)

    Article  Google Scholar 

  8. Hart, S., Mas-Colell, A.: A general class of adaptive strategies. J. Econ. Theory 98, 26–54 (2001)

    Article  Google Scholar 

  9. Hart, S., Mas-Colell, A.: Regret-based continuous-time dynamics. Games Econ. Behav. 45, 375–394 (2003)

    Article  Google Scholar 

  10. Huang, M.Y., Caines, P.E., Malhamé, R.P.: Individual and mass behaviour in large population stochastic wireless power control problems: centralized and Nash equilibrium solutions. In: Proceedings of the 42nd IEEE Conference on Decision and Control, pp. 98–103 (2003)

    Google Scholar 

  11. Huang, M.Y., Caines, P.E., Malhamé, R.P.: Large population stochastic dynamic games: closed loop kean-vlasov systems and the Nash certainty equivalence principle. Commun. Inf. Syst. 6, 221–252 (2006)

    Google Scholar 

  12. Huang, M.Y., Caines, P.E., Malhamé, R.P.: Large population cost-coupled lqg problems with non-uniform agents: individual-mass behaviour and decentralized ε-nash equilibria. IEEE Trans. Autom. Control 9, 1560–1571 (2007)

    Article  Google Scholar 

  13. Jovanovic, B., Rosenthal, R.W.: Anonymous sequential games. J. Math. Econ. 17, 77–87 (1988)

    Article  Google Scholar 

  14. Lasry, J.m., Lions, P.l.: Jeux à champ moyen. i - le cas stationnaire. C.R. Math. 343(9), 619–625 (2006)

    Google Scholar 

  15. Lasry, J.m., Lions, P.l.: Jeux à champ moyen. ii - horizon fini et controle optimal. C. R. Math. 343(10), 679–684 (2006)

    Google Scholar 

  16. Lasry, J.m., Lions, P.l.: Mean field games. Jpn. J. Math. 2, 229–260 (2007)

    Google Scholar 

  17. Lehrer, E.: Allocation processes in cooperative games. Int. J. Game Theory 31, 341–351 (2002)

    Article  Google Scholar 

  18. Lehrer, E.: Approachability in infinite dimensional spaces. Int. J. Game Theory 31(2), 253–268 (2002)

    Article  Google Scholar 

  19. Lehrer, E.: A wide range no-regret theorem. Game Econ. Behav. 42, 101–115 (2003)

    Article  Google Scholar 

  20. Lehrer, E., Sorin, S.: Minmax via differential inclusion. Convex Anal. 14(2), 271–273 (2007)

    Google Scholar 

  21. Soulaimani, A.S., Quincampoix, M., Sorin, S.: Approachability theory, discriminating domain and differential games. SIAM J. Control. Optim. 48(4), 2461–2479 (2009)

    Article  Google Scholar 

Download references

Acknowledgements

The work of D. Bauso was supported by the 2012 “Research Fellow” Program of the Dipartimento di Matematica, Università di Trento and by PRIN 20103S5RN3 “Robust decision making in markets and organizations, 2013–2016”. This work has developed during the sabbatical period spent by D. Bauso as academic visitor at the Department of Engineering Science, University of Oxford, UK

Author information

Authors and Affiliations

  1. DICGIM, Università di Palermo, Palermo, Italy

    Dario Bauso

  2. Magdalen College, Oxford, UK

    Thomas W. L. Norman

Authors
  1. Dario Bauso
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas W. L. Norman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dario Bauso .

Editor information

Editors and Affiliations

  1. Faculty of Sciences Operations Research Center, University of Lisbon, Lisbon, Portugal

    Raquel J. Fonseca

  2. Middle East Technical University , Ankara, Turkey

    Gerhard-Wilhelm Weber

  3. Faculty of Sciences, University of Lisbon Faculty of Sciences, Lisbon, Portugal

    João Telhada

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Bauso, D., Norman, T.W.L. (2016). Population Games with Vector Payoff and Approachability. In: Fonseca, R., Weber, GW., Telhada, J. (eds) Computational Management Science. Lecture Notes in Economics and Mathematical Systems, vol 682. Springer, Cham. https://doi.org/10.1007/978-3-319-20430-7_31

Download citation

Publish with us

Policies and ethics

Search

Navigation