205 search results - page 20 / 41 » When Can Limited Randomness Be Used in Repeated Games |
83
Voted
ICML
2003
IEEE
16 years 1 months ago
2003
IEEE
A satisfactory multiagent learning algorithm should, at a minimum, learn to play optimally against stationary opponents and converge to a Nash equilibrium in self-play. The algori...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We use a generalization of the Lindeberg principle developed by Sourav Chatterjee to prove universality properties for various problems in communications, statistical learning and...
110
click to vote
ASPLOS
2011
ACM
14 years 4 months ago
2011
ACM
Trace-based compilation is a promising technique for language compilers and binary translators. It offers the potential to expand the compilation scopes that have traditionally be...
CORR
2007
Springer
15 years 20 days ago
2007
Springer
—Situations in many fields of research, such as digital communications, nuclear physics and mathematical finance, can be modelled with random matrices. When the matrices get la...
88
Voted
AC
2003
Springer
15 years 6 months ago
2003
Springer
We suggest that a combination of randomization and gossip communication can be used to overcome scalability barriers that limit the utility of many technologies for distributed sys...