pith. sign in

arxiv: 1501.06484 · v1 · pith:WLVZKZQCnew · submitted 2015-01-26 · 💻 cs.GT

Symmetric Strategy Improvement

classification 💻 cs.GT
keywords improvementstrategysymmetricgamesalgorithmanalysisbeliefclassic
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Equilibria in Multiplayer Graph Games: An Algorithmic Study

    cs.GT 2026-05 unverdicted novelty 5.0

    Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.