Decomposition algorithms for generalized potential games

  • Authors:
  • Francisco Facchinei;Veronica Piccialli;Marco Sciandrone

  • Affiliations:
  • Dipartimento di Informatica e Sistemistica Antonio Ruberti, Sapienza Università di Roma, Roma, Italy 00185;Dipartimento di Ingegneria dell'Impresa, Università di Tor Vergata, Roma, Italy 00133;Dipartimento di Sistemi e Informatica, Università di Firenze, Firenze, Italy 50139

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We analyze some new decomposition schemes for the solution of generalized Nash equilibrium problems. We prove convergence for a particular class of generalized potential games that includes some interesting engineering problems. We show that some versions of our algorithms can deal also with problems lacking any convexity and consider separately the case of two players for which stronger results can be obtained.