A cost-sharing scheme for the \(k\)-product facility location game with penalties

DOI10.1007/978-3-031-49193-1_23MaRDI QIDQ6591647

Xiao-Wei Li, Xi-wen Lu

Publication date: 22 August 2024

zbMATH Keywords

facility location gamecompetitiveapproximate cost recoverycross-monotoniccost-sharing scheme

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Strategy-proof approximation mechanisms for an obnoxious facility game on networks
• A cost-sharing method for an uncapacitated facility location game with penalties
• A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
• A cost-sharing scheme for the \(k\)-level facility location game with penalties
• Strategyproof mechanisms for \(2\)-facility location games with minimax envy
• Facility location games with optional preference
• A \(k\)-product uncapacitated facility location problem
• The \(k\)-level facility location game
• LP-Based Algorithms for Capacitated Facility Location
• Strategy-Proof Mechanism for Obnoxious Facility Location on a Line
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Greedy Strikes Back: Improved Facility Location Algorithms
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
• Limitations of cross-monotonic cost-sharing schemes
• Local search heuristic for k-median and facility location problems
• Strategyproof sharing of submodular costs: budget balance versus efficiency

This page was built for publication: A cost-sharing scheme for the \(k\)-product facility location game with penalties