Price of stability in survivable network design
From MaRDI portal
Publication:647493
DOI10.1007/s00224-011-9317-8zbMath1232.91077OpenAlexW4242368297MaRDI QIDQ647493
Bugra Caskurlu, Elliot Anshelevich
Publication date: 23 November 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9317-8
Nash equilibriumsurvivable network designalgorithmic game theoryprice of stabilitynetwork formation gamesconnection game
Network design and communication in computer systems (68M10) Games involving graphs (91A43) Applications of game theory (91A80) Deterministic network models in operations research (90B10)
Related Items
Strategic cooperation in cost sharing games, Unnamed Item, Strategic multiway cut and multicut games, Resource buying games, Efficient Black-Box Reductions for Separable Cost Sharing
Cites Work
- Unnamed Item
- Unnamed Item
- Strategic network formation through peering and service agreements
- Network design with weighted players
- Strong equilibrium in cost sharing connection games
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Strong equilibrium in congestion games
- Potential games
- On a network creation game
- The Price of Stability for Network Design with Fair Cost Allocation
- Network games
- Near-optimal network design with selfish agents
- On nash equilibria for a network creation game
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- Exact and Approximate Equilibria for Optimal Group Network Formation
- Applications of approximation algorithms to cooperative games
- Algorithmic Game Theory
- Non-cooperative Facility Location and Covering Games
- Algorithms – ESA 2005
- Efficiency Loss in a Network Resource Allocation Game
- Computing and Combinatorics
- Non-cooperative Tree Creation
- Sharing the cost of multicast transmissions
