We present a novel method for assigning fingers to notes in a polyphonic piano score. Such a mapping (called a “fingering”) is of great use to performers. To accommodate performers’ unique hand sha our method relies on a simple, user function. We use dynamic programming to search the space of all possible fingerings for the optimal fingering under this cost function. Despite the simplicity of t...

We consider the problem of determining a strategy that is efficient in the sense that it minimizes the expectation of a convex loss function of the hedging error for the case when prices change at discrete random points in time according to a geometric Poisson process. The intensities of the jump process need not be fully known by the investor. The solution algorithm is based on dynamic program...