A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget.
Rodrigo A. VelezPublished in: CoRR (2020)
Keyphrases
- learning algorithm
- np hard
- optimal solution
- convex hull
- k means
- cost function
- optimization algorithm
- weighted average
- linear programming
- worst case
- computational efficiency
- computational complexity
- neural network
- simulated annealing
- computationally efficient
- combinatorial optimization
- knapsack problem
- solution quality