Sciweavers

234 search results - page 39 / 47
» A polynomial-time nash equilibrium algorithm for repeated ga...
Sort
View
ATAL
2007
Springer
15 years 3 months ago
Regret based dynamics: convergence in weakly acyclic games
Regret based algorithms have been proposed to control a wide variety of multi-agent systems. The appeal of regretbased algorithms is that (1) these algorithms are easily implement...
Jason R. Marden, Gürdal Arslan, Jeff S. Shamm...
CORR
2006
Springer
175views Education» more  CORR 2006»
14 years 9 months ago
Adaptive Channel Allocation Spectrum Etiquette for Cognitive Radio Networks
Abstract-- In this work, we propose a game theoretic framework to analyze the behavior of cognitive radios for distributed adaptive channel allocation. We define two different obje...
Nie Nie, Cristina Comaniciu
SIGECOM
2010
ACM
128views ECommerce» more  SIGECOM 2010»
14 years 10 months ago
Equilibria of plurality voting with abstentions
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...
Yvo Desmedt, Edith Elkind
MOBIHOC
2007
ACM
15 years 9 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
ICML
2004
IEEE
15 years 10 months ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm