Show simple item record

dc.contributor.authorGairing, M.en
dc.contributor.authorLucking, T.en
dc.contributor.authorMavronicolas, Mariosen
dc.contributor.authorMonien, Burkharden
dc.contributor.authorSpirakis, Paul G.en
dc.creatorGairing, M.en
dc.creatorLucking, T.en
dc.creatorMavronicolas, Mariosen
dc.creatorMonien, Burkharden
dc.creatorSpirakis, Paul G.en
dc.description.abstractWe study the combinatorial structure and computational complexity of extreme Nash equilibria, ones that maximize or minimize a certain objective function, in the context of a selfish routing game. Specifically, we assume a collection of n users, each employing a mixed strategy, which is a probability distribution over m parallel links, to control the routing of its own assigned traffic. In a Nash equilibrium, each user routes its traffic on links that minimize its expected latency cost. Our structural results provide substantial evidence for the Fully Mixed Nash Equilibrium Conjecture, which states that the worst Nash equilibrium is the fully mixed Nash equilibrium, where each user chooses each link with positive probability. Specifically, we prove that the Fully Mixed Nash Equilibrium Conjecture is valid for pure Nash equilibria and that under a certain condition, the social cost of any Nash equilibrium is within a factor of 6 + ε, of that of the fully mixed Nash equilibrium, assuming that link capacities are identical. Our complexity results include hardness, approximability and inapproximability ones. Here we show, that for identical link capacities and under a certain condition, there is a randomized, polynomial-time algorithm to approximate the worst social cost within a factor arbitrarily close to 6 + ε. Furthermore, we prove that for any arbitrary integer k > 0, it is NP-hard to decide whether or not any given allocation of users to links can be transformed into a pure Nash equilibrium using at most k selfish steps. Assuming identical link capacities, we give a polynomial-time approximation scheme (PTAS) to approximate the best social cost over all pure Nash equilibria. Finally we prove, that it is NP-hard to approximate the worst social cost within a multiplicative factor 2 - 2/m+1 - ε. The quantity 2 - 2/m+1 is the tight upper bound on the ratio of the worst social cost and the optimal cost in the model of identical capacities. © Springer-Verlag Berlin Heidelberg 2003.en
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.titleExtreme Nash equilibriaen
dc.description.endingpage20 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.description.notes<p>Cited By :17</p>en
dc.source.abbreviationLect. Notes Comput. Sci.en
dc.contributor.orcidSpirakis, Paul G. [0000-0001-5396-3749]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record