Fact-checked by Grok 2 weeks ago

Optimal decision

An optimal decision, within the framework of decision theory, is the selection of an action from a set of alternatives that maximizes the expected utility or minimizes the expected loss, based on the probabilities of possible outcomes and the decision-maker's preferences.^[1] This concept is formalized in expected utility theory, pioneered by John von Neumann and Oskar Morgenstern, who demonstrated that rational choices under uncertainty can be represented by assigning utilities to lotteries over outcomes, ensuring consistency with axioms such as completeness, transitivity, continuity, and independence.^[2] Normative decision theory, which prescribes optimal decisions, contrasts with descriptive theories that observe actual human behavior, often revealing deviations from optimality due to cognitive biases or bounded rationality.^[3] Key elements in formulating optimal decisions include acts (available actions), events (uncertain states with associated probabilities), consequences (outcomes resulting from act-event pairs), and payoffs (utilities or monetary values of consequences), with the goal of selecting the act that yields the highest expected payoff over repeated scenarios.^[3] For instance, in probabilistic models, the optimal action u^* is found by minimizing the expected cost E[L(u, \theta)], where \theta represents states drawn from a probability distribution.^[1] Optimal decision-making extends beyond economics to fields like artificial intelligence, where algorithms such as dynamic programming solve for optimal policies in sequential decisions, and neuroscience, where neural circuits in the cortex and basal ganglia implement statistically optimal computations to balance speed, accuracy, and reward under evolutionary pressures.^[4] Foundational contributions include Wald's sequential probability ratio test for efficient hypothesis testing and Bellman's dynamic programming for multistage optimization, emphasizing the role of information value in refining decisions.^[5] These principles underpin applications in resource allocation, risk management, and policy design, ensuring choices align with long-term objectives despite uncertainty.^[6]

Fundamentals

Definition and Scope

An optimal decision is defined as the choice among a set of feasible alternatives that maximizes a specified objective, such as utility or payoff, thereby yielding the highest possible value under the given criteria.^[7] This normative ideal assumes complete information, well-defined preferences, and the ability to evaluate all options exhaustively, positioning it as the cornerstone of rational choice in decision theory.^[7] Unlike suboptimal decisions, which may settle for lesser outcomes due to constraints or errors, an optimal decision aligns perfectly with the decision-maker's goals in idealized conditions.^[8] The scope of optimal decision-making extends across multiple disciplines, including economics, where it underpins models of consumer and producer behavior; operations research, which applies it to resource allocation and process optimization; and artificial intelligence, where algorithms seek to approximate optimality in complex environments. It contrasts sharply with satisficing, a concept introduced by Herbert Simon in his critique of unbounded rationality, wherein decision-makers select options that are merely adequate rather than maximally beneficial, often due to cognitive or informational limits.^[9] This distinction highlights optimal decisions as an aspirational benchmark rather than a universal practice. Historically, the foundations of optimal decision-making trace back to rational choice theory, with an early formalization in 1738 by Daniel Bernoulli, who addressed the St. Petersburg paradox by proposing that decisions should maximize expected moral expectation—a precursor to modern utility concepts—rather than mere monetary value.^[10] Bernoulli's work laid the groundwork for evaluating choices under risk, influencing subsequent developments in probability and economics. A representative example of an optimal decision occurs in a deterministic setting, such as selecting the shortest path between two points on a map with known, traffic-free routes, where the choice minimizes travel time by directly comparing distances and speeds among all available options.^[8] Utility functions serve as the quantitative basis for such evaluations, encoding preferences to identify the superior alternative.^[7]

Utility and Preference Structures

In optimal decision making, outcomes are evaluated through utility functions that quantify the desirability of different alternatives, providing a numerical basis for comparing preferences. A utility function U maps a set of possible outcomes to real numbers, where U: \Omega \to \mathbb{R}, with higher values indicating greater preference. This representation assumes that preferences can be structured to allow consistent evaluation, often relying on the cardinal properties derived from the von Neumann-Morgenstern (vNM) axioms. These axioms—completeness (every pair of outcomes is comparable), transitivity (if outcome A is preferred to B and B to C, then A to C), continuity (preferences are continuous over mixtures of outcomes), and independence (preferences over mixtures are preserved under common components)—ensure the existence of a utility function unique up to positive affine transformations.^[11] Preference structures form the foundation for rational decision making, where an agent's choices reflect a consistent ordering of alternatives. Rational preferences are those that satisfy the vNM axioms, enabling the construction of a utility function that captures the decision maker's attitudes without contradictions. Violations of these axioms, such as intransitivity or incompleteness, can lead to inconsistencies where no stable optimization is possible, undermining the ability to define an optimal decision. For instance, if preferences fail transitivity, cycles of preference may arise, preventing a coherent ranking of outcomes.^[11] Utility functions vary in type depending on the required level of measurement and context. Ordinal utility suffices for ranking alternatives without quantifying the intensity of preferences, preserving order under monotonic transformations; this approach, formalized in early consumer theory, focuses solely on relative desirability (e.g., A preferred to B without specifying how much).^[12] Cardinal utility, in contrast, assigns numerical values that allow measurement of preference differences, enabling interpersonal comparisons and applications in welfare economics; it is unique up to linear scaling and is essential when evaluating trade-offs or risks.^[11] Expected utility extends cardinal utility to handle risk by incorporating probabilities, representing preferences over lotteries via the vNM framework.^[11] A seminal illustration of utility's role in resolving decision paradoxes is Daniel Bernoulli's 1738 analysis of the St. Petersburg paradox, where expected monetary value suggests infinite willingness to pay for a gamble with unbounded payoffs, yet intuition resists this. Bernoulli proposed a logarithmic utility function, U(x) = \ln(x), to capture diminishing marginal utility of wealth, yielding a finite expected utility and explaining risk aversion. This insight predated formal axiomatic theory but highlighted how non-linear utility resolves apparent irrationalities in valuation.^[13]

Deterministic Decision Making

Mathematical Formulation

In deterministic decision making, the optimal decision is modeled as a utility maximization problem where outcomes are fully known and preferences are represented by a utility function. The decision set D denotes the finite or infinite collection of feasible actions available to the decision maker.^[14] An outcome function f: D \to O maps each action d \in D to a deterministic outcome in the set O of possible results.^[14] The decision maker's preferences over outcomes are captured by a utility function U_O: O \to \mathbb{R}, which assigns a real number to each outcome reflecting its desirability.^[14] This induces a utility over decisions via the composite function U_D(d) = U_O(f(d)) for each d \in D.^[14] The optimal decision d^* then satisfies the condition

d^* = \arg\max_{d \in D} U_D(d),

selecting the action that yields the highest utility.^[14] This formulation assumes the utility function adheres to standard preference axioms, such as completeness and transitivity, ensuring a well-defined ordering over outcomes. To apply this model, the process begins by identifying the decision set D, which delineates all viable actions based on contextual constraints.^[14] Next, the outcome function f is specified to describe how actions lead to outcomes, often incorporating domain-specific relations.^[14] The utility function U_O is then defined, typically derived from empirical data or theoretical preferences, to quantify desirability.^[14] Finally, the maximization problem is solved to identify d^*, either analytically or computationally.^[14] A concrete example arises in resource allocation problems, where linear programming provides a structured formulation.^[15] Here, decisions correspond to allocation vectors x \in \mathbb{R}^n with x \geq 0, representing quantities assigned to activities, and the decision set D is defined by linear constraints Ax \leq b capturing resource limits, where A is the constraint matrix and b the resource vector.^[15] The outcome function f(x) embeds these constraints into feasible profits, with utility given by the linear objective U_D(x) = c^T x, where c is the profit coefficient vector.^[15] Optimality requires solving

\max_{x} \, c^T x \quad \text{subject to} \quad Ax \leq b, \quad x \geq 0,

yielding the resource allocation that maximizes profit under deterministic conditions.^[15]

Solution Methods

In deterministic decision making, where the decision space D is finite and small, the optimal decision can be found through exhaustive search by evaluating the utility function U_D(d) for every possible decision d \in D and selecting the one that maximizes it.^[16] This brute-force approach guarantees the global optimum but becomes computationally infeasible as |D| grows exponentially, limiting its practicality to toy problems or highly constrained domains.^[16] For continuous decision spaces, gradient-based methods leverage the derivatives of the utility function to iteratively approach local maxima. These techniques solve \partial U_D / \partial d = 0 using algorithms like gradient ascent, where updates follow d_{k+1} = d_k + \alpha \nabla U_D(d_k), with \alpha as the step size. Such methods are efficient for differentiable utilities but may converge to suboptimal local optima if the landscape is non-convex. When the utility function U_D is concave and constraints form a convex set, convex optimization guarantees a global optimum. Interior-point methods, which navigate the feasible region's interior via barrier functions, efficiently solve these problems by minimizing a perturbed objective like \min_d -U_D(d) - \mu \sum \log(-g_i(d)), where g_i define constraints and \mu > 0 decreases iteratively.^[17] For linear programs—a special case where U_D(d) = c^T d subject to Ad \leq b—the simplex algorithm, developed by Dantzig in 1947, pivots along polytope edges to find the optimum, though it lacks worst-case polynomial time.^[18] Polynomial-time variants, such as Karmarkar's interior-point method introduced in 1984, achieve this via projective transformations and barrier penalties, running in O(n^{3.5} L) time for n-dimensional problems with L-bit data. In sequential deterministic settings, dynamic programming decomposes the problem using the principle of optimality, solving the Bellman equation V(s) = \max_a [R(s,a) + \gamma V(s')], where s' is the deterministic successor state, R is the reward, and \gamma \in [0,1) discounts future values.^[19] Backward induction computes value functions from terminal states, enabling optimal policy extraction, as formalized by Bellman in 1957.^[19] This approach scales to problems with overlapping subproblems but curses dimensionality for large state spaces.^[19]

Decision Making Under Uncertainty

Probabilistic Frameworks

In decision making under uncertainty, two primary sources contribute to the unpredictability of outcomes: incomplete information about the environment or states of the world, and inherent randomness arising from natural processes or stochastic actions.^[20] Incomplete information manifests when a decision maker lacks full knowledge of relevant probabilities or parameters, while randomness introduces variability that cannot be eliminated, such as in weather-dependent agricultural yields or market fluctuations.^[20] To model these uncertainties, probabilistic frameworks represent outcomes as random events governed by probability distributions conditional on the chosen decision. Specifically, an outcome o is drawn from a conditional probability distribution p(o \mid d), where d denotes the decision variable, and p is either a probability density function for continuous outcomes or a mass function for discrete ones.^[21] This formulation captures how decisions influence the likelihood of different outcomes, such as selecting a route d that shifts the distribution p(o \mid d) of travel time o toward lower means or reduced variance.^[20] Outcomes are treated as random variables (RVs), with decisions affecting the parameters of their distributions rather than determining fixed values. For instance, in a manufacturing context, choosing a machine d might alter the mean and variance of production yield o, modeled as o \sim \mathcal{N}(\mu(d), \sigma^2(d)).^[20] This RV perspective allows for the quantification of uncertainty through moments like expectation and variance, enabling comparisons across decision options based on distributional properties.^[21] Bayesian updating provides a mechanism to refine these probabilistic models as new evidence emerges, starting from a prior distribution p(o) over outcomes and incorporating decision-dependent likelihoods p(o \mid d) to form posteriors.^[21] However, in decision-centric applications, the emphasis lies on how the choice of d directly shapes the conditional distribution p(o \mid d), such as updating beliefs about success probabilities in a clinical trial based on treatment selection.^[20] This approach ensures that the probabilistic framework remains adaptive to decision influences without assuming static priors. Within these frameworks, risk attitudes are encoded through the curvature of the utility function U over outcomes, as established in foundational decision theory. Risk-averse individuals exhibit concave utility functions (U'' < 0), reflecting diminishing marginal utility and a preference for certain outcomes over risky gambles with equal expected value, while risk-seeking attitudes correspond to convex functions (U'' > 0), favoring variability.^[22] These properties build on the ordinal utility structures over outcomes, allowing probabilistic models to incorporate individual preferences for handling uncertainty.^[22]

Expected Utility Optimization

Expected utility optimization involves selecting a decision that maximizes the expected value of a utility function under uncertainty, where outcomes are governed by probabilistic models. The expected utility for a decision d is formally defined as \mathbb{E}[U_O(o) | d] = \int p(o|d) U_O(o) \, do in the continuous case or \sum_o p(o|d) U_O(o) in the discrete case, with p(o|d) denoting the conditional probability of outcome o given decision d, and U_O(o) the utility of that outcome.^[11] This formulation captures the trade-off between the likelihood of outcomes and their associated utilities, enabling rational choice in risky environments. The optimal decision d^* is then the one that achieves the highest expected utility: d^* = \arg\max_{d \in D} \mathbb{E}[U_O(o) | d], where D is the set of feasible decisions.^[11] This maximization principle underpins decision theory for risk, assuming decision-makers aim to maximize their anticipated satisfaction. The Von Neumann-Morgenstern theorem establishes that rational preferences under risk—satisfying completeness, transitivity, continuity, and independence axioms—can be represented by such an expected utility function, implying that maximizing expected utility equates to rational behavior.^[11] Violations of these axioms, such as observed in behavioral experiments, challenge the theorem's prescriptive power but affirm its normative foundation for idealized rationality. Computing expected utility often requires approximation due to complex integrals or high-dimensional spaces. Monte Carlo simulation estimates the expectation by sampling outcomes from p(o|d) and averaging their utilities, providing unbiased approximations that converge to the true value with sufficient samples.^[23] For high-dimensional problems, stochastic approximation methods iteratively update decision parameters toward the maximum using noisy gradient estimates of the utility, as detailed in recursive algorithms for stochastic optimization.^[24] A classic illustration is the Monty Hall problem, where a contestant chooses one of three doors hiding a prize behind one and goats behind the others; the host reveals a goat behind a non-chosen door, offering a switch. Assuming utility of 1 for the prize and 0 for a goat, staying yields expected utility $1/3, while switching yields $2/3, making switching optimal.^[25] This demonstrates how conditional probabilities update expected utilities to favor counterintuitive strategies.

Practical and Advanced Aspects

Bounded Rationality and Heuristics

Bounded rationality refers to the idea that decision-makers operate under constraints of limited cognitive capacity, incomplete information, and finite time, preventing them from achieving the full optimality assumed in classical rational choice models. Introduced by Herbert A. Simon in his 1957 work, this concept posits that humans and organizations cannot evaluate all possible alternatives exhaustively due to these bounds, leading instead to "satisficing"—selecting options that are good enough to meet aspirations rather than the absolute best. Simon argued that such limitations make comprehensive optimization computationally infeasible in complex environments, shifting focus from ideal rationality to realistic behavioral processes. In practice, bounded rationality manifests through the use of heuristics, which are simple, efficient rules of thumb that approximate optimal decisions by ignoring much of the available information. Pioneered in psychological research by Daniel Kahneman and Amos Tversky, these include the availability heuristic, where individuals assess probabilities based on how easily examples come to mind, and the anchoring heuristic, where initial information unduly influences subsequent judgments. Unlike expected utility maximization, which requires precise calculation of all outcomes and probabilities, heuristics enable rapid decisions but can introduce systematic biases, as they prioritize speed over accuracy in uncertain settings. Computational complexity further exacerbates these bounds in optimal decision-making, as many real-world problems—such as resource allocation or scheduling—involve NP-hard optimization tasks where finding the exact optimum scales exponentially with problem size.^[26] In such cases, decision agents resort to approximations like greedy algorithms, which iteratively select the locally best option without backtracking, trading potential optimality for tractable computation.^[26] Gerd Gigerenzer advanced this framework with fast-and-frugal heuristics, simple decision rules designed for ecologically rational performance in uncertain environments, often relying on one or few cues rather than comprehensive analysis. Research by Gigerenzer and colleagues demonstrates that these heuristics can match or exceed the predictive accuracy of complex statistical models in tasks like forecasting or classification, particularly when information is noisy or limited, highlighting their adaptive value over exhaustive optimization.

Applications and Examples

In economics, optimal decision-making is prominently applied in portfolio optimization, where investors seek to maximize expected utility by balancing return and risk. Harry Markowitz's mean-variance framework, introduced in 1952, formalizes this as maximizing expected return minus a risk penalty on variance, expressed as \max E - \frac{\lambda}{2} \operatorname{Var}(r), where E is the expected portfolio return, \operatorname{Var}(r) is its variance, and \lambda represents the investor's risk aversion.^[27] This approach underpins modern portfolio theory and is widely used in asset allocation by financial institutions to achieve efficient frontiers of risk-return trade-offs.^[28] In artificial intelligence and robotics, optimal decisions arise in reinforcement learning (RL), where agents learn policies to maximize long-term rewards in dynamic environments. The optimal policy \pi^* is defined as \pi^* = \arg\max_\pi E\left[\sum_{t=0}^\infty \gamma^t r_t\right], with \gamma as the discount factor and r_t as rewards at time t.^[29] This formulation enables applications such as autonomous vehicle navigation, where RL algorithms optimize paths under uncertainty by approximating value functions through trial and error. Seminal RL methods, like Q-learning, have been extended to robotic control tasks, achieving near-optimal performance in simulated and real-world settings.^[29] In medicine, optimal decision-making supports evidence-based treatment choices under uncertainty via decision trees, which structure probabilistic outcomes and utilities to identify strategies maximizing expected health benefits. These trees incorporate clinical trial data and patient-specific factors to evaluate options like surgery versus medication, quantifying trade-offs in survival rates or quality-adjusted life years.^[30] For instance, in oncology, decision trees have guided breast cancer treatment selections by folding in uncertainties from diagnostic tests, leading to protocols that align with guidelines from bodies like the American Society of Clinical Oncology.^[30] A classic example of optimal decision-making under uncertainty is the newsvendor problem in operations management, which balances the costs of overstocking (c_o) and understocking (c_u) against stochastic demand. The optimal order quantity q^* is given by q^* = F^{-1}\left(\frac{c_u}{c_u + c_o}\right), where F is the cumulative distribution function of demand.^[31] This critical fractile solution minimizes expected costs and is applied in supply chain settings, such as retail inventory for seasonal goods, where it informs ordering to avoid excess or shortages.^[32] Recent advancements since 2020 have integrated machine learning, particularly neural networks, for real-time expected utility approximation in complex decisions. Neural network-based methods, combined with Monte Carlo simulations, approximate utility functions in high-dimensional spaces, enabling scalable portfolio strategies that outperform traditional solvers in volatile markets.^[33] These techniques, such as logit neural-network utilities, enhance decision-making in dynamic scenarios by learning nonlinear preferences from data, with applications in algorithmic trading and personalized recommendations.^[34]

References

[1]
[PDF] Chapter 9 Basic Decision Theory - Steven M. LaValle
Before progressing to complicated decision-making models, first consider the sim- ple case of a single decision maker that must make the best decision. This ...
[2]
[PDF] THEORY OF GAMES AND ECONOMIC BEHAVIOR
The purpose of this book is to present a discussion of some funda,.- mental questions of economic theory which require a treatment different.
[3]
[PDF] Chapter 3 Decision theory
Decision theory determines the optimal action when consequences are uncertain, involving alternatives, events, probabilities, consequences, and a decision rule.
[4]
https://www.sciencedirect.com/science/article/pii/B9780123748829000241
[5]
Optimal Decision - an overview | ScienceDirect Topics
An optimal decision is defined as the action chosen by a decision maker that leads to the best or most preferable consequence among a set of actions, based on ...
[6]
[PDF] 8 Decision theory
Decision theory involves making decisions based on outcomes, measured by a loss function. The goal is to minimize the risk, which is the expected loss.<|control11|><|separator|>
[7]
Decision Theory - Stanford Encyclopedia of Philosophy
Dec 16, 2015 · First, normative decision theory is clearly a (minimal) theory of practical rationality. The aim is to characterise the attitudes of agents ...
[8]
[PDF] Chapter 9 Basic Decision Theory - Steven M. LaValle
A strategy simply consists of selecting the best action. What does it mean to be the “best” action? If U is finite, then the best action, u∗ ∈ U ...
[9]
Bounded Rationality - Stanford Encyclopedia of Philosophy
Nov 30, 2018 · Herbert Simon introduced the term 'bounded rationality' (Simon 1957b ... Some examples that we have seen thus far include Simon's satisficing ...
[10]
[PDF] Exposition of a New Theory on the Measurement of Risk
Apr 6, 2005 · BIOGRAPHICAL NOTE: Daniel Bernoulli, a member of the famous Swiss family of distin- guished mathematicians, was born in Groningen, January ...
[11]
https://press.princeton.edu/books/paperback/9780691130613/theory-of-games-and-economic-behavior
[12]
A Reconsideration of the Theory of Value. Part I - jstor
By J. R. HICKS and R. G. D. ALLEN. Part I. By J. R. HICKS. THE pure theory of exchange value, after a period of intensive study by economists of the generation ...
[13]
Exposition of a New Theory on the Measurement of Risk - jstor
EVER SINCE mathematicians first began to study the measurement of risk there has been general agreement on the following proposition: Expected values.
[14]
[PDF] Transportation Economics and Decision Making
Oct 8, 2013 · Utility Theory. According to utility maximization principle, there is a mathematical function U, called utility function, whose numerical ...<|control11|><|separator|>
[15]
[PDF] DRAFT Formulation and Analysis of Linear Programs
Sep 5, 2016 · an objective of maximizing profit, we have a linear program: maximize cx subject to. Ax ≤ b x ≥ 0. Note that the basic difference between ...
[16]
Exhaustive Search - an overview | ScienceDirect Topics
Exhaustive search is a high computational complex algorithm that checks every possibility to obtain the best solution.
[17]
[PDF] Origins of the Simplex Method - DTIC
It is fortunate back in 1947 when algorithms for solving linear programming were first being developed, that the column geometry and not the row geometry was ...
[18]
[PDF] DYNAMIC PROGRAMMING - Gwern.net
deterministic or stochastic origin which, mathematically speaking, means ... Bellman, ''Dynamic Programming and A. New Formalism in the Theory of Integral ...
[19]
[PDF] Decision Making Under Uncertainty - Stanford University
The aim of the first part of the book is to familiarize the reader with the foundations of probabilistic models and decision theory. The second part of the ...
[20]
[PDF] <em>The Foundations of Statistics</em> (Second Revised Edition)
The Foundations otf Statistics. LEONARD J. SAVAGE. Late Eugene Higgins Professor of Statistics. Yale University. SECOND REVISED EDITION. DOVER PUBLICATIONS, INC ...
[21]
[PDF] Risk Aversion in the Small and in the Large - John W. Pratt
Sep 4, 2001 · This paper concerns utility functions for money. A measure of risk aversion in the small, the risk premium or insurance premium for an arbitrary ...
[22]
Decision Analysis by Augmented Probability Simulation - PubsOnLine
We provide a generic Monte Carlo method to find the alternative of maximum expected utility in a decision analysis. We define an artificial distribution on ...<|control11|><|separator|>
[23]
Stochastic Approximation and Recursive Algorithms and Applications
Book Title: Stochastic Approximation and Recursive Algorithms and Applications. Authors: Harold J. Kushner, G. George Yin. Series Title: Stochastic Modelling ...
[24]
Reasoning and choice in the Monty Hall Dilemma (MHD) - NIH
The Monty Hall Dilemma (MHD) is a two-step decision problem involving counterintuitive conditional probabilities. The first choice is made among three equally ...
[25]
[PDF] NP-hard Optimization Problems - DSpace@MIT
Nov 7, 2001 · Definition 1 An optimization problem is NP-hard if the corresponding decision problem is NP-hard, i.e. a polynomial-time algorithm finding the ...
[26]
[PDF] Portfolio Selection Harry Markowitz The Journal of Finance, Vol. 7 ...
Sep 3, 2007 · The expected return- variance of return rule, on the other hand, implies diversification for a wide range of pi, aij.This does not mean that the ...
[27]
Portfolio Selection - jstor
change of apparent meaning would result. Variance is a well-known measure of dispersion about the expected. If instead of variance the investor was concerned ...
[28]
[PDF] Reinforcement Learning: An Introduction - Stanford University
We first came to focus on what is now known as reinforcement learning in late. 1979. We were both at the University of Massachusetts, working on one of.
[29]
The clinical decision analysis using decision tree - PMC - NIH
Clinical decision analysis (CDA) uses decision trees to apply evidence-based medicine for objective clinical decisions, overcoming uncertainty in complex ...
[30]
[PDF] 1 The Newsvendor Problem - Columbia University
Apr 6, 1995 · In this chapter we discuss the problem of controlling the inventory of a single item with stochastic demands over a single period.
[31]
[PDF] The Newsvendor Problem: Review and Directions for Future Research
The analysis in this section focuses on how the optimal order quantity in a newsvendor setting would be impacted if demand was a function of: (a) market price; ...
[32]
A Neural Network Monte Carlo Approximation for Expected Utility ...
This paper proposes an approximation method to create an optimal continuous-time portfolio strategy based on a combination of neural networks and Monte Carlo, ...
[33]
[PDF] Logit neural-network utility - HKU Scholars Hub
Jun 6, 2025 · We introduce stochastic choice models that feature neural networks, one of which is called the logit neural-network utility (NU) model.