LOG-OPTIMAL AND RAPID PATHS IN VON NEUMANN-GALE DYNAMICAL SYSTEMS

Esmaeil Babaei Khezerloo, Igor Evstigneev, Klaus Reiner Schenk-Hoppé

Research output: Contribution to journalArticlepeer-review

60 Downloads (Pure)

Abstract

Von Neumann-Gale dynamical systems are defined in terms of multivalued operators in spaces of random vectors, possessing certain properties of convexity and homogeneity. A central role in the theory of such systems is played by a special class of paths (trajectories) called rapid: they grow over each time period [t-1; t] in a sense faster than others. The paper establishes existence and characterization theorems for such paths showing, in particular, that any trajectory maximizing a logarithmic functional over a finite time horizon is rapid. The proof of this result is based on the methods of convex analysis in spaces of measurable functions. The study is motivated by the applications of the theory of von Neumann-Gale dynamical systems to the modeling of capital growth in financial markets with friction.
Original languageEnglish
JournalJournal of Mathematical Analysis and Applications
Early online date9 Sept 2019
DOIs
Publication statusPublished - 2019

Keywords

  • random dynamical systems
  • convex multivalued operators
  • von Neumann-Gale dynamical systems
  • rapid paths
  • logarithmically optimal paths
  • stochastic optimization
  • convex analysis in L1
  • Yosida-Hewitt decomposition
  • transaction costs
  • portfolio constraints
  • capital growth
  • benchmark strategies

Fingerprint

Dive into the research topics of 'LOG-OPTIMAL AND RAPID PATHS IN VON NEUMANN-GALE DYNAMICAL SYSTEMS'. Together they form a unique fingerprint.

Cite this