The Fair Resource Allocation Problem with Submodular Constraints

DOI10.1287/MOOR.13.1.164MaRDI QIDQ3792482zbMATH OpenOpenAlexFDO

Authors Satoru Fujishige, Naoki Katoh, Tetsuo Ichimori

Publication date 1988

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.13.1.164

zbMATH Keywords

computational complexityfair resource allocationsubmodular constraintssubmodular function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• An algorithm for the fair resource allocation problem with a submodular constraint
• Fair welfare maximization
• Restricted Max-Min Fair Allocation
• scientific article; zbMATH DE number 1302182
• A polynomial algorithm for resourse allocation problems with polymatroid constrains¹

Cited in

(10)

• An algorithm for the fair resource allocation problem with a submodular constraint
• Ergodicity of one-dimensional resource sharing systems.
• Fair cost allocation schemes
• Submodular optimization views on the random assignment problem
• Decision model and analysis for investment interest expense deduction and allocation
• A semiring-based framework for fair resources allocation
• An Algorithm for the Equipollent Resource Allocation Problem
• scientific article; zbMATH DE number 7366679 (Why is no real title available?)
• Utility Design for Distributed Resource Allocation—Part II: Applications to Submodular, Covering, and Supermodular Problems
• A family of incentive-compatible and non-subsidizing optimal resource allocation problems

This page was built for publication: The Fair Resource Allocation Problem with Submodular Constraints

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