Sciweavers

169 search results - page 11 / 34
» Optimal Strategies in Priced Timed Game Automata
Sort
View
EOR
2006
50views more  EOR 2006»
13 years 7 months ago
Optimal product rollover strategies
As product life cycles shortened, many firms introduce new products and phase out old products frequently. To plan for a successful product rollover; i.e., introduce a new product...
Wei Shi Lim, Christopher S. Tang
TACAS
2005
Springer
129views Algorithms» more  TACAS 2005»
14 years 1 months ago
A New Algorithm for Strategy Synthesis in LTL Games
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
Aidan Harding, Mark Ryan, Pierre-Yves Schobbens
IJFCS
2008
158views more  IJFCS 2008»
13 years 7 months ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
LICS
1997
IEEE
13 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...