294 search results - page 58 / 59 » The complexity of computing a Nash equilibrium |
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
JCC
2008
14 years 9 months ago
2008
Abstract: Molecular dynamics simulations of the RN24 peptide, which includes a diverse set of structurally heterogeneous states, are carried out in explicit solvent. Two approaches...
103
Voted
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
CLOUD
2010
ACM
15 years 2 months ago
2010
ACM
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
HICSS
2002
IEEE
15 years 2 months ago
2002
IEEE
It is apparent that perturbations of the North American electric power grid follow the patterns and characteristics of Self Organized Critical (SOC) systems. Published studies sho...