Capacitated network design games with weighted players

We consider network design games with weighted players and uniform edge capacities and study their Nash equilibria. In these games, each player has to choose a path from her source to her sink through a network subject to the constraint that the total weight of all players using an edge within their...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Networks Jg. 68; H. 2; S. 141 - 158
Hauptverfasser:	Chassein, André, Krumke, Sven O., Thielen, Clemens
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Blackwell Publishing Ltd 01.09.2016 Wiley Subscription Services, Inc
Schlagworte:	Charging computational complexity Feasibility Game theory Games Mathematical models Nash equilibrium network design games Networks Optimization Players price of stability series-parallel graphs
ISSN:	0028-3045, 1097-0037
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!