A divide and conquer algorithm for exploiting policy function monotonicity is proposed and analyzed. To solve a discrete problem with n states and n choices, the algorithm requires at most nlog2(n)+5n objective function evaluations. In contrast, existing methods for nonconcave problems require...

This chapter gives an overview of current research in evolutionary finance. We mainly focus on the survival and stability properties of investment strategies associated with the Kelly rule. Our approach to the study of the wealth dynamics of investment strategies is inspired by Darwinian ideas...

We present the first necessary and sufficient conditions for the existence of a unique perfect-foresight solution, returning to a given steady-state, in an otherwise linear model with occasionally binding constraints. We derive further conditions on the existence of a solution in such models,...

Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {1,2,...n,-1,-2,....-n} with the property that antipodal vertices on the...

We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...