Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm.
Bharat AdsulJugal GargRuta MehtaMilind A. SohoniPublished in: STOC (2011)
Keyphrases
- optimization algorithm
- worst case
- dynamic programming
- times faster
- computational complexity
- learning algorithm
- strongly polynomial
- computational cost
- theoretical analysis
- matching algorithm
- approximation ratio
- significant improvement
- np hard
- search space
- experimental evaluation
- segmentation algorithm
- objective function
- detection algorithm
- polynomial size
- preprocessing
- similarity measure
- convergence rate
- neural network