Sciweavers

374 search results - page 29 / 75
» Generalized Nash equilibrium problems
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 28 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
ICML
2003
IEEE
14 years 8 months ago
AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Oppon
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...
Vincent Conitzer, Tuomas Sandholm
CORR
2008
Springer
174views Education» more  CORR 2008»
13 years 7 months ago
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan R...
WICON
2008
13 years 9 months ago
Game-based admission control for wireless systems
Much previous work has examined the wireless power control problem using tools from game theory, an economic concept which describes the behavior of interdependent but non-coopera...
Benjamin Yolken, Nicholas Bambos
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
14 years 8 months ago
On the convergence of regret minimization dynamics in concave games
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
Eyal Even-Dar, Yishay Mansour, Uri Nadav