Capacitated network design games

DOI10.1007/S00224-014-9540-1MaRDI QIDQ904684zbMATH OpenOpenAlexFDO

Authors Michal Feldman, Tom Ron

Publication date 13 January 2016

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-014-9540-1

zbMATH Keywords

game theorycapacityprice of anarchycost sharingprice of stabilitynetwork design games

Mathematics Subject Classification ID

Games involving graphs (91A43)

Recommendations

• Capacitated network design games
• Further results on capacitated network design games
• Capacitated network design games with weighted players
• Near-optimal network design with selfish agents
• Near-optimal network design with selfish agents

Cites work

• scientific article; zbMATH DE number 5764884 (Why is no real title available?)
• scientific article; zbMATH DE number 2038734 (Why is no real title available?)
• A Noncooperative Model of Network Formation
• A class of games possessing pure-strategy Nash equilibria
• Algorithms, games, and the internet
• Avoiding the Braess paradox in non-cooperative networks
• Capacity allocation under noncooperative routing
• Congestion games with linearly independent paths: convergence time and price of anarchy
• Convergence of best-response dynamics in games with conflicting congestion effects
• Efficient graph topologies in network routing games
• How bad is selfish routing?
• Near-optimal network design with selfish agents
• Network structure and strong equilibrium in route selection games.
• Network topology and the efficiency of equilibrium
• On the impact of combinatorial structure on congestion games
• Optimal cost sharing for resource selection games
• Potential games
• Selfish Routing in Capacitated Networks
• Strong equilibrium in congestion games
• Strong equilibrium in cost sharing connection games
• Strong price of anarchy
• The Price of Stability for Network Design with Fair Cost Allocation
• The complexity of pure Nash equilibria
• The price of anarchy is independent of the network topology
• The price of selfish behavior in bilateral network formation
• Topological Conditions for Uniqueness of Equilibrium in Networks
• Worst-case equilibria
• Über ein Paradoxon aus der Verkehrsplanung

Cited in

(3)

• Capacitated network design games with weighted players
• Capacitated network design games
• Further results on capacitated network design games

This page was built for publication: Capacitated network design games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q904684)