Symmetric Strategy Improvement

@inproceedings{Schewe2015SymmetricSI,
  title={Symmetric Strategy Improvement},
  author={Sven Schewe and Ashutosh Trivedi and Thomas Varghese},
  booktitle={ICALP},
  year={2015}
}
Symmetry is inherent in the definition of most of the two-player zero-sum games, including parity, mean-payoff, and discounted-payoff games. It is therefore quite surprising that no symmetric analysis techniques for these games exist. We develop a novel symmetric strategy improvement algorithm where, in each iteration, the strategies of both players are improved simultaneously. We show that symmetric strategy improvement defies Friedmann's traps, which shook the belief in the potential of… Expand
A Delayed Promotion Policy for Parity Games
TLDR
A new instantiation, called delayed promotion, is proposed that tries to reduce the possible exponential behaviours exhibited by the original method in the worst case, and not only often outperforms the original priority promotion approach, but so far no exponential worst case is known. Expand
A delayed promotion policy for parity games
TLDR
A new instantiation, called delayed promotion, is proposed that tries to reduce the possible exponential behaviors exhibited by the original method in the worst case, and often outperforms both the state-of-the-art solvers and the original priority promotion approach. Expand
Improving Priority Promotion for Parity Games
TLDR
A new instantiation, called region recovery, is proposed that tries to reduce the possible exponential behaviours exhibited by the original method in the worst case, and not only often outperforms the original priority promotion approach, but so far no exponential worst case is known. Expand
Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games
TLDR
This work presents a method that - in contrast to existing techniques - tackles both aspects with the best suited approach and works exclusively on the 2.5 player game itself, powerful enough to handle games with several million states. Expand
Improvement in Small Progress Measures
TLDR
The algorithm is modified so that it derives the winning strategy for both players in one pass, which reduces the upper bound on strategy derivation for SPM to O(dm.(n/floor(d/2))^floor( d/2)). Expand
Parity Games with Weights
TLDR
This work investigates the problem of determining, for a given threshold b, whether the protagonist has a strategy of quality at most b and shows this problem to be EXPTIME-complete and presents tight bounds on the quality of winning strategies for the protagonist. Expand
Parity Games with Weights
TLDR
It is shown that solving parity games with costs with arbitrary integer weights is in NP $\cap$ coNP, the signature complexity for games of this type, and that the protagonist has finite-state winning strategies, and tight pseudo-polynomial bounds for the memory he needs to win the game are presented. Expand
An ordered approach to solving parity games in quasi polynomial time and quasi linear space
TLDR
A first implementation for a quasi-polynomial algorithm is provided, and a number of side results are provided, including minor algorithmic improvements, a quasi bi-linear complexity in the number of states and edges for a fixed number of colours, and matching lower bounds for the algorithm of Calude et al. Expand
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space
TLDR
This work provides a first implementation for a quasi-polynomial algorithm, test it on small examples, and provides a number of side results, including minor algorithmic improvements, and a complexity index associated to the approach, which is compared to the recently proposed register index. Expand
06 16 8 v 1 [ cs . G T ] 1 7 A pr 2 01 8 Parity Games with Weights
Quantitative extensions of parity games have recently attracted significant interest. These extensions include parity games with energy and payoff conditions as well as finitary parity games andExpand
...
1
2
...

References

SHOWING 1-10 OF 43 REFERENCES
Non-oblivious Strategy Improvement
TLDR
A structural property of these games is described, and it is shown that these structures can affect the behaviour of strategy improvement and can be used to accelerate strategy improvement algorithms. Expand
An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
TLDR
A new exponential lower bound is presented for the two most popular deterministic variants of the strategy improvement algorithms for solving parity, mean payoff, discounted payoff and simple stochastic games. Expand
On Algorithms for Simple Stochastic Games
  • A. Condon
  • Computer Science
  • Advances In Computational Complexity Theory
  • 1990
TLDR
It is shown that four natural approaches to solving the simple stochastic game problem are incorrect, and two new algorithms for the problem are presented, one of which extends a technique of Shapley called the successive approximation technique by using linear programming to maximize the improvement at each approximation step. Expand
The Complexity of Mean Payoff Games on Graphs
TLDR
A pseudo-polynomial-time algorithm for the solution of mean payoff games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered by Gurvich, Karzanov and Khachiyan, is described. Expand
A Discrete Strategy Improvement Algorithm for Solving Parity Games
A discrete strategy improvement algorithm is given for constructing winning strategies in parity games, thereby providing also a new solution of the model-checking problem for the modal μ-calculus.Expand
Infinite Games Played on Finite Graphs
  • R. McNaughton
  • Mathematics, Computer Science
  • Ann. Pure Appl. Logic
  • 1993
TLDR
By distinguishing those nodes of the graph that determine the winning and losing of the game (winning-condition nodes), this work is able to offer a complexity analysis that is useful in computer science applications. Expand
Small Progress Measures for Solving Parity Games
TLDR
A new algorithm for deciding the winner in parity games, and hence also for the modal µ-calculus model checking, based on a notion of game progress measures, characterized as pre-fixed points of certain monotone operators on a complete lattice. Expand
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
TLDR
A novel strategy improvement algorithm for parity and payoff games is presented, which is guaranteed to select, in each improvement step, an optimal combination of local strategy modifications. Expand
A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games
TLDR
A careful choice of the next iterate results in a randomized algorithm of complexity min(poly(n).W, 2 o( √ n log n) ), which is simultaneously pseudopolynomial (W is the maximal absolute edge weight) and subexponential in the number of vertices n. Expand
The complexity of mean payo games on graphs
We study the complexity of nding the values and optimal strategies of mean payoo games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered byExpand
...
1
2
3
4
5
...