Sciweavers

1599 search results - page 56 / 320
» Algorithms for Parity Games
Sort
View
ALDT
2009
Springer
207views Algorithms» more  ALDT 2009»
15 years 11 months ago
Anytime Self-play Learning to Satisfy Functional Optimality Criteria
We present an anytime multiagent learning approach to satisfy any given optimality criterion in repeated game self-play. Our approach is opposed to classical learning approaches fo...
Andriy Burkov, Brahim Chaib-draa
AAAI
2006
15 years 6 months ago
Overconfidence or Paranoia? Search in Imperfect-Information Games
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...
Austin Parker, Dana S. Nau, V. S. Subrahmanian
CSE
2009
IEEE
15 years 11 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
Jonathan Widger, Daniel Grosu
QEST
2006
IEEE
15 years 10 months ago
Strategy Improvement for Concurrent Reachability Games
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
HT
2003
ACM
15 years 10 months ago
Paper chase revisited: a real world game meets hypermedia
In this short paper, we present a location aware mobile game which lets users play a paper chase game on a mobile device. By using their physical movement and location in the real...
Susanne Boll, Jens Krösche, Christian Wegener