7 search results - page 1 / 2 » A Faster Algorithm for Solving One-Clock Priced Timed Games |
CORR
2012
Springer
12 years 6 months ago
2012
Springer
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
FSTTCS
2008
Springer
13 years 12 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
SAGT
2009
Springer
14 years 5 months ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
ATAL
2008
Springer
14 years 26 days ago
2008
Springer
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
GECCO
2003
Springer
14 years 4 months ago
2003
Springer
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...