The turnpike property for dynamic discrete time zero-sum games (Q1596327)

The author has considered a discrete-time two player zero-sum game over an arbitrary interval \([0;n]\) for which the cost is a generic function \(f\) belonging to a certain set \({\mathcal M}\). It is proved that the so called turnpike property holds for a generic \(f\in{\mathcal M}.\) More exactly, the author has shown the existence of a set \({\mathcal F}\subset{\mathcal M}\) which is a countable intersection of open everywhere dense sets in \({\mathcal M}\) such that each \(f\in{\mathcal F}\) has the turnpike property.