We study stochastic combinatorial optimization problems where the objective is to minimize expected maximum load (a.k.a. makespan). In this framework, we have a set of n tasks and m resources, each task j uses some subset resources. Tasks random sizes $$X_j$$ , our goal non-adaptively select t over all on any resource i total size selected that use i. For example, when resources are points inte...

We consider an asset-liability management (ALM) problem for a defined benefit pension fund (PF). The PF manager is assumed to follow a maximal fund valuation problem facing an extended set of risk factors:  due to the longevity of the    PF members, the inflation affecting salaries in real terms and future incomes, interest rates and market factors affecting jointly the PF liability and asset p...

This result has an application to the hyperbolic subset of the p-adic Mandelbrot set, whose complex analogue has been much studied [2, 4, 5, e.g.]. Much of the proof of (2) is an analysis of the Galois tower formed by the splitting fields of iterates of y2+x ∈ Fp(x)[y]. Similar towers have been studied recently by Morton [7], Odoni [8], and Aitken, Hajir, and Maire [1]. I introduce a stochastic...