TY - RPRT
A1 - Werth, Thomas L.
A1 - Sperber, Heike
A1 - Krumke, Sven O.
T1 - Efficient Computation of Equilibria in Bottleneck Games via Game Transformation
N2 - We study the efficient computation of Nash and strong equilibria in weighted bottleneck games. In such a game different players interact on a set of resources in the way that every player chooses a subset of the resources as her strategy. The cost of a single resource depends on the total weight of players choosing it and the personal cost every player tries to minimize is the cost of the most expensive resource in her strategy, the bottleneck value. To derive efficient algorithms for finding Nash equilibria in these games, we generalize a tranformation of a bottleneck game into a special congestion game introduced by Caragiannis et al. [1]. While investigating the transformation we introduce so-called lexicographic games, in which the aim of a player is not only to minimize her bottleneck value but to lexicographically minimize the ordered vector of costs of all resources in her strategy. For the special case of network bottleneck games, i.e., the set of resources are the edges of a graph and the strategies are paths, we analyse different Greedy type methods and their limitations for extension-parallel and series-parallel graphs.
T3 - Report in Wirtschaftsmathematik (WIMA Report) - 134
Y1 - 2011
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2283
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-16829
ER -