Skip to main content
  • 1020 Accesses

Abstract

Generalized Nash equilibrium problems describe multi-agent systems where each decision maker, or agent, aims at minimizing its individual cost function, yet all are subject to shared, coupling constraints. Distributed algorithms represent viable solution methods for solving generalized Nash equilibrium problems, since they require the agents to optimize and communicate locally, besides agree on the shared resources with selected other agents. The design of efficient solution algorithms is however extremely challenging from a theoretical perspective. In this chapter, we show that operator theory offers the appropriate mathematical tools to design distributed solution methods for generalized Nash equilibrium problems.

This work was partially supported by the Netherlands Organization for Scientific Research (NWO) under research projects OMEGA (grant n. 613.001.702) and P2P-TALES (grant n. 647.003.003).

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 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover 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. Barrera J, Garcia A (2015) Dynamic incentives for congestion control. IEEE Trans Autom Control 60(2):299–310

    Article  MathSciNet  Google Scholar 

  2. Bauschke HH, Combettes PL (2010) Convex analysis and monotone operator theory in Hilbert spaces. Springer

    Google Scholar 

  3. Belgioioso G, Grammatico S (2017) Semi-decentralized Nash equilibrium seeking in aggregative games with coupling constraints and non-differentiable cost functions. IEEE Control Syst Lett 1(2):400–405

    Article  Google Scholar 

  4. Belgioioso G, Grammatico S (2018) Projected-gradient algorithms for generalized equilibrium seeking in aggregative games are preconditioned forward-backward methods. In: Proceedings of the European control conference

    Google Scholar 

  5. Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press

    Google Scholar 

  6. Fabiani F, Grammatico S (2018) A mixed-logical-dynamical model for automated driving on highways. In: Proceedings of the IEEE conference on decision and control. Miami, USA

    Google Scholar 

  7. Facchinei F, Kanzow C (2007) Generalized Nash equilibrium problems. 4OR 5(3):173–210

    Google Scholar 

  8. Grammatico S (2016) Exponentially convergent decentralized charging control for large populations of plug-in electric vehicles. In: Proceedings of the IEEE conference on decision and control. Las Vegas, USA

    Google Scholar 

  9. Grammatico S (2017) Dynamic control of agents playing aggregative games with coupling constraints. IEEE Trans. on Automatic Control 62(9):4537–4548

    Article  MathSciNet  Google Scholar 

  10. Grammatico S Proximal dynamics in multi-agent network games. IEEE Trans Control Netw Syst (in press)

    Google Scholar 

  11. Grammatico S, Parise F, Colombino M, Lygeros J (2016) Decentralized convergence to Nash equilibria in constrained deterministic mean field control. IEEE Trans Autom Control 61(11):3315–3329

    Article  MathSciNet  Google Scholar 

  12. Kannan A, Shanbhag U (2012) Distributed computation of equilibria in monotone Nash games via iterative regularization techniques. SIAM J Optim 22(4):1177–1205

    Article  MathSciNet  Google Scholar 

  13. Koshal J, Nedic A, Shanbhag U (2013) Regularized iterative stochastic approximation methods for stochastic variational inequality problems. IEEE Trans Autom Control 58(3):594–609

    Article  MathSciNet  Google Scholar 

  14. Koshal J, Nedić A, Shanbhag U (2016) Distributed algorithms for aggregative games on graphs. Oper Res 64(3):680–704

    Article  MathSciNet  Google Scholar 

  15. Li N, Chen L, Dahleh M (2015) Demand response using linear supply function bidding. IEEE Trans Smart Grid 6(4):1827–1838

    Article  Google Scholar 

  16. Liang S, Yi P, Hong Y (2017) Distributed Nash equilibrium seeking for aggregative games with coupled constraints. Automatica 85:179–185

    Article  MathSciNet  Google Scholar 

  17. Ma Z, Callaway D, Hiskens I (2013) Decentralized charging control of large populations of plug-in electric vehicles. IEEE Trans Control Syst Technol 21(1):67–78

    Article  Google Scholar 

  18. Ma Z, Zou S, Ran L, Shi X, Hiskens I (2016) Efficient decentralized coordination of large-scale plug-in electric vehicle charging. Automatica 69:35–47

    Article  MathSciNet  Google Scholar 

  19. Paccagnan D, Gentile B, Parise F, Kamgarpour M, Lygeros J (2016) Distributed computation of generalized Nash equilibria in quadratic aggregative games with affine coupling constraints. In: Proceedings of the IEEE conference on decision and control. Las Vegas, USA

    Google Scholar 

  20. Palomar D, Eldar Y (2010) Convex optimization in signal processing and communications. Cambridge University Press

    Google Scholar 

  21. Parise F, Colombino M, Grammatico S, Lygeros J (2014) Mean field constrained charging policy for large populations of plug-in electric vehicles. In: Proceedings of the IEEE conference on decision and control. Los Angeles, USA, pp 5101–5106

    Google Scholar 

  22. Ryu E, Boyd S (2016) Primer on monotone operator methods. Appl Comput Math 15(1):3–43

    MathSciNet  MATH  Google Scholar 

  23. Saad W, Han Z, Poor H, Başar T (2012) Game theoretic methods for the smart grid. IEEE signal processing magazine pp 86–105

    Google Scholar 

  24. Salehisadaghiani F, Pavel L (2018) Distributed nash equilibrium seeking in networked graphical games. Automatica 87:17–24

    Article  MathSciNet  Google Scholar 

  25. Yi P, Pavel L (2017) A distributed primal-dual algorithm for computation of generalized nash equilibria via operator splitting methods. In: Proceedings of the IEEE conference on decision and control. Melbourne, Australia, pp 3841–3846

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sergio Grammatico .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Grammatico, S. (2020). On Distributed Generalized Nash Equilibrium Seeking. In: Crisostomi, E., Ghaddar, B., Häusler, F., Naoum-Sawaya, J., Russo, G., Shorten, R. (eds) Analytics for the Sharing Economy: Mathematics, Engineering and Business Perspectives. Springer, Cham. https://doi.org/10.1007/978-3-030-35032-1_4

Download citation

Publish with us

Policies and ethics