Maximin fairness in project budget allocation
type: Item
instance of: scholarly article
title: Maximin fairness in project budget allocation
zbMATH Open document ID: 1358.91072
author: Maurizio Naldi
author: Gaia Nicosia
author: Andrea Pacifici
author: Ulrich Pferschy
publication date: 2017-02-14T00:00:00Z
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 6684441
zbMATH Keywords: knapsack problem
zbMATH Keywords: project management
zbMATH Keywords: multi agent system
zbMATH Keywords: fair allocation
zbMATH Keywords: decision support system
MaRDI profile type: Publication
full work available at URL: j.endm.2016.10.017
OpenAlex ID: W2551894315
cites work: The Price of Fairness
cites work: An exact algorithm for the knapsack sharing problem with common items
cites work: Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
cites work: Competitive subset selection with two agents
DOI: 10.1016/J.ENDM.2016.10.017
Recommended article: On Allocating Goods to Maximize Fairness
Recommended article: An algorithm for identifying fair and optimal allocations
Recommended article: Proportional optimization and fairness
Recommended article: General max-min fair allocation
Recommended article: Fairness Measures for Resource Allocation
Recommended article: Restricted Max-Min Fair Allocation
Recommended article: Fairness and efficiency for allocations with participation constraints
Recommended article: Fairness in Resource Allocation: Foundation and Applications
Recommended article: Fair Allocation with Diminishing Differences
Recommended article: Q3505605
description: scientific article; zbMATH DE number 6684441