Sciweavers

1380 search results - page 6 / 276
» Computing the optimal strategy to commit to
Sort
View
AAAI
2008
13 years 10 months ago
Finding State Similarities for Faster Planning
In many planning applications one can find actions with overlapping effects. If for optimally reaching the goal all that matters is within this overlap, there is no need to consid...
Christian Fritz
AAAI
2008
13 years 10 months ago
Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
NOSSDAV
2005
Springer
14 years 1 months ago
Mitigating information exposure to cheaters in real-time strategy games
Cheating in on-line games is a prevalent problem for both game makers and players. The popular real-time strategy game genre is especially vulnerable to cheats, as it is frequentl...
Chris Chambers, Wu-chang Feng, Wu-chi Feng, Debanj...
FUIN
2006
106views more  FUIN 2006»
13 years 7 months ago
Architectural Principles and Scheduling Strategies for Computing Agent Systems
The paper introduces the formal description of a computing multi-agent system (MAS), its architecture and dynamics (sections 2
Marek Grochowski, Robert Schaefer, Maciej Smolka