107 search results - page 14 / 22 » When Random Play is Optimal Against an Adversary |
97
Voted
AAMAS
2007
Springer
15 years 17 days ago
2007
Springer
We consider a repeated Prisoner’s Dilemma game where two independent learning agents play against each other. We assume that the players can observe each others’ action but ar...
100
Voted
STOC
2004
ACM
16 years 22 days ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
105
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
117
Voted
ALGORITHMICA
2011
14 years 7 months ago
2011
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct comp...
105
Voted
IWSEC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract—Password-authenticated key exchange (PAKE) protocols are designed to be secure even when the secret key used for authentication is a human-memorable password. In this pa...