1447 search results - page 4 / 290 » Graphs and Path Equilibria |
116
click to vote
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
— 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. ...
159
Voted
JGAA
2007
15 years 4 months ago
2007
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. ...
161
click to vote
TAMC
2010
Springer
15 years 10 months ago
2010
Springer
An instance of the max k−cut game is an edge weighted graph. Every
92
Voted
ICRA
1994
IEEE
15 years 9 months ago
1994
IEEE
136
click to vote
WINE
2005
Springer
15 years 10 months ago
2005
Springer
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 ...