Exact and approximate equilibria for optimal group network formation

DOI10.1016/j.tcs.2011.05.049zbMath1237.91048MaRDI QIDQ719269

Elliot Anshelevich, Bugra Caskurlu

Publication date: 10 October 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.049

zbMATH Keywords

Nash equilibrium; algorithmic game theory; price of stability; network formation games; group network formation

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

91A43: Games involving graphs

91A40: Other game-theoretic models

Related Items

Unnamed Item, Efficient Black-Box Reductions for Separable Cost Sharing, Resource buying games, Strategic cooperation in cost sharing games, Strategic multiway cut and multicut games, Geometric spanner games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Network design with weighted players
• Strong equilibrium in cost sharing connection games
• Non-cooperative tree creation
• Strong equilibrium in congestion games
• An improved LP-based approximation for steiner tree
• The Price of Stability for Network Design with Fair Cost Allocation
• On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
• Exact and Approximate Equilibria for Optimal Group Network Formation
• Price of Stability in Survivable Network Design
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• Intrinsic robustness of the price of anarchy
• Algorithmic Game Theory
• Non-cooperative Facility Location and Covering Games
• Algorithms – ESA 2005
• Computing and Combinatorics