Non-Cooperative Tree Creation |
| |
Authors: | Martin Hoefer |
| |
Affiliation: | (1) Department of Computer & Information Science, Konstanz University, Box D 67, 78457 Konstanz, Germany |
| |
Abstract: | In this paper we consider the connection game, a simple network design game with independent selfish agents that was introduced by Anshelevich et al. (Proc. 35th Ann.
ACM Symp. Theo. Comp. (STOC), pp. 511–520, 2003). Our study concerns an important subclass of tree games, in which every feasible network is guaranteed to be connected. It generalizes the class of single-source games considered
by Anshelevich et al. We focus on the existence, quality, and computability of pure-strategy exact and approximate Nash equilibria.
For tree connection games, in which every player holds two terminals, we show that there is a Nash equilibrium as cheap as
the optimum network. In contrast, for single-source games, in which every player has at most three terminals, the price of
stability is at least k−2, and it is
-complete to decide the existence of a Nash equilibrium. Hence, we propose polynomial time algorithms for computing approximate
Nash equilibria, which provide relaxed stability and cost efficiency guarantees. For the case of two terminals per player,
there is an algorithm to find a (2+ε,1.55)-approximate Nash equilibrium. It can be generalized to an algorithm to find a (3.1+ε,1.55)-approximate Nash equilibrium for general tree connection games. This improves the guarantee of the only previous algorithm
for the problem, which returns a (4.65+ε,1.55)-approximate Nash equilibrium. Tightness results for the analysis of all algorithms are derived. Our algorithms use
a novel iteration technique for trees that might be of independent interest.
This work has appeared in part as an extended abstract at the 31st Symposium on Mathematical Foundations of Computer Science
(MFCS 2006) and the 17th International Symposium on Algorithms and Computation (ISAAC 2006).
Supported by DFG Research Training Group 1042 “Explorative Analysis and Visualization of Large Information Spaces”. |
| |
Keywords: | Network design Approximate Nash equilibrium Steiner tree Price of anarchy Connection game |
本文献已被 SpringerLink 等数据库收录! |
|