{"paper_id":"2407.00266","title":"Vector-valued robust stochastic control","authors":["Igor Cialenco","Gabriela Kováčová"],"paper_date":"2024-06-29","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2407.00266v1","page_url":"https://thequant.space/flowcharts/vector-valued-robust-stochastic-control/","scores":{"empirical_rigor":2.1,"math_complexity":9.2,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a vector‑valued robust stochastic control framework that defines a set‑valued value function using an ideal‑point vector supremum and derives both weak and strong versions of the dynamic programming principle for multi‑objective criteria under model uncertainty.","quote":"To deal with these, we employ the notion of an ideal point vector-valued supremum for the robust part of the problem, while we view the control part as a multi-objective (or vector) optimization problem. Using a set-valued framework, we derive both a weak and strong version of the dynamic programming principle (DPP) or Bellman equations by taking the value function as the collection of all worst expected losses","summary":"We study a dynamic stochastic control problem subject to Knightian uncertainty with multi-objective (vector-valued) criteria. Assuming the preferences across expected multi-loss vectors are represented by a given, yet general, preorder, we address the model uncertainty by adopting a robust or…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Preferences over expected multi‑loss vectors are represented by a given preorder.","type":"other","stated":"explicit","quote":"Assuming the preferences across expected multi-loss vectors are represented by a given, yet general, preorder, we address the model uncertainty by adopting a robust or minimax perspective, minimizing expected loss across the worst-case model.","support":"full"},{"assumption":"The weak version of Bellman’s principle holds under minimal assumptions.","type":"other","stated":"explicit","quote":"The weak version of Bellman's principle is proved under minimal assumptions.","support":"full"},{"assumption":"A rectangularity property with respect to the preorder is assumed to obtain the strong DPP.","type":"model","stated":"explicit","quote":"To establish a stronger version of DPP, we introduce the rectangularity property with respect to a general preorder. The third key contribution of our study is the introduction of rectangularity property with respect to a general preorder.","support":"full"},{"assumption":"The component‑wise partial order on vectors is considered as a special preorder case.","type":"other","stated":"explicit","quote":"We also further study a particular, but important, case of component-wise partial order of vectors, for which we additionally derive DPP under a different set-valued notion for the value function, the so-called upper image of the multi-objective problem. Fourth, we further study a particular, but important, case of component-wise partial order of vectors for which we additionally derive DPP under a second popular","support":"full"},{"assumption":"The set‑valued supremum (ideal‑point) exists and may be non‑unique, but the Bellman principle is invariant to the choice of supremum.","type":"other","stated":"explicit","quote":"Using a series of results, we show that while the vector-valued supremum may not be unique, the Bellman’s principle is invariant with respect to chosen supremum.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"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":"A weak dynamic programming principle is derived for the vector‑valued robust control problem without additional assumptions.","kind":"theoretical","quote":"Using a set-valued framework, we derive both a weak and strong version of the dynamic programming principle (DPP) or Bellman equations by taking the value function as the collection of all worst expected losses across all feasible actions. The weak version of Bellman's principle is proved under minimal assumptions.","support":"full"},{"finding":"Introducing the rectangularity property yields a strong version of the DPP (Theorems 3.7 and 3.8).","kind":"theoretical","quote":"To establish a stronger version of DPP, we introduce the rectangularity property with respect to a general preorder. Leveraging this we prove a stronger version of Bellman’s principle of optimality; see Theorem 3.7 and Theorem 3.8.","support":"full"},{"finding":"For the component‑wise partial order, the DPP can also be expressed via the upper‑image (upper set) of the multi‑objective value function.","kind":"theoretical","quote":"We also further study a particular, but important, case of component-wise partial order of vectors, for which we additionally derive DPP under a different set-valued notion for the value function, the so-called upper image of the multi-objective problem. Fourth, we further study a particular, but important, case of component-wise partial order of vectors for which we additionally derive DPP under a second popular","support":"full"},{"finding":"Illustrative examples (including a binomial tree model) demonstrate the importance of rectangularity and the equivalence of weak and strong set‑valued Bellman principles under rectangular families of models.","kind":"theoretical","quote":"Finally, we provide illustrative examples motivated by financial problems. Finally, we provide some illustrative examples.","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:56:32Z"},"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/"}