Decision Aggregation Module

• Decision Aggregation Module is a computational construct that synthesizes asynchronous individual decisions into a single collective verdict using threshold-based rules.
• It employs rigorous mathematical formulations such as binomial probability and cumulative decision models to analyze accuracy and expected decision time.
• The design enables a practical speed–accuracy tradeoff by tuning the threshold parameter, making it suitable for applications in distributed detection and multi-agent systems.

A Decision Aggregation Module (DAM) is a computational construct that synthesizes multiple individual decisions, hypotheses, or signals into a single collective output. DAMs are pivotal in distributed detection, collective decision-making, multi-agent hypothesis testing, and decentralized control—distilling asynchronous, independent information streams into a robust group verdict. Central to DAM design is the rule that determines when enough consensus has been reached to commit to a group decision, balancing reliability, decision speed, and computational tractability. Threshold-based DAMs, as studied in "Accuracy and Decision Time for Sequential Decision Aggregation" (Dandach et al., 2010), exemplify rigorous sequential fusion in binary hypothesis scenarios.

1. Model Structure and Mathematical Foundations

A canonical DAM comprises $N$ identical agents (Sequential Decision Makers, SDMs) solving a binary hypothesis test $H\in\{H_0, H_1\}$ using a sequential stopping rule. Each agent $i$ observes information independently, stops at time $\tau_i$ and emits a decision $\Delta_i \in \{0,1\}$. The DAM receives the tuple $(\tau_i,\Delta_i)$ for each agent, generally asynchronously. Key distributions are:

• $F_1(t) = P[\tau_i\leq t,\, \Delta_i=1|H_1]$ (CDF of stopping-deciding for $H_1$ under $H_1$)
• $F_0(t) = P[\tau_i\leq t,\, \Delta_i=0|H_0]$ (analogous for $H_0$ under $H_0$)
• $p_1(t) = F_1(t)-F_1(t-1)$, $p_0(t) = F_0(t)-F_0(t-1)$ (decision probability mass at time $t$)

The DAM maintains integer counters $C_1(t)$ and $C_0(t)$ for the number of agents with $\Delta_i=1$ or $\Delta_i=0$ at or before time $t$.

2. Threshold-Based Aggregation Rule

DAM decision logic is governed by a threshold parameter $k$ ($1\leq k\leq N$). At each time $t$, the fusion center decides:

• $D(t)=H_1$: First $t$ when $C_1(t)\geq k$ & $C_1(t)>C_0(t)$
• $D(t)=H_0$: First $t$ when $C_0(t)\geq k$ & $C_0(t)>C_1(t)$
• Otherwise, wait (no decision)

This protocol ensures that a strong-enough majority in sequential agent outputs is required before group commitment, mitigating early erroneous signals.

3. Dynamic Probabilistic Analysis

Let $P_j(t)$ denote the probability that $j$ agents have favored $H_1$ by time $t$: $P_j(t) = \binom{N}{j}F_1(t)^j [1-F_1(t)]^{N-j}$ The cumulative probability of a correct collective $H_1$ decision by time $t$ is: $P_C(t) = \sum_{j=k}^N P_j(t)$

The DAM's decision time random variable $T_k$ (first time $t$ with $C_1(t)\geq k$ or $C_0(t)\geq k$) under $H_1$ has CDF $P[T_k\leq t]=P_C(t)$ and pmf $f_{T_k}(t)=P_C(t)-P_C(t-1)$. The expected group decision time is

$E[T_k] = \sum_{t=0}^\infty [1-P_C(t)]$

These formulas yield explicit, time-indexed profiles of reliability and latency.

4. Special Case Scalings: Fastest and Majority Rules

DAM parameterization admits essential operational regimes:

Rule	Threshold $k$	Decision time profile	Accuracy scaling
Fastest	$k=1$	$T_1 = \min_i \tau_i$	$\to \min\{t : F_1(t)>0\}$ for large $N$
Majority	$k=\lceil N/2\rceil$	$E[T_{k}] \to$ smallest $t$ with $F_1(t)>\frac12$	$\to$ exponential in $N$ (error decays fast if $p<\frac12$)

The fastest rule relies on the earliest agent (highest risk of error for large $N$), while majority rules exponentially increase reliability as $N$ grows, at the cost of longer group decision time.

5. Computational Complexity and Implementation

At each discrete time $t$, evaluating DAM metrics requires a binomial sum $O(N)$ per $t$. To track up to a horizon $T_{\max}$, total cost is $O(N \cdot T_{\max})$, ensuring scalability even with large sensor populations or time horizons.

Implementation for the fusion center can be written as:

Initialize C0←0, C1←0, t←0 loop t←t+1 for each agent i reporting at time t: if Δi==1 then C1←C1+1 else C0←C0+1 end if C1> C0 and C1≥k: return D=H1 at time t if C0> C1 and C0≥k: return D=H0 at time t end loop

Parameter selection requires precomputing $F_1(t), F_0(t)$ for each $t$ and threshold $k$, then choosing the minimal $k$ yielding the target reliability $P_C$ with minimal expected decision time $E[T_k]$.

6. Speed–Accuracy Tradeoff and Pareto-Optimal Design

Increasing threshold $k$ directly improves reliability $P_C(\infty)$ but incurs greater latency $E[T_k]$. One plots the tradeoff $(E[T_k], P_C(\infty))$ for $k=1,\dots,N$ to select Pareto-optimal operating points. Notably, DAM design can flexibly target system constraints, e.g., hard deadlines or error budgets, by adjusting $k$.

7. Contextual Significance and Cognitive Links

Threshold DAMs provide analytic connections to the cognitive literature on response aggregation and collective accuracy (Dandach et al., 2010). They structurally resemble animal and human group decision heuristics and serve as prototypes for scalable distributed fusion in engineering, sensor networks, and organizational decision-making. The analytic scaling laws of accuracy and decision time with $N$ and $k$ define baseline expectations and limitations for any practical DAM deployment.

Conclusion: The threshold-based Decision Aggregation Module is a mathematically rigorous, computationally efficient framework for synthesizing independent sequential agent outputs into a final collective verdict, balancing reliability, latency, and implementation cost. Its explicit formulas for accuracy, expected decision time, and strategic tradeoffs provide analytic guarantees and practical guidance for both theoretical analysis and real-world system engineering (Dandach et al., 2010).