The Worst-Case Complexity of Symmetric Strategy Improvement

Tom van Dijk, Georg Loho, Matthew Maat

Research output: Working paperPreprintAcademic

45 Downloads (Pure)

Abstract

Symmetric strategy improvement is an algorithm introduced by Schewe et al. (ICALP 2015) that can be used to solve two-player games on directed graphs such as parity games and mean payoff games. In contrast to the usual well-known strategy improvement algorithm, it iterates over strategies of both players simultaneously. The symmetric version solves the known worst-case examples for strategy improvement quickly, however its worst-case complexity remained open. We present a class of worst-case examples for symmetric strategy improvement on which this symmetric version also takes exponentially many steps. Remarkably, our examples exhibit this behaviour for any choice of improvement rule, which is in contrast to classical strategy improvement where hard instances are usually hand-crafted for a specific improvement rule. We present a generalized version of symmetric strategy iteration depending less rigidly on the interplay of the strategies of both players. However, it turns out it has the same shortcomings.
Original languageEnglish
DOIs
Publication statusPublished - 5 Sept 2023

Keywords

  • cs.GT

Fingerprint

Dive into the research topics of 'The Worst-Case Complexity of Symmetric Strategy Improvement'. Together they form a unique fingerprint.

Cite this