5995 search results - page 205 / 1199 » Algorithmic Game Theory |
136
click to vote
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
While there is a broad theoretic foundation for creating computational players for two-player games, such as Chess, the multi-player domain is not as well explored. We make an att...
138
click to vote
COLING
1990
15 years 5 months ago
1990
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this article we present a refined summation theory based on Karr's difference field approach. The resulting algorithms find sum representations with optimal nested depth. ...
151
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
138
click to vote
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...