3504 search results - page 14 / 701 » Computational Aspects of Equilibria |
WINE
2007
Springer
14 years 2 months ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
CCS
2008
ACM
13 years 10 months ago
2008
ACM
A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact...
AAAI
2006
13 years 10 months ago
2006
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
SOFSEM
2009
Springer
14 years 5 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
PODC
2003
ACM
14 years 1 months ago
2003
ACM
We introduce a novel game that models the creation of Internet-like networks by selfish node-agents without central design or coordination. Nodes pay for the links that they esta...