Capacity Window Assignment¶
Coordination protocol — instantiates Reflexive Forecast Impact Governance
Pre-assigns actors to specific time or capacity windows instead of letting them all self-select from the forecast, so a published projection of scarcity or slack doesn't trigger a synchronized stampede that invalidates it.
A forecast of when capacity will be scarce or slack invites everyone to move toward the same slack window — which recreates scarcity there and defeats the forecast. Capacity Window Assignment governs this by allocating actors to windows rather than broadcasting one signal they all optimize against: each actor receives, or bids for, a specific slot, held in place by commitment or price. Its defining move is converting a one-to-many broadcast that everyone reacts to identically into a many-to-many assignment whose slots are coordinated, so the aggregate response is shaped by design instead of by a race to the same point.
Example¶
An electric utility forecasts that overnight demand will be low and daytime demand high. Publish that raw and every EV owner sets charging to 2 a.m. — manufacturing a new 2 a.m. peak the forecast never predicted. Instead the utility runs Capacity Window Assignment: enrolled vehicles are assigned staggered charging windows across the trough — some at 11 p.m., some at 1 a.m., some at 3 a.m. — with off-peak pricing as the incentive anchor and a smart-charger commitment that honors the assigned slot. A channel map of which loads can actually shift (and which are fixed) decides who can be placed where. The outcome is a trough that fills smoothly rather than spiking, and a load forecast that stays valid because the response was allocated rather than self-selected. The projection survives being acted on.
How it works¶
- Map the reaction channels. Enumerate which actors or loads can genuinely move, and through what mechanism — an app, a tariff, a contract.
- Assign across the channels. Distribute windows so the aggregate response matches available capacity instead of piling onto a single focal point.
- Anchor each slot. Bind the assignment with a commitment or incentive strong enough to hold against the temptation to defect to the "best" window.
- Keep slack and jitter. Leave buffer capacity and randomize enough that the assignment scheme does not itself become a new focal point to game.
Tuning parameters¶
- Assignment granularity — per-actor slots versus coarse cohorts. Finer control coordinates better but adds overhead and raises fairness questions.
- Bindingness — a soft suggestion, a priced slot, or a contractually enforced window. Harder binding coordinates more reliably but removes flexibility and can breed resentment.
- Incentive strength — how large the reward or penalty anchoring the slot. Too weak and actors defect to the focal window; too strong and you overpay for compliance you would have gotten cheaply.
- Slack and randomization — how much buffer and jitter is built in so the scheme resists both gaming and forecast error.
- Reassignment cadence — a static assignment versus dynamic reallocation as conditions move.
When it helps, and when it misleads¶
Its strength is that it is the response-side fix for a self-defeating capacity forecast: it heads off the synchronized stampede a naked projection provokes, and it makes the forecast's own accuracy robust to being believed.
Its failure mode is that an allocation built from observed behavior stops working once the allocation changes that behavior — the Lucas critique[n1] in miniature; the elasticities you assigned against shift under the scheme itself. It also strains on fairness: allocation that privileges some actors invites gaming, appeals, and quiet defection, and rigid windows override genuine need. The classic misuse is treating the assignment as permanent optimization rather than a coordinating convention, freezing yesterday's usage pattern into a rule. The discipline is to re-estimate responses under the scheme, keep slack for defectors and error, and revisit the assignment as behavior adapts to it.
How it implements the components¶
Capacity Window Assignment realizes the response-shaping side of the archetype — the components that turn "people will react" into "here is how the reaction is coordinated":
response_guidance_layer— the assignment is the guidance: each actor's window is the instruction it acts on.commitment_or_incentive_anchor— the price or contract that binds an actor to its slot against the pull of the focal window everyone else would otherwise pick.reaction_channel_map— the map of which actors can move through which channel, over which the allocation is drawn.
It does not model how the audience will react in the first place — the Reaction Channel Premortem does that — and it neither records the release decision (Forecast Release Decision Log) nor sets the re-forecasting rhythm (Forecast Update Cadence).
Related¶
- Instantiates: Reflexive Forecast Impact Governance — it is the mechanism that keeps a capacity forecast from defeating itself through synchronized response.
- Consumes: the Reaction Channel Premortem's audience-reaction model, to know which actors will move and how far.
- Sibling mechanisms: Response Smoothing Instruction · Reaction Channel Premortem · Forecast Update Cadence · Forecast-as-Intervention Label · Staged Disclosure Protocol
Editorial Notes¶
Form Classification¶
Form family: Decision, Gate & Allocation
Rationale: Pre-assigns actors to specific time or capacity windows instead of letting them all self-select from the forecast, so a published projection of scarcity or slack doesn't trigger a synchronized stampede that invalidates it, making its operative form a case-specific gate, selection, routing, prioritization, or disposition decision.
Independent corroboration: The frozen evidence defines Capacity Window Assignment as 'Pre-assigns actors to specific time or capacity windows instead of letting them all self-select from the forecast, so a published projection of scarcity or slack doesn't trigger a synchronized stampede that invalidates it', so its operative form is Decision, Gate & Allocation.
Review outcome: Independent reviewer agreement; high confidence.
Origin Attribution¶
Primary origin: Operations Research
Origin pattern: Convergent development
Present-day reach: Multi-domain
Rationale: Scheduling and allocation research established assigning actors to capacity windows to prevent synchronized self-selection.
Related originating lineages:
- Economics & Finance — Scarcity allocation and opportunity-cost analysis contribute prioritization among competing windows.
- Public Administration & Policy — Permitting and public-resource scheduling contribute eligibility, fairness, and protected-use windows.
Review resolution: Operations research is the agreed primary lineage because assigning finite time windows is a scheduling and allocation problem. Economics contributes scarcity pricing and public administration contributes permit and public-access windows, so the record is convergent.
Review outcome: Reconciled after independent review; high confidence.
Notes¶
Capacity Window Assignment and the Response Smoothing Instruction both act on the response, but differently: smoothing broadcasts an aggregate "spread out" nudge and lets actors self-place, whereas this protocol issues specific per-actor slots. Use assignment when collisions are costly and the actors are enumerable and bindable; use smoothing when they are not.
[n1] Robert Lucas's argument that relationships estimated from historical behavior break down when a policy exploits them, because the policy itself changes how people behave. An allocation tuned to the response patterns observed before the scheme is the same trap: the assignment alters the very elasticities it was fitted to. ↩