A cost-sharing method for an uncapacitated facility location game with penalties
From MaRDI portal
Publication:488891
DOI10.1007/s11424-012-9067-yzbMath1307.91108OpenAlexW2153048160MaRDI QIDQ488891
Publication date: 27 January 2015
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-012-9067-y
Applications of game theory (91A80) Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (1)
Cites Work
- Unnamed Item
- Approximation algorithm for facility location with service installation costs
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- Soft-capacitated facility location game
- The \(k\)-level facility location game
- Approximating the two-level facility location problem via a quasi-greedy approach
- Approximation Algorithms for Metric Facility Location Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- The Online Median Problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Strategyproof sharing of submodular costs: budget balance versus efficiency
This page was built for publication: A cost-sharing method for an uncapacitated facility location game with penalties