Proportional fairness for combinatorial optimization

DOI10.1007/978-3-031-55601-2_20MaRDI QIDQ6547965

Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo

Publication date: 31 May 2024

zbMATH Keywords

combinatorial optimizationNash bargaining solutionbi-objective combinatorial optimizationproportional fairness

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The Min-Max Spanning Tree Problem and some extensions
• Price of fairness for allocating a bounded resource
• The Price of Fairness
• The Bargaining Problem
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Nash balanced assignment problem
• Generalized nash fairness solutions for bi‐objective minimization problems

This page was built for publication: Proportional fairness for combinatorial optimization