2 search results - page 1 / 1 » Achieving symmetric Pareto Nash equilibria using biased repl... |
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
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...