Sciweavers

1683 search results - page 140 / 337
» Game Theory Basics
Sort
View
FORMATS
2008
Springer
15 years 6 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
AIA
2006
15 years 6 months ago
Some Semantics for a Logical Language for the Game of Dominoes
Epistemic logic allows to reason not only about situations, but also about the knowledge that a set of agents have about situations. In later years, epistemic logic has been appli...
Fernando R. Velázquez-Quesada, Francisco He...
187
Voted
FSTTCS
2010
Springer
15 years 2 months ago
One-Counter Stochastic Games
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...
Tomás Brázdil, Václav Brozek,...
164
Voted
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
ATAL
2008
Springer
15 years 6 months ago
GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...
Andrew Gilpin, Tuomas Sandholm, Troels Bjerre S&os...