594 search results - page 11 / 119 » Games with Secure Equilibria |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
A bimatrix game (A, B) is called a game of rank k if the rank of the matrix A + B is at most k. We consider the problem of enumerating the Nash equilibria in
INFOCOM
2003
IEEE
14 years 29 days 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. ...
IJCAI
2003
13 years 9 months ago
2003
We describe algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorithms...
TCS
2010
13 years 6 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
CSE
2009
IEEE
14 years 2 months ago
2009
IEEE
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...