Sciweavers

1447 search results - page 4 / 290
» Graphs and Path Equilibria
Sort
View
INFOCOM
2003
IEEE
13 years 10 months ago
Nash equilibria of a generic networking game with applications to circuit-switched networks
— A generic mechanism for end-user transmission rate control into a differentiated services Internet is formulated and basic results of corresponding Nash equilibria are proved. ...
Youngmi Jin, George Kesidis
JGAA
2007
123views more  JGAA 2007»
13 years 5 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
TAMC
2010
Springer
13 years 10 months ago
The Max k-Cut Game and Its Strong Equilibria
An instance of the max k−cut game is an edge weighted graph. Every
Laurent Gourvès, Jérôme Monnot
WINE
2005
Springer
122views Economy» more  WINE 2005»
13 years 10 months ago
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
Ning Chen, Atri Rudra