904 search results - page 149 / 181 » Game Theory |
135
Voted
PODC
2009
ACM
16 years 1 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
132
Voted
COCO
1994
Springer
15 years 4 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
93
Voted
HRI
2009
ACM
15 years 7 months ago
2009
ACM
As robots become more pervasive, operators will develop richer relationships with them. In a 2 (robot form: humanoid vs. car) x 2 (assembler: self vs. other) between-participants ...
115
Voted
CSL
2007
Springer
15 years 7 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
106
Voted
DIGRA
2005
Springer
15 years 6 months ago
2005
Springer
An examination of the contributions that can be made by the field of non-mechanistic cybernetics (as elaborated by Gregory Bateson and Anthony Wilden) to a theory of videogames th...