Equitable cost allocations via primal-dual-type algorithms

DOI10.1145/509907.509956MaRDI QIDQ3579183zbMATH OpenOpenAlexFDO

Authors

Publication date 5 August 2010

Published in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/509907.509956

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Cited in

(6)

• Efficient cost-sharing mechanisms for prize-collecting problems
• Eisenberg-Gale markets: algorithms and game-theoretic properties
• Cost allocation and strategyproof mechanism for cover-set games
• New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
• From cost sharing mechanisms to online selection problems
• Theory of principal partitions revisited

This page was built for publication: Equitable cost allocations via primal-dual-type algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579183)