Bid Lattices and the Value of Flexibility:A Granularity Ratio for Capacity Markets

arXiv:2608.08371 2026 Architecture 1 ideas extracted · analyzed Sep 1, 2026

What the math gives to ML

The paper provides a transferable mechanism for systems whose continuous allocation variables are implemented on a discrete lattice: a dimensionless granularity ratio controls the loss caused by discretization. Positive homogeneity shows that, when the objective and constraints scale together, absolute system size matters only through the ratio between one discrete unit and total capacity. In neural networks, this can be used to design and evaluate granularity-aware quantized action heads, mixture-of-experts routing capacities, or structured sparsity masks, with an explicit feasibility-preserving rounding rule and a predicted discretization-error envelope.

Ideas from this paper

Unverified 2026

Granularity-Aware Feasible Routing

Replace a continuous allocation or routing decision with a lattice-valued decision whose unit size is explicitly normalized by total capacity. Round allocations downward rather than to the nearest lattice point, preserving per-example capacity feasibility, and train or evaluate against the resulting granularity ratio rather than treating discretization as an implementation detail.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: Bid Lattices and the Value of Flexibility:A Granularity Ratio for Capacity Markets arXiv:2608.08371