Sciweavers

350 search results - page 15 / 70
» On Strategy Improvement Algorithms for Simple Stochastic Gam...
Sort
View
AUTOMATICA
2006
140views more  AUTOMATICA 2006»
14 years 9 months ago
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
Vijay Gupta, Timothy H. Chung, Babak Hassibi, Rich...
CG
2002
Springer
14 years 9 months ago
A Comparison of Algorithms for Multi-player Games
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
Nathan R. Sturtevant
FORMATS
2008
Springer
14 years 11 months ago
Timed Parity Games: Complexity and Robustness
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
TCIAIG
2010
14 years 4 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
MST
2011
184views Hardware» more  MST 2011»
14 years 4 months ago
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
Tobias Harks