Skip to main content
SpringerLink
Log in

A markov chain game with dynamic information

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Two players, not knowing each other's position, move in a domain and can flash a searchlight. The game terminates when one player is caught within the area illuminated by the flash of the other. However, if this first player is not in this area, then the other player has disclosed his position to the former one, who may be able to exploit this information. The game is considered on a finite state space and in discrete 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. Ho, Y. C., andOlsder, G. J.,Differential Games: Concepts and Applications, Mathematics of Conflict, Edited by M. Shubik, North-Holland, Amsterdam, The Netherlands, pp. 127–186, 1983.

    Google Scholar 

  2. Kimeldorf, G.,Duels: An Overview, Mathematics of Conflict, Edited by M. Shubik, North-Holland, Amsterdam, The Netherlands, pp. 55–72, 1983.

    Google Scholar 

  3. Basar, T., andOlsder, G. J.,Dynamic Noncooperative Game Theory, Academic Press, New York, New York, 1982.

    Google Scholar 

  4. Parthasarathy, T., andStern, M.,Markov Games: a Survey, Differential Games and Control Theory II, Edited by E. O. Roxinet al., Marcel Dekker, New York, New York, pp. 1–46, 1977.

    Google Scholar 

  5. Bernhard, P., Colomb, A. L., andPapavassilopoulos, G. P.,Rabbit and Hunter Game: Two Discrete Stochastic Formulations, Computers and Mathematics with Applications, Vol. 13, pp. 205–225, 1987.

    Google Scholar 

  6. Kumar, P. R.,Optimal Mixed Strategies in Dynamic Games, IEEE Transactions on Automatic Control, Vol. AC-25, pp. 743–749, 1980.

    Google Scholar 

  7. Isaacs, R.,A Game of Aiming and Evasion: General Discussion and the Marksman's Strategies, Rand Corporation, Report No. 1385, 1954.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands

    G. J. Olsder (Professor)

  2. Department of Electrical Engineering Systems, University of Southern California, Los Angeles, California

    G. P. Papavassilopoulos (Associate Professor)

Authors
  1. G. J. Olsder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. P. Papavassilopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Y. C. Ho

The work of the second author was supported by ZWO, The Netherlands Organization for the Advancement of Pure Research, Contract No. B62-239, by the US Air Force Office of Scientific Research, Grant No. AFOSR-85-0245, and by the National Science Foundation, Grant No. NSF-INT-8504097.

Visiting Professor at Delft University of Technology during 1986.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Olsder, G.J., Papavassilopoulos, G.P. A markov chain game with dynamic information. J Optim Theory Appl 59, 467–486 (1988). https://doi.org/10.1007/BF00940310

Download citation

  • Issue Date:

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

Key Words

Search

Navigation