Skip to main content
SpringerLink
Log in

Finite State Strategies in One Player McNaughton Games

  • Conference paper
  • First Online:
Discrete Mathematics and Theoretical Computer Science (DMTCS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2731))

Abstract

In this paper we consider a class of infinite one player games played on finite graphs. Our main questions are the following: given a game, how efficient is it to find whether or not the player wins the game?If the player wins the game, then how much memory is needed to win the game?F or a given number n, what does the underlying graph look like if the player has a winning strategy of memory size n?

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.R. Büchi, L.H. Landweber. Solving Sequential Conditions by Finite State Strategies. Trans. Amer. Math. Soc. 138, p.295–311, 1969.

    Article  MathSciNet  Google Scholar 

  2. H.L. Bodlaender, M.J. Dinneen, and B. Khoussainov. On Game-Theoretic Models of Networks, in Algorithms and Computation (ISAAC 2001 proceedings), LNCS 2223, P. Eades and T. Takaoka (Eds.), p. 550–561, Springer-Verlag Berlin Heidelberg 2001.

    Chapter  Google Scholar 

  3. M.J. Dinneen and B. Khoussainov. Update networks and their routing strategies. In Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science, WG2000, volume 1928 of Lecture Notes on Computer Science, pages 127–136. Springer-Verlag, June 2000.

    Chapter  Google Scholar 

  4. S. Dziembowski, M. Jurdzinski, and I. Walukiewicz. How much memory is needed to win infinite games? In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, p. 99–110, Warsaw, Poland, 1997.

    Google Scholar 

  5. Y. Gurevich and L. Harrington. Trees, Automata, and Games, STOCS, 1982, pages 60–65.

    Google Scholar 

  6. H. Ishihara, B. Khoussainov. Complexity of Some Infinite Games Played on Finite Graphs, to appear in Proceedings of the 28th International Workshop on Graph-Theoretic Methods in Computer Science, WG 2002, Checz Republic.

    Google Scholar 

  7. D. Martin. Borel Determinacy. Ann. Math. Vol 102, 363–375, 1975.

    Article  Google Scholar 

  8. R. McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65:149–184, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  9. A. Nerode, J. Remmel, and A. Yakhnis. McNaughton games and extracting strategies for concurrent programs. Annals of Pure and Applied Logic, 78:203–242, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Nerode, A. Yakhnis, and V. Yakhnis. Distributed concurrent programs as strategies in games. Logical methods (Ithaca, NY, 1992), p. 624–653, Progr. Comput. Sci. Appl. Logic, 12, Birkhauser Boston, Boston, MA, 1993.

    Google Scholar 

  11. R.E. Tarjan. Depth first search and linear graph algorithms. SIAM J. Computing 1:2, p. 146–160, 1972.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. Vardi. An automata-theoretic approach to linear temporal logic. Proceedings of the VIII Banff Higher Order Workshop. Springer Workshops in Computing Series, Banff, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Auckland, New Zealand

    Bakhadyr Khoussainov

Authors
  1. Bakhadyr Khoussainov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, Maths-Physics Building 303, 38 Princes St., Auckland, New Zealand

    Cristian S. Calude  & Michael J. Dinneen  & 

  2. Université de Bourgogne, LE2I, B.P. 47870, 21078, Dijon Cedex, France

    Vincent Vajnovszki

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khoussainov, B. (2003). Finite State Strategies in One Player McNaughton Games. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds) Discrete Mathematics and Theoretical Computer Science. DMTCS 2003. Lecture Notes in Computer Science, vol 2731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45066-1_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45066-1_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40505-4

  • Online ISBN: 978-3-540-45066-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation