Sciweavers

5995 search results - page 262 / 1199
» Algorithmic Game Theory
Sort
View
SOSP
2005
ACM
16 years 3 months ago
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...
DIMACS
1996
15 years 8 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
TCIAIG
2010
15 years 1 months ago
The Design of Puzzle Selection Strategies for ESP-Like GWAP Systems
The `Games With A Purpose' (GWAP) genre is a type of `Human Computation' that outsources certain steps of the computational process to humans. Although most GWAP studies ...
Ling-Jyh Chen, Bo-Chun Wang, Wen-Yuan Zhu
ATAL
2004
Springer
16 years 2 days ago
Best-Response Multiagent Learning in Non-Stationary Environments
This paper investigates a relatively new direction in Multiagent Reinforcement Learning. Most multiagent learning techniques focus on Nash equilibria as elements of both the learn...
Michael Weinberg, Jeffrey S. Rosenschein
SODA
2010
ACM
232views Algorithms» more  SODA 2010»
16 years 4 months ago
On the Optimality of Spiral Search
Searching for a point in the plane is a well-known search game problem introduced in the early eigthies. The best known search strategy is given by a spiral and achieves a competi...
Elmar Langetepe