Sciweavers

130 search results - page 5 / 26
» Convergence Time to Nash Equilibria
Sort
View
CORR
2008
Springer
208views Education» more  CORR 2008»
13 years 7 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
NIPS
2003
13 years 8 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
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
14 years 1 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella
JGAA
2007
123views more  JGAA 2007»
13 years 7 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
INFOCOM
2003
IEEE
14 years 19 days ago
Oblivious AQM and Nash Equilibria
—An oblivious Active Queue Management scheme is one which does not differentiate between packets belonging to different flows. In this paper, we study the existence and the qual...
Debojyoti Dutta, Ashish Goel, John S. Heidemann