Exact and approximate equilibria for optimal group network formation
type: Item
instance of: scholarly article
title: Exact and approximate equilibria for optimal group network formation
zbMATH Open document ID: 1237.91048
author: Elliot Anshelevich
author: Bugra Caskurlu
published in: Theoretical Computer Science
publication date: 2011-10-10T00:00:00Z
Mathematics Subject Classification ID: 91A40
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 5955888
zbMATH Keywords: algorithmic game theory
zbMATH Keywords: network formation games
zbMATH Keywords: price of stability
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: group network formation
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.05.049
OpenAlex ID: W2042595763
cites work: Exact and Approximate Equilibria for Optimal Group Network Formation
cites work: Price of Stability in Survivable Network Design
cites work: The Price of Stability for Network Design with Fair Cost Allocation
cites work: Q3002793
cites work: Q3549637
cites work: An improved LP-based approximation for Steiner tree
cites work: Network design with weighted players
cites work: Q3579454
cites work: Algorithms – ESA 2005
cites work: Strong equilibrium in cost sharing connection games
cites work: On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
cites work: Q3002852
cites work: Non-cooperative Facility Location and Covering Games
cites work: Non-cooperative tree creation
cites work: Computing and Combinatorics
cites work: Strong equilibrium in congestion games
cites work: Algorithmic Game Theory
cites work: Intrinsic robustness of the price of anarchy
DOI: 10.1016/J.TCS.2011.05.049
description: scientific article; zbMATH DE number 5955888