3274 search results - page 352 / 655 » Communication strategies in games |
148
click to vote
ICML
2003
IEEE
16 years 7 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...
161
click to vote
CHI
2010
ACM
15 years 11 months ago
2010
ACM
A group of friends visiting a crowded and noisy music festival is an example of a situation where knowing the location of other people is important, but where external factors, su...
170
click to vote
RSA
1998
15 years 6 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
165
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper studies connectivity maintenance of robotic networks that communicate at discrete times and move in continuous space. We propose a distributed algorithm that allows ...
186
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Channel allocation was extensively studied in the framework of cellular networks. But the emergence of new system concepts, such as cognitive radio systems, has brought this to...