Date of Original Version

7-2004

Type

Conference Proceeding

Abstract or Description

We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary.

DOI

10.1007/b98522

Share

COinS