Non-cooperative capacitated facility location games
From MaRDI portal
Publication:318924
DOI10.1016/J.IPL.2016.09.001zbMATH Open1390.91070OpenAlexW2519982165MaRDI QIDQ318924FDOQ318924
Eduardo C. 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
Graph algorithms (graph-theoretic aspects) (05C85) Games involving graphs (91A43) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Algorithmic Game Theory
- Cooperative facility location games
- Competitive Location Models: A Framework and Bibliography
- Competitive facility location models
- The \(k\)-level facility location game
- The network equilibrium problem in integers
- Non-cooperative tree creation
- Competitive facility location: the Voronoi 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
- Capacitated Network Design Games
- Cross-monotonic cost sharing methods for connected facility location games
- Non-cooperative facility location and covering games
Cited In (5)
- Non-cooperative Facility Location and Covering Games
- Facility Location Situations and Related Games in Cooperation
- Cooperative games in facility location situations with regional fixed costs
- Constrained heterogeneous facility location games with max-variant cost
- Capacity allocation games without an initial sequence
This page was built for publication: Non-cooperative capacitated facility location games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q318924)