Sciweavers

11 search results - page 2 / 3
» Learning equilibria in repeated congestion games
Sort
View
MOBIHOC
2012
ACM
11 years 8 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
CDC
2009
IEEE
178views Control Systems» more  CDC 2009»
13 years 10 months ago
Distributed coverage games for mobile visual sensors (I): Reaching the set of Nash equilibria
— We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while mini...
Minghui Zhu, Sonia Martínez
MOBIHOC
2004
ACM
13 years 11 months ago
Market sharing games applied to content distribution in ad-hoc networks
In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum. In this paper we propose an architec...
Michel X. Goemans, Erran L. Li, Vahab S. Mirrokni,...
ATAL
2004
Springer
13 years 11 months ago
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
We present GAMUT1 , a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationshi...
Eugene Nudelman, Jennifer Wortman, Yoav Shoham, Ke...
ICML
2003
IEEE
14 years 6 months ago
Learning To Cooperate in a Social Dilemma: A Satisficing Approach to Bargaining
Learning in many multi-agent settings is inherently repeated play. This calls into question the naive application of single play Nash equilibria in multi-agent learning and sugges...
Jeff L. Stimpson, Michael A. Goodrich