Non-concave Expected Utility Optimization with Uncertain Time Horizon
Bibliographic record
Abstract
Abstract We consider an expected utility maximization problem where the utility function is not necessarily concave and the time horizon is uncertain. We establish a necessary and sufficient condition for the optimality for general non-concave utility function in a complete financial market. We show that the general concavification approach of the utility function to deal with non-concavity, while being still applicable when the time horizon is a stopping time with respect to the financial market filtration, leads to sub-optimality when the time horizon is independent of the financial risk, and hence can not be directly applied. For the latter case, we suggest a recursive procedure which is based on the dynamic programming principle. We illustrate our findings by carrying out a multi-period numerical analysis for optimal investment problem under a convex option compensation scheme with random time horizon. We observe that the distribution of the non-concave portfolio in both certain and uncertain random time horizon is right-skewed with a long right tail, indicating that the investor expects frequent small losses and a few large gains from the investment. While the (certain) average time horizon portfolio at a premature stopping date is unimodal, the random time horizon portfolio is multimodal distributed which provides the investor a certain flexibility of switching between the local maximizers, depending on the market performance. The multimodal structure with multiple peaks of different heights can be explained by the concavification procedure, whereas the distribution of the time horizon has significant impact on the amplitude between the modes.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".