v1.0.0-candidate: Exact optimal dispatching to two fluid queues

Unrefereed AI-assisted research candidate. Exact optimal dispatching to two fluid queues: closed form, heavy traffic and stochastic evidence (author: Anonymous).

• Closed-form optimal value, feedback policy and unique optimal path for the two-server fluid dispatching problem of Xie, Hyytiä and Righter (ACM SIGMETRICS PER 53(4), 2026), for every nondegenerate mean-one size law and load below one.
• Their relative-imbalance conjecture is proved as posed (sizes with a density) and extended to all nondegenerate laws; it fails for deterministic sizes.
• Heavy-traffic limit (1 − ρ)V → P̄x², correcting a factor in the source's Proposition 3 and matching the CARD constant of Xie, Grosof and Scully (stochastic link heuristic).
• Exact rational controllers, certified approximations, Wasserstein stability, a Pareto enclosure and a noisy-estimate bound.
• Seeded simulations of the stochastic two-server queue: numerical evidence only; no policy dominates in every case.

DOI: https://doi.org/10.5281/zenodo.23586955 · Page: https://evidencepress.org/releases/fluid-queue-optimal-dispatch/

Assurance: written proofs; deterministic verifier replayed byte for byte from the frozen archive; semantic negative controls; internal AI-assisted review, AI-assisted adversarial audits and a re-review. Not peer review, independent reproduction or formal verification. Text and data CC0-1.0; code MIT.