1698 search results - page 111 / 340 » Growing Complex Games |
167
click to vote
SIGECOM
2011
ACM
14 years 6 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...
134
Voted
STACS
2001
Springer
15 years 8 months ago
2001
Springer
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
140
click to vote
CSFW
2010
IEEE
15 years 7 months ago
2010
IEEE
Coercion-resistance is one of the most important and intricate security requirements for voting protocols. Several definitions of coercion-resistance have posed in the literature,...
140
Voted
FOCS
2009
IEEE
15 years 10 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...
123
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...