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...

Celý popis

Podrobná bibliografia

Vydané v:	Networks Ročník 68; číslo 2; s. 141 - 158
Hlavní autori:	Chassein, André, Krumke, Sven O., Thielen, Clemens
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Blackwell Publishing Ltd 01.09.2016 Wiley Subscription Services, Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!