Skip to main content
SpringerLink
Log in

Exponential examples of solving parity games

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

This paper is devoted to solving certain problems on the computational complexity of deciding the winner in cyclic games. The main result is the proof of the fact that the nondeterministic potential transformation algorithm designed for solving parity games is exponential in terms of computation time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. A. Gurvich, A. V. Karzanov, and L. G. Khachiyan, “Cyclic games and an algorithm to find minimax cycle means in directed graphs,” Zh. Vychisl. Mat. Mat. Fiz. 28 (5), 85–91 1988.

    MathSciNet  MATH  Google Scholar 

  2. N. Pisaruk, “Mean cost cyclical games,” Math. Oper. Res. 59 (4), 817–828 1999.

    Article  MathSciNet  MATH  Google Scholar 

  3. A. V. Karzanov and V. N. Lebedev, “Cyclical games with prohibitions,” Math. Program. 60, 277–293 1993.

    Article  MathSciNet  MATH  Google Scholar 

  4. M. Jurdzinski, “Deciding the winner in parity games is in UP n co–UP,” Inf. Proc. Lett. 68, 119–124 1998.

    Article  MathSciNet  Google Scholar 

  5. E. Beffara and S. Vorobyov, “Is randomized Gurvich–Karzanov–Khachiyan’s algorithm for parity games polynomial?” Technical report, Department of information Technology Uppsala University, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Volgograd State University, Universitetskii pr. 100, Volgograd, 400062, Russia

    V. N. Lebedev

Authors
  1. V. N. Lebedev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. N. Lebedev.

Additional information

Original Russian Text © V.N. Lebedev, 2016, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2016, Vol. 56, No. 4, pp. 694–703.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lebedev, V.N. Exponential examples of solving parity games. Comput. Math. and Math. Phys. 56, 688–697 (2016). https://doi.org/10.1134/S0965542516040114

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542516040114

Keywords

Search

Navigation