Sciweavers

2464 search results - page 10 / 493
» Efficient learning equilibrium
Sort
View
NIPS
2003
13 years 9 months ago
Learning Near-Pareto-Optimal Conventions in Polynomial Time
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
Xiao Feng Wang, Tuomas Sandholm
ATAL
2003
Springer
14 years 29 days ago
Towards a pareto-optimal solution in general-sum games
Multiagent learning literature has investigated iterated twoplayer games to develop mechanisms that allow agents to learn to converge on Nash Equilibrium strategy profiles. Such ...
Sandip Sen, Stéphane Airiau, Rajatish Mukhe...
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
EJWCN
2010
97views more  EJWCN 2010»
13 years 2 months ago
Pricing in Noncooperative Interference Channels for Improved Energy Efficiency
Abstract--We consider noncooperative energy-efficient resource allocation in the interference channel. Energy-efficiency is achieved when each system pays a price proportional to i...
Zhijiat Chong, Rami Mochaourab, Eduard A. Jorswiec...
CAAN
2007
Springer
13 years 11 months ago
Nonadaptive Selfish Routing with Online Demands
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
Tobias Harks, László A. Végh