Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proceedings of the twenty-second annual symposium on Principles of distributed computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Efficiency Loss in a Network Resource Allocation Game
Mathematics of Operations Research
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Non-cooperative multicast and facility location games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Network design with weighted players
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Strategic Network Formation through Peering and Service Agreements
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Strong equilibrium in cost sharing connection games
Proceedings of the 8th ACM conference on Electronic commerce
Algorithmic Game Theory
An O( lognloglogn) upper bound on the price of stability for undirected Shapley network design games
Information Processing Letters
On the price of anarchy and stability of correlated equilibria of linear congestion games,,
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Geometric network design with selfish agents
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the price of stability for designing undirected networks with fair cost allocations
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Non-cooperative facility location and covering games
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Strategic multiway cut and multicut games
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Improved bounds on the price of stability in network cost sharing games
Proceedings of the fourteenth ACM conference on Electronic commerce
Hi-index | 0.00 |
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [4]. In this model, players attempt to connect to a common source node in a network by purchasing edges, and sharing their costs with other players. We introduce the survivable version of this game, where each player desires 2 edge-disjoint connections between her pair of nodes instead of just a single connecting path, and analyze the quality of exact and approximate Nash equilibria. For the special case where each node represents a player, we show that Nash equilibria are guaranteed to exist and price of stability is 1. For the general version of the Survivable Connection Game, we show that there always exists a 2-approximate Nash equilibrium that is as cheap as the socially optimal solution.