Convexity in Differential Games

Valentin Ostapenko ()
Additional contact information
Valentin Ostapenko: National Technical University of Ukraine “Kyiv Polytechnical Institute”

A chapter in Pareto Optimality, Game Theory And Equilibria, 2008, pp 307-348 from Springer

Abstract: The current chapter is devoted to the development of convex analysis concepts in the context of solving pursuit-evasion problems in differential games. Classic convex analysis is generalized; new concepts such as matrix-convex sets and H-convex sets are introduced and studied.With the help of these, it is shown possible to describe a rather wide class of differential games where players' strategies are produced in a comparatively constructive manner. The main attention is on studying those properties of matrix convexity that are required for the theory of differential games. Operational constructions for the initial positions sets, favorable to each player, for the derivation of the players' strategies are also described.

Keywords: differential games; matrix-convexity; H-convexity; operational constructions (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-77247-9_12

Ordering information: This item can be ordered from
http://www.springer.com/9780387772479

DOI: 10.1007/978-0-387-77247-9_12

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().