Sciweavers

179 search results - page 28 / 36
» On Learning Algorithms for Nash Equilibria
Sort
View
ATAL
2003
Springer
15 years 2 months 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...
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
15 years 9 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
CCS
2009
ACM
15 years 4 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...
ATAL
2003
Springer
15 years 2 months ago
Coordination in multiagent reinforcement learning: a Bayesian approach
Much emphasis in multiagent reinforcement learning (MARL) research is placed on ensuring that MARL algorithms (eventually) converge to desirable equilibria. As in standard reinfor...
Georgios Chalkiadakis, Craig Boutilier
WINE
2009
Springer
138views Economy» more  WINE 2009»
15 years 4 months ago
On the Impact of Strategy and Utility Structures on Congestion-Averse Games
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...
Thomas Voice, Maria Polukarov, Andrew Byde, Nichol...