Dynamic probabilistic decision networks

Abstract: A new type of decision networks is suggested and its operation is analyzed. The network nodes are represented by intelligent agents who can denote either some biological beings, like humans, or neurons of the brain, or the nodes of artificial intelligence. The specifics of the network are in the following: It is probabilistic in the sense that the choice, accomplished by each agent, is characterized by the related probability. It is dynamic, with the probabilities varying in time due to the exchange of information between the agents. It is affective, because the agents choose between alternatives by taking account of utility as well as of biases and emotions. In general, it is heterogeneous, being composed of the groups of agents with different properties, for instance having long-term memory and short-term memory. The network dynamics, caused by the information exchange, results in decision error decrease. The network operation is illustrated by the example starting with the Allais paradox, its resolution, and the decision error diminution in the process of decision dynamics with information exchange. Resorting to machine-learning techniques it is possible to regulate the behavior of the network agents forcing them to choose particular alternatives.

• The paper proposes a framework integrating utility and affective attraction into behavioral probabilities for decision-making, enhancing classical probabilistic models to include both rational and emotional factors.
• The study highlights the importance of stochasticity in decision formation using alternative techniques and achieves coherent results for anomalies such as the Allais paradox, which standard utility models fail to capture.
• The model's dynamic interaction simulations demonstrate that imitation and information exchange can influence affective biases, guiding probabilities over time and reflecting the complexity of social decision-making
• follow_up_questions

The paper proposes a dynamic probabilistic decision network (DPDN) in which network nodes are probabilistic agents whose choices combine utility, affective attraction, information exchange, imitation, and memory. The model is intended to cover heterogeneous populations of human decision makers, groups of biological agents, neurons, and artificial agents subject to intrinsic variability. Its central claim is that decision-making should not be represented as deterministic maximization of a utility or value functional. Instead, rational evaluation and affective influence jointly determine a behavioral probability that evolves as agents repeatedly interact. The proposed framework and its application to the Allais paradox are presented in "Dynamic probabilistic decision networks" (2609.03632).

Model motivation and conceptual structure

The paper positions the DPDN against two classes of existing approaches. Expected utility theory provides a normative deterministic prescription based on maximizing utility, whereas non-expected-utility and affective models typically modify the value functional by adding parameters intended to represent behavioral deviations. According to the paper, these approaches are limited because they are predominantly descriptive, require case-specific parameter fitting, and retain deterministic choice as their basic mechanism.

The DPDN instead treats stochasticity as intrinsic to decision formation. The argument draws on evidence that neural activity, valuation, and choice exhibit variability even when the decision maker faces the same alternatives repeatedly. This stochasticity is not attributed solely to incomplete information; it is modeled as a structural property of the decision process. The network therefore assigns each agent a probability of selecting each alternative and allows that probability to change through communication.

The approach is explicitly classical rather than quantum. The authors reject quantum-cognitive formulations for macroscopic alternatives and biological agents on the grounds that the brain is treated as a classical physical system and that quantum formalisms introduce parameters and mathematical objects without an independently specified empirical basis. The resulting theory is consequently built from classical probabilities, Kullback–Leibler information, memory kernels, and discrete-time dynamical equations.

Behavioral probability and affective choice

For an alternative $A_n$, the behavioral probability is decomposed additively as

$p(A_n) = f(A_n) + q(A_n),$

where $f(A_n)$ is the utility factor and $q(A_n)$ is the attraction factor. The utility factors form a normalized probability distribution, while the attraction factors satisfy the alternation law

$\sum_n q(A_n)=0.$

This construction ensures that affective effects redistribute probability among alternatives rather than create or remove total probability. The admissible range is $-f(A_n)\leq q(A_n)\leq 1-f(A_n)$, which guarantees that behavioral probabilities remain within $[0,1]$.

The additive form is justified by three considerations: the psychological distinction between affective and rational processes, their purportedly partially differentiated neural substrates, and the requirement that the model reduce to rational decision theory when emotional influence vanishes. The formulation is structurally simple, but it also makes a strong modeling assumption: utility and attraction enter linearly and on the same probability scale. The paper does not derive this linearity from a behavioral generative model or estimate it through an independent identification procedure.

Utility factors

The utility factor is obtained by minimizing a Kullback–Leibler information functional subject to normalization and utility constraints. Given a prior distribution $f_0(A_n)$, the resulting posterior has an exponential-tilting form,

$$f(A_n)= \frac{f_0(A_n)\exp[U(A_n)]} {\sum_m f_0(A_m)\exp[U(A_m)]}.$$

The prior is specified using a Luce-style attribute model. For nonnegative expected utilities, the attribute is taken to be $U(A_n)$; for negative utilities, it is taken to be $p(A_n) = f(A_n) + q(A_n),$0. In the neutral-belief case, the paper sets the posterior equal to the prior. This produces the simpler normalized utility rule used in the numerical examples.

The information-theoretic derivation gives the utility component a formal basis, but its empirical content depends on several choices that are not independently validated in the paper: the prior attributes, the utility scale, the treatment of negative utilities, and the belief parameter. In particular, the exponential expression is sensitive to the scale of $p(A_n) = f(A_n) + q(A_n),$1, while the subsequent examples often use normalized expected utilities directly.

Attraction factors and the quarter law

The attraction factor is treated as a random variable reflecting emotions, biases, and contextual attractiveness. When individual information is unavailable, the paper adopts a non-informative estimate based on the admissible interval. This yields typical positive and negative attraction values of approximately $p(A_n) = f(A_n) + q(A_n),$2 and $p(A_n) = f(A_n) + q(A_n),$3, summarized by the proposed quarter law:

$p(A_n) = f(A_n) + q(A_n),$4

For multiple alternatives, the attraction factors are ordered by attractiveness and assigned values satisfying normalization and a fixed average magnitude. The resulting expressions produce, for example,

• two alternatives: $p(A_n) = f(A_n) + q(A_n),$5;
• three alternatives: $p(A_n) = f(A_n) + q(A_n),$6;
• four alternatives: $p(A_n) = f(A_n) + q(A_n),$7.

The quarter law is one of the paper’s strongest empirical claims. Reanalysis of the 18 lottery problems associated with Kahneman and Tversky gives an aggregate experimental attraction magnitude of $p(A_n) = f(A_n) + q(A_n),$8, compared with the predicted $p(A_n) = f(A_n) + q(A_n),$9. A second dataset containing 134 decision tasks—27 gain-only, 19 loss-only, and 21 mixed lotteries, each evaluated twice—produces an aggregate value of $f(A_n)$0. These results are presented as evidence that affective deviations can be predicted at the aggregate level without fitting a separate parameter for every problem.

The evidence supports approximate aggregate calibration, but it does not establish that the attraction factors are individually non-informative, nor that the quarter law is invariant across populations, elicitation procedures, utility scales, or experimental contexts. The reported agreement is also sensitive to the definition of lottery quality and to the assignment of attraction signs.

Lottery quality and the Allais paradox

For explicit lotteries $f(A_n)$1, the paper defines lottery quality as

$f(A_n)$2

The exponential weighting of probabilities is intended to represent the claim that decision makers attend disproportionately to payoff probabilities relative to payoff magnitudes. The base $f(A_n)$3 is obtained from a calibration argument involving a tenfold payoff increase and a probability reduction. The paper then orders lotteries by $f(A_n)$4 and assigns larger attraction factors to lotteries with greater quality.

This mechanism resolves the standard Allais pattern in the model’s terms. For the first pair,

$f(A_n)$5

the normalized utility factors are reported as $f(A_n)$6 and $f(A_n)$7. Expected utility therefore favors $f(A_n)$8. However, the quality scores are $f(A_n)$9 and $q(A_n)$0, so $q(A_n)$1 receives the positive attraction factor and $q(A_n)$2 the negative one. The behavioral probabilities become

Lottery	Utility factor	Attraction factor	Behavioral probability
$q(A_n)$3	0.418	0.25	0.668
$q(A_n)$4	0.582	-0.25	0.332

Thus the model predicts preference for the certain outcome, matching the qualitative Allais response while retaining a probabilistic representation.

For the second pair,

$q(A_n)$5

the reported utility factors are $q(A_n)$6 and $q(A_n)$7, while the quality scores are $q(A_n)$8 and $q(A_n)$9, respectively. Both rational utility and affective attraction favor $\sum_n q(A_n)=0.$0. The apparent contradiction in the standard formulation therefore disappears because the model does not impose a single deterministic utility ranking as the complete theory of choice.

The resolution is operational rather than axiomatic. It reproduces the observed preference pattern by introducing an affective term whose ordering is determined by a specially constructed lottery-quality functional. The paper does not compare this functional against prospect-theoretic alternatives under held-out predictions, and the fixed exponential base remains a substantive assumption rather than an empirically estimated quantity in the presented analysis.

Dynamic network equations

After the initial independent decisions, agents exchange information and may imitate one another. Agent $\sum_n q(A_n)=0.$1 has a time-dependent behavioral probability $\sum_n q(A_n)=0.$2, utility factor $\sum_n q(A_n)=0.$3, and attraction factor $\sum_n q(A_n)=0.$4. The update rule is

$\sum_n q(A_n)=0.$5

where $\sum_n q(A_n)=0.$6 controls imitation. With no imitation, an agent follows its own current utility-plus-attraction state. With maximal imitation, it follows the average current state of the other agents.

Emotional influence decays through memory:

$\sum_n q(A_n)=0.$7

The memory variable accumulates information gain from interactions. The information gain from agent $\sum_n q(A_n)=0.$8 to agent $\sum_n q(A_n)=0.$9 is defined by the KL divergence

$-f(A_n)\leq q(A_n)\leq 1-f(A_n)$0

Long-term memory accumulates information over all previous steps, whereas short-term memory retains only the latest interaction. The model can therefore represent heterogeneous populations whose responses differ not only in initial affective parameters but also in temporal integration.

For mobile human or animal societies, the authors argue that interaction strengths should be independent of spatial distance because agents can communicate over arbitrary distances. The resulting all-to-all coupling is described as an exact consequence of the social setting rather than a mean-field approximation. This interpretation is debatable: communication access does not imply equal influence, equal exposure, or homogeneous interaction strength. The model effectively assumes complete and symmetric mixing after normalization, although the formulation allows agent-specific interaction amplitudes.

The collective probability is a population-weighted sum of group probabilities. Consequently, the model distinguishes consensus within or between groups from aggregate population preference. A stationary state corresponds to stable decision probabilities; persistent oscillations represent continuing hesitation.

Dynamics of the Allais example

The dynamical analysis considers two groups facing the first Allais pair. The long-term-memory group begins with $-f(A_n)\leq q(A_n)\leq 1-f(A_n)$1, while the short-term-memory group has $-f(A_n)\leq q(A_n)\leq 1-f(A_n)$2 varying over the admissible interval. Both groups use the same utility factor, $-f(A_n)\leq q(A_n)\leq 1-f(A_n)$3, and the imitation parameters are either negligible or maximal.

When imitation is weak or absent, the long-term-memory group generally converges toward the utility factor, with $-f(A_n)\leq q(A_n)\leq 1-f(A_n)$4. The short-term-memory group retains a residual affective bias, whose sign depends on its initial attraction:

• for $-f(A_n)\leq q(A_n)\leq 1-f(A_n)$5, the short-term group converges below $-f(A_n)\leq q(A_n)\leq 1-f(A_n)$6;
• for $-f(A_n)\leq q(A_n)\leq 1-f(A_n)$7, both groups converge to $-f(A_n)\leq q(A_n)\leq 1-f(A_n)$8;
• for $-f(A_n)\leq q(A_n)\leq 1-f(A_n)$9, both groups converge to a common value above $[0,1]$0;
• for $[0,1]$1, the long-term group approaches $[0,1]$2, while the short-term group remains above $[0,1]$3.

Representative numerical trajectories show substantial attenuation of emotional influence. For example, initial values $[0,1]$4 and $[0,1]$5 evolve approximately to $[0,1]$6 and $[0,1]$7; with $[0,1]$8, the corresponding values are $[0,1]$9 and $f_0(A_n)$0. For positive initial attraction, $f_0(A_n)$1 produces $f_0(A_n)$2 and $f_0(A_n)$3, while the associated short-term probability approaches $f_0(A_n)$4. These results instantiate the paper’s principal dynamical claim: repeated information exchange reduces emotional deviations, especially for agents with cumulative memory.

Strong imitation produces a qualitatively different redistribution of influence. The asymmetry between long- and short-term memory means that the two trajectories are not simply identical under group exchange, but their roles are partly interchanged. For negative emotions, the group with long-term memory can remain below $f_0(A_n)$5, while the short-term-memory group approaches $f_0(A_n)$6. For $f_0(A_n)$7, the reported limiting probabilities are approximately $f_0(A_n)$8 and $f_0(A_n)$9. At $$f(A_n)= \frac{f_0(A_n)\exp[U(A_n)]} {\sum_m f_0(A_m)\exp[U(A_m)]}.$$0, they become approximately $$f(A_n)= \frac{f_0(A_n)\exp[U(A_n)]} {\sum_m f_0(A_m)\exp[U(A_m)]}.$$1 and $$f(A_n)= \frac{f_0(A_n)\exp[U(A_n)]} {\sum_m f_0(A_m)\exp[U(A_m)]}.$$2.

A particularly important boundary occurs for strong imitation and very strong positive emotion. In the interval approximately $$f(A_n)= \frac{f_0(A_n)\exp[U(A_n)]} {\sum_m f_0(A_m)\exp[U(A_m)]}.$$3, the long-term-memory group exhibits permanent oscillations while the short-term group converges to $$f(A_n)= \frac{f_0(A_n)\exp[U(A_n)]} {\sum_m f_0(A_m)\exp[U(A_m)]}.$$4. The oscillations are interpreted as persistent indecision generated by delayed interaction between strong imitation and asymmetric memory. This result qualifies the paper’s broader claim that information exchange suppresses affective deviations: information exchange can instead destabilize convergence when imitation is sufficiently strong and memory structures are heterogeneous.

The exact relation

$$f(A_n)= \frac{f_0(A_n)\exp[U(A_n)]} {\sum_m f_0(A_m)\exp[U(A_m)]}.$$5

implies that when $$f(A_n)= \frac{f_0(A_n)\exp[U(A_n)]} {\sum_m f_0(A_m)\exp[U(A_m)]}.$$6, group probabilities become equal after one update, regardless of their initial difference. This is a clear algebraic consensus condition. It does not, however, guarantee convergence to a rational or socially desirable probability; it only enforces equality of the group-level updates.

Regulation through machine learning

The final mechanism introduces external regulation of utility factors. The utility of group $$f(A_n)= \frac{f_0(A_n)\exp[U(A_n)]} {\sum_m f_0(A_m)\exp[U(A_m)]}.$$7 is modified through a control variable $$f(A_n)= \frac{f_0(A_n)\exp[U(A_n)]} {\sum_m f_0(A_m)\exp[U(A_m)]}.$$8, and the control variable is updated by gradient descent:

$$f(A_n)= \frac{f_0(A_n)\exp[U(A_n)]} {\sum_m f_0(A_m)\exp[U(A_m)]}.$$9

where $U(A_n)$0 is a prescribed target probability and $U(A_n)$1 is a learning rate. A clipping or retraction function maintains probabilities and utility factors within $U(A_n)$2.

The numerical examples show convergence to $U(A_n)$3, the utility factor associated with the Allais setup, even when initial attraction factors differ across groups. They also show convergence to $U(A_n)$4, forcing all agents to choose the first alternative with probability one. Small learning rates produce slow convergence; excessive rates generate instability. The simulations therefore demonstrate controllability of the model under the assumed update equations.

This section makes a strong and potentially contradictory claim relative to the paper’s earlier distinction from machine learning: machine learning is initially characterized as a procedure for selecting actions under fixed data, whereas the proposed controller uses gradient descent to manipulate the utility component of a social decision process. The method does not learn a causal model of preference formation. It performs closed-loop control of the model’s latent utility parameters to achieve a predefined probability target. The distinction is conceptually useful, but the resulting capability is more accurately described as parameter control or policy steering than as unconstrained machine learning.

Limitations and open questions

The paper’s principal limitation is that its most consequential components are assumed rather than independently identified. The additive decomposition $U(A_n)$5, the quarter-law prior, the lottery-quality function with base $U(A_n)$6, the mapping from KL information gain to memory accumulation, and the exponential decay of attraction all impose specific structures on behavior. The empirical tests primarily assess aggregate agreement and reproduce known qualitative patterns; they do not provide participant-level estimation, out-of-sample prediction, uncertainty quantification, or systematic comparison with prospect theory and other stochastic choice models.

The dynamics also rely on restrictive interaction assumptions. All-to-all coupling is appropriate for an idealized freely communicating population only if exposure and influence are sufficiently homogeneous. Real networks exhibit directed communication, community structure, selective attention, unequal influence, endogenous network formation, and correlated observations. These features are not analyzed. The model further assumes nonnegative information accumulation, so emotional attenuation is monotonic in the magnitude of $U(A_n)$7; mechanisms for affective amplification, misinformation, strategic signaling, or persistent polarization are not developed beyond the imitation-induced regimes.

Several formal issues in the supplied manuscript require clarification before the model can be evaluated as a reproducible dynamical system. Some symbols are corrupted in the source text, including the imitation parameter and learning rate, and several displayed equations contain missing operators or malformed limits. The numerical stability domains, convergence criteria, and parameter values used to generate the figures are not fully specified. The claim that the strong-imitation oscillatory regime is permanent would require an explicit stability or bifurcation analysis rather than graphical inspection alone.

The regulation mechanism leaves an important normative question open: if the target probability is externally prescribed, the controller can force behavior independently of whether the target corresponds to valid utility, informed consent, welfare, or collective preference. The paper establishes controllability within its equations, but not legitimacy or robustness of the control objective.

Conclusion

"Dynamic probabilistic decision networks" (2609.03632) develops a classical multi-agent framework in which probabilistic choice combines normalized utility factors with affective attraction factors and evolves through imitation, information exchange, and heterogeneous memory. Its empirical centerpiece is the approximate quarter-law relation, with aggregate attraction magnitudes of $U(A_n)$8 and $U(A_n)$9 reported against the predicted value $p(A_n) = f(A_n) + q(A_n),$00. In the Allais example, the affective term resolves the observed preference reversal, while the dynamic model predicts attenuation of emotional influence for cumulative-memory agents and oscillatory indecision under sufficiently strong imitation. The paper’s final controller demonstrates that prescribed decision probabilities can be obtained by adapting utility parameters. The framework is analytically coherent as a phenomenological model, but its predictive status depends on validating its structural assumptions, specifying its dynamics reproducibly, and testing it against individual-level and out-of-sample behavioral data.