Stipulations ($\mathbb{S}$)
$\mathbb{C}$: Cardinality (Users)
Dyadic (2)
$\mathbb{I}$: Identity (Roles)
Standard (A/B)
$\mathbb{M}$: Mobility ($d\vec{r}/dt$)
Fixed
$\mathbb{T}_{op}$: Topology (Caste)
Symmetric
$\mathbb{T}_{em}$: Temporality
Scalar (Real)
$\mathbb{K}$: Knowledge (CSI)
Perfect
$\mathbb{E}$: Environment
Anechoic
Algorithm Legend
Least Squares (Analytic)
Kalman Filter (Control)
Naive Bayes (Probabilistic)
Deep Neural Net (DNN)
CNN (Spatial Fingerprint)
RNN / LSTM (Temporal)
Reinf. Learning (Agent)
The Efficiency Frontier Top-Left = Optimal
Y-Axis: Performance (Throughput $\eta_{SE}$). X-Axis: Cost (Complexity/Energy $\mathcal{O}$).
The Winner
Least Squares
In a static, anechoic environment, simple geometry is instant and perfect.
Dominant Complexity
\( O(1) \)
Current computational burden.
💡 Radha's Insight
"Since stipulations are strict, we don't need AI. We can solve this with a calculator."