356 search results - page 56 / 72 » Graph Games on Ordinals |
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
This paper addresses the issue of emergence of robust cooperation among self-interested agents interacting in N-player social dilemma games. A series of graphs are created each ex...
102
click to vote
FOCS
2009
IEEE
15 years 6 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...
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
142
click to vote
CPM
2004
Springer
15 years 5 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
JAL
2006
14 years 12 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...