Sciweavers

128 search results - page 7 / 26
» Computing optimal strategies to commit to in extensive-form ...
Sort
View
JELIA
2004
Springer
14 years 3 months ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
CONCUR
2007
Springer
14 years 4 months ago
Strategy Logic
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
Krishnendu Chatterjee, Thomas A. Henzinger, Nir Pi...
IJCAI
2003
13 years 11 months ago
Approximating Game-Theoretic Optimal Strategies for Full-scale Poker
The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represe...
Darse Billings, Neil Burch, Aaron Davidson, Robert...
TARK
2009
Springer
14 years 4 months ago
Program equilibria and discounted computation time
Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
Lance Fortnow
ATAL
2009
Springer
14 years 4 months ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
James Pita, Manish Jain, Fernando Ordó&ntil...