594 search results - page 37 / 119 » Games with Secure Equilibria |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
MOBIHOC
2004
ACM
14 years 1 months ago
2004
ACM
In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum. In this paper we propose an architec...
SIGECOM
2011
ACM
12 years 10 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
ACSAC
2003
IEEE
14 years 1 months ago
2003
IEEE
The emergence of online games has fundamentally changed security requirements for computer games, which previously were largely concerned with copy protection. In this paper, we e...
ASP
2001
Springer
14 years 8 days ago
2001
Springer
In this paper we present a framework for logic programming agents to take part in games in such a way that stable models of the system, the ones agreed upon by all the members, co...