52 search results - page 2 / 11 » Approximate Convex Optimization by Online Game Playing |
ICML
2003
IEEE
14 years 6 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
CDC
2010
IEEE
13 years 10 days ago
2010
IEEE
Potential games are a special class of games that admit tractable static and dynamic analysis. Intuitively, games that are "close" to a potential game should enjoy somewh...
CROSSROADS
2007
13 years 5 months ago
2007
We analyze the complexity of the popular PlayStation 2 game, Katamari Damacy. In particular, we prove that playing Katamari Damacy optimally is NP-hard and that it cannot be appro...
KDD
2009
ACM
14 years 2 days ago
2009
ACM
Human computation is an effective way to channel human effort spent playing games to solving computational problems that are easy for humans but difficult for computers to autom...