MPI für Informatik / Algorithms and Complexity Group |
|On the price of stability for undirected network design|
|Authors:||Christodoulou, George; Chung, Christine; Ligett, Katrina; Pyrga, Evangelia; van Stee, Rob|
|Place of Publication:||Berlin|
|Date of Publication (YYYY-MM-DD):||2010|
|Title of Proceedings:||Approximation and Online Algorithms : 7th International Workshop, WAOA 2009|
|Title of Series:||Lecture Notes in Computer Science|
|Place of Conference/Meeting:||Copenhagen, Denmark|
|(Start) Date of Conference/Meeting|
|End Date of Conference/Meeting |
|Intended Educational Use:||No|
|Abstract / Description:||We continue the study of the effects of selfish behavior in the|
network design problem.
We provide new bounds for the price of stability for network design with
fair cost allocation for undirected graphs. We consider the most general
case, for which the best known upper bound is the Harmonic number
$H_n$, where $n$ is the number of agents,
and the best previously known lower bound is $12/7\approx1.778$.
We present a nontrivial lower bound of $42/23\approx1.8261$.
we show that for two players, the price of stability is exactly $4/3$, while for
three players it is at least $74/48\approx 1.542$ and at most $1.65$.
These are the first improvements on the bound of $H_n$ for general networks.
In particular, this demonstrates a separation between the price of
stability on undirected graphs and that on directed graphs,
Previously, such a gap was only known for the cases where all players
have a shared source, and for weighted players.
|Last Change of the Resource (YYYY-MM-DD):||2010-12-17|
|External Publication Status:||published|
|Communicated by:||Kurt Mehlhorn|
|Affiliations:||MPI für Informatik/Algorithms and Complexity Group|
|You have privileges to view the following file(s):|
|networkpos.dvi [73,00 Kb] [Comment:file from upload service] |