1653 search results - page 131 / 331 » Computer science and game theory |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic g...
ICYCS
2008
IEEE
15 years 4 months ago
2008
IEEE
With the rapid development of computer science, its education mode also changes a lot. Teaching and learning are not restricted by the physical distance with the help of the netwo...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...