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...
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...
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...
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...
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...