43 search results - page 5 / 9 » Complexity of comparison of influence of players in simple g... |
CHI
2005
ACM
14 years 7 months ago
2005
ACM
We study a collaborative location-based game in which groups of `lions' hunt together on a virtual savannah that is overlaid on an open playing field. The game implements a s...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
ALT
2008
Springer
14 years 4 months ago
2008
Springer
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
SAGT
2010
Springer
13 years 5 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
TCS
2010
13 years 5 months ago
2010
The concept of stigmergy provides a simple framework for interaction and coordination in multi-agent systems. However, determining the global system behavior that will arise from ...