Representation of Finite Games as Network Congestion Games

Abstract : Weighted network congestion games are used for modeling interactions involving finitely many non-identical users of network resources, such as road segments or communication links. In spite of their special form, these games are not fundamentally special: every finite game can be represented as a weighted network congestion game. The same is true for the class of unweighted network congestion games with player-specific costs, in which the players differ in their cost functions rather than their weights. The intersection of the two classes consists of the unweighted network congestion games. These games are special: a finite game can be represented in this form if and only if it is an exact potential game.
Type de document :
Communication dans un congrès
Roberto Cominetti and Sylvain Sorin and Bruno Tuffin. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Oct 2011, Paris, France. IEEE, 2011
Liste complète des métadonnées

Littérature citée [6 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00644369
Contributeur : Ist Rennes <>
Soumis le : jeudi 24 novembre 2011 - 12:08:45
Dernière modification le : lundi 20 juin 2016 - 14:10:32
Document(s) archivé(s) le : dimanche 4 décembre 2016 - 16:39:17

Fichier

12-PID2137393.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00644369, version 1

Collections

Citation

Igal Milchtaich. Representation of Finite Games as Network Congestion Games. Roberto Cominetti and Sylvain Sorin and Bruno Tuffin. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Oct 2011, Paris, France. IEEE, 2011. 〈hal-00644369〉

Partager

Métriques

Consultations de la notice

76

Téléchargements de fichiers

79