Symmetric Games with networking applications - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Symmetric Games with networking applications

(1) , (2) , (3) , (4)
1
2
3
4

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.
Fichier principal
Vignette du fichier
26-nt5.pdf (276.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00644106 , version 1 (23-11-2011)

Identifiers

  • HAL Id : hal-00644106 , version 1

Cite

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⟩
162 View
321 Download

Share

Gmail Facebook Twitter LinkedIn More