A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation.

Haris Aziz Hervé Moulin Fedor Sandomirskiy

Published in: Oper. Res. Lett. (2020)

Keyphrases

worst case
optimal solution
computational complexity
k means
learning algorithm
pareto optimal
dynamic programming
objective function
computational efficiency
optimization algorithm
cost function
simulated annealing
np hard
search space
shortest path problem
min max
social welfare