6 search results - page 1 / 2 » Almost Optimal Strategies in One Clock Priced Timed Games |
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
We consider timed games extended with cost information, and prove computability of the optimal cost and of -optimal memoryless strategies in timed games with one clock. In contrast...
CORR
2012
Springer
12 years 9 days 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...
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a st...
SAGT
2009
Springer
13 years 11 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
FOCS
2008
IEEE
13 years 4 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...