Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm.
Bhaskar Ray ChaudhuryChristian KroerRuta MehtaTianlong NanPublished in: CoRR (2024)
Keyphrases
- dynamic programming
- np hard
- optimal solution
- preprocessing
- search space
- computationally efficient
- high accuracy
- neural network
- objective function
- linear programming
- greedy algorithms
- greedy algorithm
- times faster
- input data
- learning algorithm
- computational cost
- worst case
- knapsack problem
- k means
- detection algorithm
- optimization algorithm
- significant improvement
- tree structure
- matching algorithm
- cost function
- image sequences
- convergence rate
- data sets
- recognition algorithm
- improved algorithm
- hill climbing
- iterative algorithms
- denoising
- greedy strategy
- algorithm for linear programming