Equitable Cost Allocations via Primal–Dual-Type Algorithms

DOI10.1137/060658448MaRDI QIDQ3614157zbMATH OpenOpenAlexFDO

Authors

Publication date 16 March 2009

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/060658448

zbMATH Keywords

cost sharing methodsfairness in cost sharinggroup strategyproof mechanismopportunity egalitarian methodsubmodular cost functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• An efficient primal-dual algorithm for fair combinatorial optimization problems
• A primal-dual algorithm for computing a cost allocation in the core of economic lot-sizing games
• Cost Allocation Revisited: An Optimality Result
• Optimal cost-based allocations under two-sided preferences
• Optimization implementation and characterization of the equal allocation of nonseparable costs value
• Pricing for fairness
• An Algorithm for the Equipollent Resource Allocation Problem
• Pricing for fairness: distributed resource allocation for multiple objectives
• Cost allocation schemes: An asymptotic approach
• scientific article; zbMATH DE number 3936929

Cited in

(5)

• Implementation of linear cost share equilibrium allocations
• An efficient primal-dual algorithm for fair combinatorial optimization problems
• Cost Allocation Revisited: An Optimality Result
• Bounding the price-of-fair-sharing using knapsack-cover constraints to guide near-optimal cost-recovery algorithms
• Beyond Moulin mechanisms

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 Q3614157)