Fast-converging tatonnement algorithms for one-time and ongoing market problems.
Richard ColeLisa FleischerPublished in: STOC (2008)
Keyphrases
- optimization problems
- test problems
- np hard problems
- learning algorithm
- data structure
- computational problems
- approximate solutions
- difficult problems
- benchmark problems
- run times
- solution quality
- times faster
- computational complexity
- benchmark datasets
- orders of magnitude
- related problems
- inference problems
- hard problems
- problems in computer vision
- machine learning
- exact and approximate
- computational cost
- theoretical guarantees
- computational geometry
- np complete
- computationally efficient
- computational efficiency
- combinatorial optimization