Non-cooperative tree creation

DOI10.1007/s00453-007-9014-9zbMath1166.91009OpenAlexW2150126985MaRDI QIDQ1017908

Martin Hoefer

Publication date: 13 May 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9014-9

zbMATH Keywords

network designSteiner treeprice of anarchyapproximate Nash equilibriumconnection geme

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (max. 100)

Non-cooperative capacitated facility location games ⋮ Strategic cooperation in cost sharing games ⋮ Unnamed Item ⋮ Strategic multiway cut and multicut games ⋮ Resource buying games ⋮ Non-cooperative facility location and covering games ⋮ Competitive cost sharing with economies of scale ⋮ Exact and approximate equilibria for optimal group network formation ⋮ Efficient Black-Box Reductions for Separable Cost Sharing

Cites Work

• Unnamed Item
• Unnamed Item
• On a network creation game
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Selfish traffic allocation for server farms
• Near-optimal network design with selfish agents
• On nash equilibria for a network creation game
• A General Approximation Technique for Constrained Forest Problems
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
• The price of selfish behavior in bilateral network formation
• The price of anarchy in network creation games
• Non-cooperative Facility Location and Covering Games
• The steiner problem in graphs
• Selfish Routing in Capacitated Networks
• Computing and Combinatorics
• Non-cooperative Tree Creation

This page was built for publication: Non-cooperative tree creation