107 search results - page 10 / 22 » When Random Play is Optimal Against an Adversary |
106
Voted
IPCO
2010
15 years 1 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
140
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract--Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often ...
107
click to vote
INFOCOM
2011
IEEE
14 years 4 months ago
2011
IEEE
User association logs collected from a large-scale wireless LAN record where and when a user has used the network. Such information plays an important role in wireless network res...
115
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Future agent applications will increasingly represent human users autonomously or semi-autonomously in strategic interactions with similar entities. Hence, there is a growing need...
118
click to vote
IPTPS
2003
Springer
15 years 5 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...