Sciweavers

49 search results - page 1 / 10
» Approachability of Convex Sets in Games with Partial Monitor...
Sort
View
CORR
2011
Springer
194views Education» more  CORR 2011»
12 years 11 months ago
Approachability of Convex Sets in Games with Partial Monitoring
We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e. where players do not observe their opponents’ mo...
Vianney Perchet
CORR
2010
Springer
132views Education» more  CORR 2010»
13 years 4 months ago
Calibration and Internal no-Regret with Partial Monitoring
Calibrated strategies can be obtained by performing strategies that have no internal regret in some auxiliary game. Such strategies can be constructed explicitly with the use of B...
Vianney Perchet
ORDER
2007
95views more  ORDER 2007»
13 years 4 months ago
A Half-Space Approach to Order Dimension
The aim of the present paper is to investigate the half-spaces in the convexity structure of all quasiorders on a given set and to use them in an alternative approach to the dimens...
Stephan Foldes, Jenö Szigeti
JMLR
2010
103views more  JMLR 2010»
12 years 11 months ago
Regret Bounds and Minimax Policies under Partial Monitoring
This work deals with four classical prediction settings, namely full information, bandit, label efficient and bandit label efficient as well as four different notions of regret: p...
Jean-Yves Audibert, Sébastien Bubeck
SIAMCO
2002
89views more  SIAMCO 2002»
13 years 4 months ago
Convexity in Zero-Sum Differential Games
A new approach to two-player zero-sum differential games with convex-concave cost function is presented. It employs the tools of convex and variational analysis. A necessary and s...
Rafal Goebel