Sciweavers

179 search results - page 19 / 36
» On Learning Algorithms for Nash Equilibria
Sort
View
JSAC
2010
138views more  JSAC 2010»
14 years 10 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar
ATAL
2008
Springer
15 years 1 months ago
Stochastic search methods for nash equilibrium approximation in simulation-based games
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
Yevgeniy Vorobeychik, Michael P. Wellman
TIT
2008
121views more  TIT 2008»
14 years 11 months ago
Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels
This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. T...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
EVOW
2010
Springer
15 years 4 months ago
Social Learning Algorithms Reaching Nash Equilibrium in Symmetric Cournot Games
Mattheos K. Protopapas, Francesco P. Battaglia, El...
AI
2006
Springer
15 years 3 months ago
Satisfaction Equilibrium: Achieving Cooperation in Incomplete Information Games
So far, most equilibrium concepts in game theory require that the rewards and actions of the other agents are known and/or observed by all agents. However, in real life problems, a...
Stéphane Ross, Brahim Chaib-draa