Skip to main content
SpringerLink
Log in

Positional strategies for mean payoff games

  • Papers
  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

Abstract

We study some games of perfect information in which two players move alternately along the edges of a finite directed graph with weights attached to its edges. One of them wants to maximize and the other to minimize some means of the encountered weights.

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

  • Ehrenfeucht, A., andJ. Mycielski: Positional games over a graph, Notices of the American Mathematical Society20, 1973, A-334.

    Google Scholar 

  • Mycielski, J.: On the axiom of determinateness (II). Fundamenta Mathematicae59, 1966, 203–212.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Colorado, 80309, Boulder, Colorado, USA

    A. Ehrenfeucht

  2. Department of Mathematics, University of Colorado, 80309, Boulder, Colorado, USA

    J. Mycielski

Authors
  1. A. Ehrenfeucht
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Mycielski
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ehrenfeucht, A., Mycielski, J. Positional strategies for mean payoff games. Int J Game Theory 8, 109–113 (1979). https://doi.org/10.1007/BF01768705

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01768705

Keywords

Search

Navigation