Maximin fairness in project budget allocation

DOI10.1016/j.endm.2016.10.017zbMath1358.91072OpenAlexW2551894315MaRDI QIDQ510932

Gaia Nicosia, Maurizio Naldi, Andrea Pacifici, Ulrich Pferschy

Publication date: 14 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.017

zbMATH Keywords

knapsack problemdecision support systemproject managementfair allocationmulti agent system

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Price of fairness for allocating a bounded resource

Cites Work

• Competitive subset selection with two agents
• An exact algorithm for the knapsack sharing problem with common items
• Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
• The Price of Fairness

This page was built for publication: Maximin fairness in project budget allocation