Decision-Making under Combinatorial Risk

• URL: http://arxiv.org/abs/2606.10092v1
• Date: Mon, 08 Jun 2026 19:17:26 GMT
• Title: Decision-Making under Combinatorial Risk
• Abstract summary: Decision-making under risk is typically studied through single-shot lottery choices.<n>We introduce an investment-allocation task to study decision under risk, where investing in a component raises its success probability.<n>We show that people navigate risk through its core features, shifting toward lottery valuation only when the induced probability mass function is displayed.
• Score: 2.3557380328665265
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Decision-making under risk is typically studied through single-shot lottery choices. Yet many real decisions involve combinatorial risk, where risk arises from multiple risky components, so the lottery over outcomes is induced rather than given outright and can be costly to evaluate exactly. We introduce an investment-allocation task to study decision under combinatorial risk, where investing in a component raises its success probability and thereby reshapes the outcome distribution. Participants favor the option with the larger probability increment, and, when increments are equal, the option with the higher initial success probability. Revealing the induced probability mass function (PMF) substantially changes behavior, making participants less responsive to combinatorial-risk features and reducing choice variance. To explain these patterns, we move beyond standard benchmarks and hand-crafted hypotheses with symbolic regression to discover compact descriptive models. The discovered models rely mainly on combinatorial-risk features, such as the after-investment success probability, rather than exact evaluation of the full induced distribution. Behavior under the displayed PMF is then well explained by augmenting this model with a prospect-theoretic residual model. The results show that people navigate combinatorial risk primarily through its core features, shifting toward lottery valuation only when the induced PMF is displayed.

Related papers

• Behavioural Signatures of Risk-Sensitive Decision-Making in Large Language Models [121.70781851874035]
  Large language models (LLMs) are increasingly used in decision support.<n>It is important to understand whether their choices under uncertainty exhibit stable and interpretable behavioural regularities.<n>Here we examine this question using a controlled multi-model framework based on no-limit Texas Hold'em.
  arXiv  Detail & Related papers  (2026-07-11T10:33:39Z)
• Enhancing a Risk Model by Adding Transient Statistical Factors [90.40844650665713]
  Estimating asset returns is a key component of financial portfolio construction and evaluation.<n>We propose a systematic method based on maximum likelihood estimation to enhance an existing factor model.<n>We show that the proposed extension captures structure in the returns that is missed by the original model.
  arXiv  Detail & Related papers  (2026-05-13T04:15:24Z)
• Answer, Refuse, or Guess? Investigating Risk-Aware Decision Making in Language Models [63.559461750135334]
  Language models (LMs) are increasingly used to build agents that can act autonomously to achieve goals.<n>We study this "answer-or-defer" problem with an evaluation framework that systematically varies human-specified risk structures.<n>We find that a simple skill-decomposition method, which isolates the independent skills required for answer-or-defer decision making, can consistently improve LMs' decision policies.
  arXiv  Detail & Related papers  (2025-03-03T09:16:26Z)
• Mitigating optimistic bias in entropic risk estimation and optimization with an application to insurance [5.407319151576265]
  The entropic risk measure is widely used to account for tail risks associated with an uncertain loss.<n>To mitigate the bias in the empirical entropic risk estimator, we propose a strongly consistent bootstrapping procedure.<n>We show that our methods suggest a higher (and more accurate) premium to homeowners.
  arXiv  Detail & Related papers  (2024-09-30T04:02:52Z)
• Data-Adaptive Tradeoffs among Multiple Risks in Distribution-Free Prediction [55.77015419028725]
  We develop methods that permit valid control of risk when threshold and tradeoff parameters are chosen adaptively. Our methodology supports monotone and nearly-monotone risks, but otherwise makes no distributional assumptions.
  arXiv  Detail & Related papers  (2024-03-28T17:28:06Z)
• RiskQ: Risk-sensitive Multi-Agent Reinforcement Learning Value Factorization [49.26510528455664]
  We introduce the Risk-sensitive Individual-Global-Max (RIGM) principle as a generalization of the Individual-Global-Max (IGM) and Distributional IGM (DIGM) principles. We show that RiskQ can obtain promising performance through extensive experiments.
  arXiv  Detail & Related papers  (2023-11-03T07:18:36Z)
• Risk-Averse Reinforcement Learning via Dynamic Time-Consistent Risk Measures [10.221369785560785]
  In this paper, we consider the problem of maximizing dynamic risk of a sequence of rewards in Markov Decision Processes (MDPs) Using a convex combination of expectation and conditional value-at-risk (CVaR) as a special one-step conditional risk measure, we reformulate the risk-averse MDP as a risk-neutral counterpart with augmented action space and manipulation on the immediate rewards. Our numerical studies show that the risk-averse setting can reduce the variance and enhance robustness of the results.
  arXiv  Detail & Related papers  (2023-01-14T21:43:18Z)
• Risk-Averse MDPs under Reward Ambiguity [9.929659318167731]
  We propose a distributionally robust return-risk model for Markov decision processes (MDPs) under risk and reward ambiguity. A scalable first-order algorithm is designed to solve large-scale problems.
  arXiv  Detail & Related papers  (2023-01-03T11:06:30Z)
• Risk-Sensitive Policy with Distributional Reinforcement Learning [4.523089386111081]
  This research work introduces a novel methodology based on distributional RL to derive sequential decision-making policies sensitive to the risk. Named the risk-based utility function $U$, it can be extracted from the random return distribution $Z$ naturally learnt by any distributional RL algorithm. This enables to span the complete potential trade-off between risk minimisation and expected return maximisation.
  arXiv  Detail & Related papers  (2022-12-30T14:37:28Z)
• Efficient Risk-Averse Reinforcement Learning [79.61412643761034]
  In risk-averse reinforcement learning (RL), the goal is to optimize some risk measure of the returns. We prove that under certain conditions this inevitably leads to a local-optimum barrier, and propose a soft risk mechanism to bypass it. We demonstrate improved risk aversion in maze navigation, autonomous driving, and resource allocation benchmarks.
  arXiv  Detail & Related papers  (2022-05-10T19:40:52Z)
• SENTINEL: Taming Uncertainty with Ensemble-based Distributional Reinforcement Learning [6.587644069410234]
  We consider risk-sensitive sequential decision-making in model-based reinforcement learning (RL) We introduce a novel quantification of risk, namely emphcomposite risk We experimentally verify that SENTINEL-K estimates the return distribution better, and while used with composite risk estimate, demonstrates better risk-sensitive performance than competing RL algorithms.
  arXiv  Detail & Related papers  (2021-02-22T14:45:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.