5995 search results - page 138 / 1199 » Algorithmic Game Theory |
114
Voted
CIE
2010
Springer
15 years 7 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
124
Voted
CIMCA
2008
IEEE
15 years 10 months ago
2008
IEEE
We introduce a language for the representation of a subset of strategic interactions. The representation is based on petri nets. Representable games are restricted to have a fini...
107
Voted
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
167
Voted
IAT
2010
IEEE
15 years 1 months ago
2010
IEEE
We utilize evolutionary game theory to study the evolution of cooperative societies and the behaviors of individual agents (i.e., players) in such societies. We present a novel pla...
135
Voted
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...