Skip to main content
Log in

Differential Games of inf-sup Type and Isaacs Equations

  • Published:
Applied Mathematics and Optimization Aims and scope Submit manuscript

Abstract

Motivated by the work of Fleming, we provide a general framework to associate inf-sup type values with the Isaacs equations. We show that upper and lower bounds for the generators of inf-sup type are upper and lower Hamiltonians, respectively. In particular, the lower (resp. upper) bound corresponds to the progressive (resp. strictly progressive) strategy. By the Dynamic Programming Principle and identification of the generator, we can prove that the inf-sup type game is characterized as the unique viscosity solution of the Isaacs equation. We also discuss the Isaacs equation with a Hamiltonian of a convex combination between the lower and upper Hamiltonians.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Hidehiro Kaise or Shuenn-Jyi Sheu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kaise, H., Sheu, SJ. Differential Games of inf-sup Type and Isaacs Equations. Appl Math Optim 52, 1–22 (2005). https://doi.org/10.1007/s00245-004-0818-6

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00245-004-0818-6

Navigation