pith. sign in

arxiv: 1711.03875 · v3 · pith:LWK7QGVPnew · submitted 2017-11-09 · 🧮 math.OC · math.PR· q-fin.MF

Nonconcave Robust Optimization with Discrete Strategies under Knightian Uncertainty

classification 🧮 math.OC math.PRq-fin.MF
keywords optimizationunderproblemsrobustdiscreteknightianstrategiesuncertainty
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.