mlsanityData to 14 Oct 2026

Nonconcave Robust Optimization with Discrete Strategies under Knightian Uncertainty

arXiv 1711.03875 ↗First posted 9 Nov 2017math.OC math.PR q-fin.MFcited by 1

Not on the map. Why?

Abstract (arXiv)

We study robust stochastic optimization problems in the quasi-sure setting in discrete-time. The strategies in the multi-period-case are restricted to those taking values in a discrete set. The optimization problems under consideration are not concave. We provide conditions under which a maximizer exists. The class of problems covered by our robust optimization problem includes optimal stopping and semi-static trading under Knightian uncertainty.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 9 Nov 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.