Symmetric Strategy Improvement

Conference paper

DOI: 10.1007/978-3-662-47666-6_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9135)
Cite this paper as:
Schewe S., Trivedi A., Varghese T. (2015) Symmetric Strategy Improvement. In: Halldórsson M., Iwama K., Kobayashi N., Speckmann B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science, vol 9135. Springer, Berlin, Heidelberg

Abstract

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 classic strategy improvement to be polynomial.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Sven Schewe
    • 1
  • Ashutosh Trivedi
    • 2
  • Thomas Varghese
    • 1
  1. 1.University of LiverpoolLiverpoolUK
  2. 2.Indian Institute of Technology BombayMumbaiIndia

Personalised recommendations