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á bibliografie

Vydáno v:	Networks Ročník 68; číslo 2; s. 141 - 158
Hlavní autoři:	Chassein, André, Krumke, Sven O., Thielen, Clemens
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Blackwell Publishing Ltd 01.09.2016 Wiley Subscription Services, Inc
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!