5995 search results - page 109 / 1199 » Algorithmic Game Theory |
106
Voted
CSL
2004
Springer
15 years 9 months ago
2004
Springer
We present a novel third-order theory W1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol...
122
Voted
JIIS
2008
15 years 3 months ago
2008
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
92
Voted
JMLR
2011
14 years 10 months ago
2011
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
146
Voted
AGI
2011
14 years 7 months ago
2011
General Game Playing (GGP) contest provides a research framework suitable for developing and testing AGI approaches in game domain. In this paper, we propose a new modification of...
142
Voted
COLT
2005
Springer
15 years 5 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...