Non-cooperative capacitated facility location games

DOI10.1016/j.ipl.2016.09.001zbMath1390.91070OpenAlexW2519982165MaRDI QIDQ318924

Eduardo Candido Xavier, Félix Carvalho Rodrigues

Publication date: 6 October 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.09.001

zbMATH Keywords

facility locationgraph algorithmstheory of computationprice of anarchyalgorithmic game theory

Mathematics Subject Classification ID

Games involving graphs (91A43) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Cross-monotonic cost sharing methods for connected facility location games
• Non-cooperative facility location and covering games
• Non-cooperative tree creation
• Competitive facility location: the Voronoi game
• The \(k\)-level facility location game
• The curse of simultaneity
• Some Anomalies of Farsighted Strategic Behavior
• Further Results on Capacitated Network Design Games
• Essentials of Game Theory: A Concise Multidisciplinary Introduction
• Improved Bounds for Facility Location Games with Fair Cost Allocation
• Competitive facility location models
• Cooperative facility location games
• Capacitated Network Design Games
• Competitive Location Models: A Framework and Bibliography
• Algorithmic Game Theory
• The network equilibrium problem in integers

This page was built for publication: Non-cooperative capacitated facility location games