Nonatomic non-cooperative neighbourhood balancing games

DOI10.3233/fi-242181MaRDI QIDQ6614537

J. Cohen, David Auger, Antoine Lobstein

Publication date: 7 October 2024

Published in: Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

Nash equilibriumgraph theoryneighbourhood balancing games

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Voronoi game on graphs
• Tradeoffs in worst-case equilibria
• A class of games possessing pure-strategy Nash equilibria
• On the Price of Anarchy of Highly Congested Nonatomic Network Games
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• Optimal Coordination Mechanisms for Multi-job Scheduling Games
• Intrinsic Robustness of the Price of Anarchy
• How bad is selfish routing?
• Nash Equilibria in Voronoi Games on Graphs
• Tight Bounds for Selfish and Greedy Load Balancing
• Non-clairvoyant Scheduling Games
• Selfishness Need Not Be Bad
• When is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic
• Algorithmic Game Theory
• Automata, Languages and Programming
• Algorithms – ESA 2005
• Über ein Paradoxon aus der Verkehrsplanung
• Equilibrium points in n -person games
• The price of anarchy is independent of the network topology
• Computing Nash equilibria for scheduling on restricted parallel links

This page was built for publication: Nonatomic non-cooperative neighbourhood balancing games