Nash balanced assignment problem
From MaRDI portal
Publication:6166900
DOI10.1007/978-3-031-18530-4_13zbMath1528.90225MaRDI QIDQ6166900
Minh Hieu Nguyen, Viet Hung Nguyen, Mourad Baïou
Publication date: 3 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
combinatorial optimizationbalanced assignment problemproportional fairnessweighted sum methodproportional-fair scheduling
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The weighted sum method for multi-objective optimization: new insights
- Balanced optimization problems
- Most and least uniform spanning trees
- Fair optimization and networks: a survey
- The Price of Fairness
- Linear Programming on Cray Supercomputers
- Rate control for communication networks: shadow prices, proportional fairness and stability
This page was built for publication: Nash balanced assignment problem