{"paper_id":"2404.13371","title":"On Risk-Sensitive Decision Making Under Uncertainty","authors":["Chung-Han Hsieh","Yi-Shan Wong"],"paper_date":"2024-04-20","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2404.13371v1","page_url":"https://thequant.space/flowcharts/on-risk-sensitive-decision-making-under-uncertainty/","scores":{"empirical_rigor":3,"math_complexity":8,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a new risk-sensitive decision‑making model under uncertainty, formulated as a stochastic control problem with necessary optimality conditions.","quote":"V. CONCLUDING REMARKS In this paper, we have introduced and examined a new risk-sensitive decision-making model under uncertainty, formulat-ing the problem as a stochastic control problem and establish-ing necessary optimality conditions.","summary":"This paper studies a risk-sensitive decision-making problem under uncertainty. It considers a decision-making process that unfolds over a fixed number of stages, in which a decision-maker chooses among multiple alternatives, some of which are deterministic and others are stochastic. The…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The decision process unfolds over a fixed number of stages.","type":"model","stated":"explicit","quote":"It considers a decision-making process that unfolds over a fixed number of stages, in which a decision-maker chooses among multiple alternatives, some of which are deterministic and others are stochastic.","support":"full"},{"assumption":"The stochastic alternatives are assumed to be i.i.d.","type":"statistical","stated":"explicit","quote":"Despite the contributions of this study, we recognize its limitations, including the i.i.d. assumptions on the stochastic alternatives.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"Increasing the risk‑aversion constant ρ reduces the optimal weight K*2 (e.g., from 0.4 at ρ=0 to ≈0.3646 at ρ=0.1).","kind":"theoretical","quote":"If we increase ρ to 0.1, we obtain the K∗ 2 ≈0.3646, slightly smaller than 0.4, implying that investors will reduce the weight as the risk aversion constant ρ rises.","support":"full"},{"finding":"When ρ rises from 0 to 1, K*2 falls by about 0.2 to 0.2035, demonstrating the trade‑off between expected log‑growth and log‑variance.","kind":"theoretical","quote":"When ρ rises from 0 to 1, K∗ 2 falls by around 0.2 to 0.2035; see Figures 1 and 2.","support":"full"},{"finding":"The second‑order derivative of the log‑variance is convex for various n, making Problem (3) a concave program under those settings.","kind":"theoretical","quote":"1000 units, symmetric demand volatility Xmax = 1 = −Xmin, risk-aversion constant ρ = 1/2, and n ≥1, Figure 4 shows the second-order derivative of the log-variance under various n ∈{1, 5, 10}, which is readily seen that v(K) is a convex function; hence, Problem (3) is a concave program and Lemma 3.2 becomes necessary and sufﬁcient conditions.","support":"full"},{"finding":"Illustrative examples from optimal betting and inventory management support the theory.","kind":"other","quote":"Two illustrative examples from optimal betting and inventory management are provided to support our theory.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":14,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:57:53Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}