533 search results - page 82 / 107 » Playing games with approximation algorithms |
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. A novel algorithm is presented for the 3D reconstruction of human action in long (> 30 second) monocular image sequences.A sequence is represented by a small set of au...
AAAI
2012
11 years 10 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Research on bias in machine learning algorithms has generally been concerned with the impact of bias on predictive accuracy. We believe that there are other factors that should al...