Symmetric Games with networking applications

Abstract : In their seminal paper [1], Orda, Rom and Shimkin have already studied fully symmetric routing games, i.e. games in which all players have the same sources, destinations, demands and costs. They established the uniqueness of an equilibrium in these games. We extend their result to weaker forms of symmetry, which does not require a common source or destination. Considering routing games, we provide conditions under which whenever there is some symmetry between some players, then any equilibrium necessarily has these symmetry property as well. We then extend the symmetry result to general games.
Document type :
Conference papers
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/hal-00644106
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, November 23, 2011 - 3:50:02 PM
Last modification on : Wednesday, July 3, 2019 - 12:28:04 PM
Long-term archiving on : Friday, February 24, 2012 - 2:30:15 AM

File

26-nt5.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00644106, version 1

Citation

Eitan Altman, Odile Pourtallier, Tania Jimenez, Hisao Kameda. Symmetric Games with networking applications. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Telecom SudParis et Université Paris Descartes, Oct 2011, Paris, France. ⟨hal-00644106⟩

Share

Metrics

Record views

363

Files downloads

421