Results 1  10
of
1,290
Logloss games with bounded adversaries
, 2014
"... The logloss game, of the form RNML = min P ..."
Online Multiagent Learning against Memory Bounded Adversaries
"... Abstract. The traditional agenda in Multiagent Learning (MAL) has been to develop learners that guarantee convergence to an equilibrium in selfplay or that converge to playing the best response against an opponent using one of a fixed set of known targeted strategies. This paper introduces an algor ..."
Abstract

Cited by 13 (10 self)
 Add to MetaCart
an algorithm called Learn or Exploit for Adversary Induced Markov Decision Process (LoEAIM) that targets optimality against any learning opponent that can be treated as a memory bounded adversary. LoEAIM makes no prior assumptions about the opponent and is tailored to optimally exploit any adversary which
Unconditional Security Against MemoryBounded Adversaries
 In Advances in Cryptology – CRYPTO ’97, Lecture Notes in Computer Science
, 1997
"... We propose a privatekey cryptosystem and a protocol for key agreement by public discussion that are unconditionally secure based on the sole assumption that an adversary's memory capacity is limited. No assumption about her computing power is made. The scenario assumes that a random bit string ..."
Abstract

Cited by 49 (4 self)
 Add to MetaCart
We propose a privatekey cryptosystem and a protocol for key agreement by public discussion that are unconditionally secure based on the sole assumption that an adversary's memory capacity is limited. No assumption about her computing power is made. The scenario assumes that a random bit
Constant Query Locally Decodable Codes against a Computationally Bounded Adversary
"... We consider the problem of Locally Decodable Codes against an adversary that is computationally bounded in terms of running time. Many times the computational limitations of the adversary help in designing better codes. In this paper we prove (using some standard crytographic assumptions) that in th ..."
Abstract
 Add to MetaCart
We consider the problem of Locally Decodable Codes against an adversary that is computationally bounded in terms of running time. Many times the computational limitations of the adversary help in designing better codes. In this paper we prove (using some standard crytographic assumptions
Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries
 In 36th Annual Symposium on Foundations of Computer Science (FOCS’95
, 1995
"... In the game theory literature, there is an intriguing line of research on the problem of playing a repeated matrix game against an adversary whose computational resources are limited in some way. Perhaps the main way in which this research ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
In the game theory literature, there is an intriguing line of research on the problem of playing a repeated matrix game against an adversary whose computational resources are limited in some way. Perhaps the main way in which this research
HyperEncryption against SpaceBounded Adversaries from OnLine Strong Extractors
 In CRYPTO 2002
, 2002
"... We study the problem of informationtheoretically secure encryption in the boundedstorage model introduced by Maurer [10]. The sole assumption of this model is a limited storage bound on an eavesdropper Eve, who is even allowed to be computationally unbounded. Suppose a sender Alice and a receiver ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We study the problem of informationtheoretically secure encryption in the boundedstorage model introduced by Maurer [10]. The sole assumption of this model is a limited storage bound on an eavesdropper Eve, who is even allowed to be computationally unbounded. Suppose a sender Alice and a receiver
The Nonstochastic Multiarmed Bandit Problem
 SIAM JOURNAL OF COMPUTING
, 2002
"... In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the tradeoff between exploration (trying out ..."
Abstract

Cited by 491 (34 self)
 Add to MetaCart
of the process generating the payoffs of the slot machines. We give a solution to the bandit problem in which an adversary, rather than a wellbehaved stochastic process, has complete control over the payoffs. In a sequence of T plays, we prove that the perround payoff of our algorithm approaches
Bounding the diffuse adversary
 In Proceedings of the 9th ACMSIAM Symposium on Discrete Algorithms (SODA ’98
, 1998
"... Koutsoupias and Papadimitriou recently raised the question of how well deterministic online paging algorithms can do against a certain class of adversariallu biased random input> [3]. Such an input is given in an online fashion; the adversary determines the next request probabilistically, subje ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Koutsoupias and Papadimitriou recently raised the question of how well deterministic online paging algorithms can do against a certain class of adversariallu biased random input> [3]. Such an input is given in an online fashion; the adversary determines the next request probabilistically
Quantum Adversary (Upper) Bound
, 2011
"... We propose a method for upper bounding the general adversary bound for certain boolean functions. Due to the the tightness of query complexity and the general adversary bound [5], this gives an upper bound on the quantum query complexity of those functions. We give an example where this upper bound ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We propose a method for upper bounding the general adversary bound for certain boolean functions. Due to the the tightness of query complexity and the general adversary bound [5], this gives an upper bound on the quantum query complexity of those functions. We give an example where this upper bound
Revealing information while preserving privacy
 In PODS
, 2003
"... We examine the tradeoff between privacy and usability of statistical databases. We model a statistical database by an nbit string d1,.., dn, with a query being a subset q ⊆ [n] to be answered by � i∈q di. Our main result is a polynomial reconstruction algorithm of data from noisy (perturbed) subset ..."
Abstract

Cited by 272 (9 self)
 Add to MetaCart
algorithms for statistical databases that preserve privacy while adding perturbation of magnitude Õ(√n). For timeT bounded adversaries we demonstrate a privacypreserving access algorithm whose perturbation magnitude is ≈ √ T. 1
Results 1  10
of
1,290