Sciweavers

1410 search results - page 16 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
185
Voted
ATAL
2011
Springer
14 years 6 months ago
Game theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
Sam Ganzfried, Tuomas Sandholm
181
Voted
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
16 years 28 days ago
Parallel Approximation of Non-interactive Zero-sum Quantum Games
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...
Rahul Jain, John Watrous
ICPP
2009
IEEE
16 years 1 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu
161
Voted
ICALP
2007
Springer
16 years 16 days ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi
189
Voted
ALDT
2009
Springer
207views Algorithms» more  ALDT 2009»
16 years 1 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