Computing Wasserstein barycenters of discrete measures has recently attracted considerable attention due to its wide variety of applications in data science. In general, this problem is NP-hard, calling for practical approximative algorithms. In this paper, we analyze a well-known simple...

In a thorough study of binomial trees, Joshi introduced the split tree as a two-phase binomial tree designed to minimize oscillations, and demonstrated empirically its outstanding performance when applied to pricing American put options. Here we introduce a "flexible" version of Joshi's tree,...

In a thorough study of binomial trees, Joshi introduced the split tree as a two-phase binomial tree designed to minimize oscillations, and demonstrated empirically its outstanding performance when applied to pricing American put options. Here we introduce a "flexible" version of Joshi's tree,...