294 search results - page 22 / 59 » The complexity of computing a Nash equilibrium |
TRANSCI
2010
14 years 4 months ago
2010
Consider the following game. Given a network with a continuum of users at some origins, suppose that users wish to reach specic destinations, but that they are not indierent to the...
PODC
1995
ACM
15 years 1 months ago
1995
ACM
We show how solution concepts in games such as Nash equilibrium, correlated equilibrium, rationalizability, and sequential equilibrium can be given a uniform definition in terms ...
101
click to vote
WINE
2005
Springer
15 years 3 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
ICTAI
2006
IEEE
15 years 3 months ago
2006
IEEE
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
CONEXT
2007
ACM
15 years 1 months ago
2007
ACM
Within the current Internet, autonomous ISPs implement bilateral agreements, with each ISP establishing agreements that suit its own local objective to maximize its profit. Peerin...