Sciweavers

107 search results - page 1 / 22
» When Random Play is Optimal Against an Adversary
Sort
View
COLT
2008
Springer
14 years 16 days ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 5 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
CISS
2007
IEEE
14 years 5 months ago
Towards Optimal Design of Data Hiding Algorithms Against Nonparametric Adversary Models
Abstract—This paper presents a novel zero-sum watermarking game between a detection algorithm and a data hiding adversary. Contrary to previous research, the detection algorithm ...
Alvaro A. Cárdenas, George V. Moustakides, ...
EUROCRYPT
2001
Springer
14 years 3 months ago
Identification Protocols Secure against Reset Attacks
Abstract. We provide identi£cation protocols that are secure even when the adversary can reset the internal state and/or randomization source of the user identifying itself, and w...
Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Si...
COLT
2010
Springer
13 years 8 months ago
Convex Games in Banach Spaces
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
Karthik Sridharan, Ambuj Tewari