Allocation¶
Core Idea¶
Allocation is the assignment of a limited supply across competing claimants or uses, subject to a feasibility constraint and guided by some criterion, a structure Koopmans (1951) first formalized through the activity-analysis framework that became the backbone of operations-research treatments of resource assignment. [1] Whenever a finite resource must be divided among more demands than it can fully satisfy, the structure is the same: decide who or what gets how much. The act of allocation is distinct from deciding that the resource is scarce, from finding the optimal division, and from the incentives that surround it — it is the bare assignment itself.
The prime answers a recurring question that arises across every domain where finite stuff must flow to multiple sinks: given that not everyone can have all they want, what mapping from claimants to shares should be enacted? Crucially, the prime names the act and its structural conditions without prescribing the criterion. Equal split, priority queue, market price, lottery, and need-weighted division all instantiate allocation; the prime is what they share, not what distinguishes them. This separation — between the universal structural skeleton and the domain-specific criterion that fills it — is what makes allocation portable across substrates that share no institutions, no agents, and no goals, an abstraction Dantzig (1963) pushes furthest in the linear-programming treatment of the transportation problem. [2]
How would you explain it like I'm…
Sharing the Pizza
Splitting Limited Stuff
Assigning Scarce Resources
Structural Signature¶
Allocation encodes a structural pattern with five named roles: limited supply → competing claimants → feasibility constraint → assignment mapping → selection criterion. It separates two states (the unassigned pool and the apportioned pool) and specifies the work that must happen between them: a function from claimants to non-negative shares that respects the feasibility envelope.
Recurring features:
- Limited supply meeting competing claims
- Feasibility constraint bounding the assignment from above
- Mapping from claimants to shares
- Selection criterion that picks among feasible assignments
- Asymmetric topology — many demands routed through one constrained pipe
- Substitution between criteria holding supply and claimants fixed
The structural insight is robust: an OS scheduler, an ICU triage protocol, a portfolio rebalance, a forest tree apportioning photosynthate, and a spectrum auction all exhibit the same role-vocabulary, a cross-substrate recurrence Hurwicz and Reiter (2006) trace through their general theory of resource-allocation mechanisms across markets and central planners alike. [3] Once the five roles are visible, change-of-criterion reasoning becomes available: hold supply and claimants fixed, swap the rule, and watch the assignment shift. That single substitution exposes the values embedded in the criterion.
What It Is Not¶
Allocation is not the same as having a limited resource. A desert has limited water; that is a condition, not an allocation. Allocation begins only once that finite supply must be apportioned among multiple demands — once the question shifts from "how much do we have?" to "who or what gets how much?" A solo hiker drinking from her own canteen faces scarcity but not allocation; the same hiker rationing the canteen across three companions over two days is allocating. The structural prime requires plural claimants contending for shares of a bounded supply.
Nor is allocation the same as choosing well. The prime describes the act of dividing; it does not specify that the division is good, fair, efficient, or even coherent. A landlord who hands out apartments by drawing names from a hat is allocating; so is one who runs a careful applicant-scoring system; so is one who simply rents to the first person who calls. All three perform allocation. The quality of the criterion — whether it tracks merit, need, willingness-to-pay, or pure chance — is a separate evaluative question layered on top of the bare assignment.
Allocation also does not require agents, intentions, or institutions. The cleanest substrate-furthest case is biological: a plant has a finite photosynthetic budget and partitions it across leaves, roots, stem, defense compounds, and seeds, an apportionment Cody (1966) and the life-history literature treat as the canonical "principle of allocation" in evolutionary ecology. [4] No agent chooses; no institution administrates; no negotiation occurs. Yet every structural role is occupied — supply (photosynthate), claimants (organ systems), feasibility (energy balance), mapping (developmental and hormonal control), criterion (fitness under selection). The prime sits beneath the agentic vocabulary it is most often discussed in.
Finally, allocation is not the same as distributing in the casual sense of "spreading out" or "delivering." A mail carrier distributes letters but does not allocate them in the structural sense; the letters are addressed, the supply is not bounded by capacity contended for by multiple claimants, and no feasibility constraint is binding. Allocation always involves contention — the supply cannot meet all claims, so the assignment is non-trivial.
Broad Use¶
Economics: Allocation of goods, capital, labor, and time across uses; budget allocation in firms, households, and governments. Walrasian general-equilibrium theory treats price-mediated allocation as the canonical mechanism, but the same structural prime underlies central planning, rationing, and within-firm transfer-pricing schemes, a unifying reading Debreu (1959) makes explicit in his axiomatic treatment of resource allocation under any criterion. [5]
Operations research: The assignment problem (match n workers to n jobs minimizing cost), the transportation problem (route supply from sources to sinks under capacity constraints), and the cutting-stock problem are textbook allocation structures, solved by the simplex method, the Hungarian algorithm, and network-flow techniques.
Computer science: Memory allocation (heap management, garbage collection), CPU scheduling (time-slicing across processes), bandwidth allocation (TCP congestion control, queue management), register allocation in compilers, and cache-line allocation in hardware. The structural prime is identical; the criteria range from FIFO to priority to fairness-weighted, a taxonomy Tanenbaum and Bos (2014) lay out across the modern-OS treatment of process and memory schedulers. [6]
Ecology & physiology: Organisms allocate finite metabolic intake across growth, maintenance, defense, and reproduction. Life-history theory is essentially the comparative study of allocation criteria under selection; r-selected and K-selected strategies are two regions in allocation-criterion space.
Finance: Portfolio allocation of capital across assets (stocks, bonds, cash, real estate) under risk-return criteria; asset-allocation policies for pension funds and endowments; capital allocation across business units within a conglomerate.
Cognition & medicine: Allocation of limited attention across stimuli (selective attention as an allocation problem); triage of limited care across patients (emergency-department prioritization, organ-transplant waiting lists, mass-casualty protocols). The structural pattern recurs from neural to institutional scales, a parallel Kahneman (1973) first sharpened in his treatment of attention as a limited resource under criterion-driven assignment. [7]
Telecommunications: Spectrum allocation across carriers (auctioned by the FCC and equivalents worldwide); channel allocation in wireless networks; bandwidth allocation across services on a shared link, with the spectrum-auction case studied in detail by Milgrom (2004) as the paradigm application of allocation-mechanism design. [8]
Clarity¶
A core function of "allocation" is to sharpen the distinction between four things that often get bundled under "managing the resource." First, scarcity — the underlying condition that demand exceeds supply. Second, optimization — the search for the best assignment under some objective. Third, mechanism design and auction theory — incentive-aware procedures that elicit private information from strategic claimants. Fourth, allocation itself — the bare act of dividing supply across claimants, which can be heuristic, rule-based, random, optimized, or auctioned. Naming allocation as its own concept lets the analyst separate "is there a shortage?" from "what division should we choose?" from "how should we elicit the inputs to that choice?"
This clarity dissolves a common confusion: practitioners often slide between describing a problem (scarce capacity), proposing a method (let's optimize, let's auction), and enacting a division (here is the assignment) without noticing the slide. Allocation is the structural skeleton; the other three concepts answer different questions about it. Treating them as distinct lets one ask, separately, whether the right question is being asked (is it really a shortage, or a coordination failure?), whether the right method is being used (does optimization actually fit, or is a rule-based criterion more robust to misspecification?), and whether the assignment that results is the one we wanted. Sen (1970) makes this same separation between feasibility, choice, and evaluation foundational to social-choice analysis. [9]
Manages Complexity¶
Allocation decomposes a situation of finite-supply-meets-competing-demand into five concrete roles: a limited supply, a set of competing claimants, a feasibility constraint, an assignment mapping, and a selection criterion. Once those five roles are named, an opaque "who gets what" problem becomes a structured one with explicit leverage points: change the criterion and the assignment changes; widen the feasibility set and new options appear; redefine the claimants (split or merge them) and the problem reshapes; change the supply (expand, contract, redistribute timing) and a different assignment becomes feasible.
The role-vocabulary lets analysts compare an OS memory scheduler, an ICU triage protocol, and an annual departmental budget as instances of one structural problem rather than three unrelated practices. This comparison is not merely rhetorical: when a hospital system is failing to allocate beds well, one can ask the same diagnostic questions one would ask of a failing CPU scheduler — is the criterion too coarse (no prioritization), too greedy (low-priority patients starved), too sensitive to the wrong inputs, or simply poorly matched to actual demand patterns? Recognizing the shared structure imports the diagnostic toolkit, a porting Roth (2002) demonstrates explicitly when he applies market-design tools developed for auctions to medical-residency and organ-exchange allocation. [10]
The prime also makes what-isn't-being-allocated visible. Many real systems mix allocation with non-allocation: some claimants are served from a separate pool, some demands are negotiated rather than divided, some shares are determined by exogenous contract. Naming the prime forces clean accounting of which slice of the problem actually has the allocation structure and which slice is doing something else.
Abstract Reasoning¶
Allocation enables a family of substrate-independent counterfactuals that hinge on the asymmetry between supply and claim. The core move is: "hold the supply and claimants fixed, vary the criterion, and observe how the assignment changes." That single operation reveals what work the criterion is doing — equal split, priority queue, market price, lottery, and need-weighted allocation all produce different assignments from the same supply and claimants, exposing the values embedded in each rule, a manipulation Young (1994) makes the central analytic move in his treatment of equity in allocation. [11]
The prime also supports inverse reasoning ("what criterion would have produced this observed assignment?"), which is how reverse-engineering of policy works — given an observed pattern of hospital-bed assignments, infer the implicit prioritization rule, and check whether it matches the stated one. It supports feasibility reasoning ("which claimant sets are jointly satisfiable?") — a Pareto-style sweep over which combinations of demands can coexist within the supply envelope. And it supports dissolution reasoning ("remove the scarcity — does the structure vanish, or does residual rivalry remain?"). Some apparent allocation problems are actually coordination or sequencing problems with abundant supply; recognizing this dissolves the framing.
The asymmetry runs strictly from supply to claimants: claimants compete; supply does not; the feasibility constraint is one-sided, binding the assignment from above. That topology — many demands routed through one constrained pipe — is what makes allocation a recognizable structural pattern wherever it appears. The asymmetry also explains why allocation problems are not generally symmetric in any natural exchange of roles: you cannot ask "what if the claimants supplied and the supply claimed?" the way you can in some relational primes; the structure is intrinsically directional.
Knowledge Transfer¶
The same five-role structure transfers cleanly across substrates that share no institutions, no agents, and no goals. The cleanest non-economic case is organismal energy budgeting: a plant or animal has a finite metabolic intake (supply) that must be apportioned across growth, maintenance, defense, and reproduction (claimants), subject to total energy balance (feasibility), via a developmental or hormonal mapping (assignment), under selection pressure (criterion — fitness rather than fairness or efficiency), a parallel Stearns (1992) makes precise in his synthesis of life-history evolution as the comparative study of criterion-driven energetic allocation across taxa. [12] No central planner, no market, no negotiation — yet every role is occupied and the topology is identical to a corporate capital allocation.
Once an analyst sees that life-history theory and venture-capital portfolio construction are instances of the same structure, the prime's claim to substrate independence is concrete: the pattern is in the structure of the problem, not in the institutions that happen to solve it in any one domain. The transfer is not metaphorical — it is structural identity at the level of the five roles, with domain-specific content filling each role. A botanist who learns about portfolio diversification can ask whether plant defense-vs-growth trade-offs exhibit a "risk-return frontier"; a portfolio manager who learns about life-history theory can ask whether quarterly-earnings pressure is imposing an "r-selected" criterion on capital allocation. Both questions are well-posed because the structural skeleton is shared.
Examples¶
Formal/abstract¶
The assignment problem (operations research): Given n workers and n jobs and a cost matrix giving the cost of assigning each worker to each job, find the assignment that minimizes total cost subject to each worker doing exactly one job and each job being done by exactly one worker. The Hungarian algorithm (Kuhn 1955) solves this in polynomial time. Here the supply is worker-hours, the claimants are jobs, the feasibility constraint is the bilateral one-to-one matching, the assignment mapping is the chosen permutation, and the selection criterion is total cost minimization. Vary the criterion — change cost minimization to time minimization, or to weighted-completion-time minimization, or to lexicographic min-max — and a different assignment emerges from the same supply and claimants. Mapped back: The assignment problem is allocation in its cleanest mathematical dress: every role is explicit, the feasibility constraint is geometric (a bipartite matching polytope), and the criterion is a scalar objective. Real-world allocations rarely look this clean, but the assignment problem is the structural archetype against which messier cases can be measured.
Organismal energy budgeting: A perennial plant photosynthesizes a finite amount of carbohydrate per growing season. That budget must be apportioned across leaves (more leaves means more future supply), roots (more roots means more water and nutrient capture), stem and structural tissue (height advantage for light competition), defensive secondary compounds (deterring herbivores), and reproduction (seeds, flowers). The five roles are all present: supply is photosynthate; claimants are organ systems; feasibility is the energy-balance equation; the mapping is developmental and hormonal control; the criterion is lifetime reproductive fitness under selection. A weed (r-selected) allocates heavily to reproduction at the expense of structure; an oak (K-selected) allocates heavily to long-lived structure at the expense of immediate reproduction. Mapped back: No agent, no market, no negotiation — yet the structural prime is fully instantiated. This case is the cleanest evidence that allocation lives below the level of agents and institutions; it is a topological property of finite-supply-meets-plural-demand under any feasibility-respecting mapping rule.
Applied/industry¶
Mass-casualty triage in an emergency department: A hospital ED receives twenty patients during a mass-casualty event with capacity to actively treat eight at once. The supply is staffed treatment bays, surgeons, blood products, and operating-room slots. The claimants are the twenty patients, each with a distinct injury profile. The feasibility constraint is that the total assigned at any moment cannot exceed the eight active bays plus the chain of downstream resources. The assignment mapping is the triage roster — who goes to which bay, in what order. The selection criterion in modern START and SALT triage protocols (Lerner et al. 2008) is "expected survival benefit per unit care," a need-and-prognosis-weighted priority rule rather than first-come-first-served or equal split. [13] Change the criterion (to first-come-first-served, or to "treat the most stable first") and the assignment changes immediately, even though supply and claimants are unchanged — exposing the criterion as the value-laden choice. Mapped back: Triage makes vivid that allocation is where ethics meets structure. The five roles are technical and computable; the criterion is where the community's values enter. Debates over triage protocols are debates about the criterion, not about the prime.
FCC spectrum auctions and CPU scheduling, side by side: The U.S. FCC has, since 1994, allocated wireless spectrum to carriers via simultaneous multi-round auctions designed by Milgrom, Wilson, and McAfee — a mechanism-design success story studied across the regulatory-economics literature (Cramton 2006). [14] The supply is contiguous spectrum bands in specific geographic licenses; the claimants are telecom carriers; the feasibility constraint is that no two carriers can hold the same band in the same region; the assignment mapping is the auction outcome; the selection criterion is willingness-to-pay (revealed by bidding), expected by auction theory to track expected economic value. Meanwhile, a Linux kernel scheduler (Love 2010) allocates CPU time-slices across runnable processes using the Completely Fair Scheduler: supply is CPU cycles per second; claimants are runnable processes; feasibility constraint is total time conservation; assignment mapping is the scheduling decision; selection criterion is "virtual runtime" weighted by process priority, approximating proportional fairness. [15] Mapped back: A multi-billion-dollar regulatory mechanism and a kernel scheduler running on a phone share the same prime. The criteria differ (willingness-to-pay vs. weighted proportional fairness), the timescales differ (years vs. milliseconds), the institutional substrate differs (federal regulator vs. operating-system kernel), but the five roles are isomorphic. Recognizing this lets engineers and economists trade tools: scheduling fairness metrics inform auction-fairness analysis, and mechanism-design lessons inform scheduler design.
Structural Tensions¶
T1: The criterion is where the value-laden choice happens, but it is often invisible until the assignment is made. Stakeholders argue about supply (we need more beds, more spectrum, more memory) and about claimants (who should count as a claimant at all), but the criterion is the rule that does the actual work of assignment. Many institutional fights are misdirected at the supply-debate because the criterion is hidden in technical infrastructure. A triage protocol's "expected survival benefit" weighting is a value choice dressed as a clinical metric; a scheduler's "fairness" weighting is a value choice dressed as a kernel parameter. Surfacing the criterion is uncomfortable because it forces the value choice into the open.
T2: Widening the feasibility set can dissolve the allocation problem, but also redistributes power. If supply can be expanded, demand smoothed, or claimants split or merged, an apparent allocation problem may not need to be solved at all. But every such expansion has a constituency: expanding hospital capacity costs the public purse, smoothing demand asks claimants to defer, merging claimants strips bargaining power. The temptation to "just expand supply" is real and often right, but it also reallocates costs to parties not at the table. Allocation analysis can become an excuse to avoid the harder feasibility-set redesign, or alternatively a tool for ducking the criterion debate by always trying to relax the constraint.
T3: Optimization presupposes a single criterion, but real allocation problems are multi-criterion. The textbook framing — minimize cost, maximize throughput, maximize fitness — picks one objective and runs. Real problems mix efficiency, equity, robustness, transparency, political acceptability, and dynamic incentive effects. Aggregating these into a single scalar via weights is itself a value choice, and the weights are usually arbitrary. Multi-criterion allocation forces either explicit trade-off articulation (which stakeholders resist) or implicit hidden weighting (which embeds someone's values without scrutiny). The cleanest formal optimization answer is often the most politically fragile.
T4: Allocation is one-shot in the textbook framing, but real allocations are sequences with feedback. The assignment problem is timeless: given supply and claimants now, divide. Real allocators face streams of demand, learn from past assignments, and create incentives for future claim-shaping. A scheduler that always serves the highest-priority process invites priority inflation; a triage rule that always serves the most-injured invites strategic injury reporting; a budget rule that always serves the most-overspent department invites end-of-year spending sprees. Static allocation theory misses the dynamic feedback that often dominates outcomes. Adding time creates a much harder problem that the textbook prime does not cleanly cover.
T5: The line between claimants and non-claimants is itself an allocation. Who counts as a claimant — who is on the triage list, the spectrum-auction bidder pool, the schedule of processes — is a prior allocation that shapes everything downstream. A hospital that excludes uninsured patients from triage has already allocated by exclusion; a spectrum auction that requires multi-billion-dollar deposits has allocated by capital-gate. The prime treats the claimant set as given, but in practice the claimant set is the most consequential decision and often the least examined. Naming this tension lets analysts ask "who is being allocated out before allocation begins?"
T6: Random allocation can be both the fairest and the least defensible criterion. A lottery is the most procedurally neutral allocation rule: it makes no claim about merit, need, or willingness-to-pay; it gives equal probability to all claimants. This is often invoked as the ethical baseline (the draft lottery, organ allocation tiebreakers, school-choice lotteries). Yet lotteries also feel arbitrary in ways that affront stakeholders who believe their case has merit; they cannot be defended in particulars, only in general. The same property — total criterion-blindness — is the lottery's ethical strength and its political weakness. Choosing between a defensible-but-controversial weighted criterion and an indefensible-but-uncontroversial lottery is a recurring structural tension across high-stakes allocations.
Structural–Framed Character¶
Allocation sits firmly at the structural end of the structural–framed spectrum: it is a bare relational pattern — finite supply assigned across competing claimants under a feasibility constraint — and its meaning travels intact regardless of whether the claimants are people, cells, processes, or grid loads. Operations research formalized it, but the formalism is mathematical scaffolding rather than substrate-specific framing, which is why every criterion reads near zero.
No domain vocabulary needs to come along for the pattern to be recognized in a new substrate; "who gets how much of the scarce thing" is statable in any field's native terms. There is no built-in evaluative weight — equal split, lottery, market price, and need-weighted division are all instances, and the prime names the act rather than ranking the criterion. It presupposes no human institution: photosynthate distribution across a plant's sink tissues and arterial supply to competing organs are allocations in exactly the structural sense. Nor does it presuppose human practice; an evaluator or rule that maps claimants to shares is all the pattern needs, and that evaluator can be a market, a chemical gradient, or an algorithm. When the prime appears in a new domain, the move is recognition: the structure was already there, and naming it as allocation makes it analyzable. On the spectrum, the verdict is canonical-structural.
Substrate Independence¶
Allocation is about as substrate-independent as a prime can be — composite 5 / 5 on the substrate-independence scale. Its bare pattern, assigning a limited supply across competing claimants subject to a feasibility constraint and a criterion, is stated in fully formal terms (supply, claimants, constraint, assignment mapping, criterion) and carries no institutional or normative baggage of its own, which puts it at the structural pole. The pattern recurs with its home vocabulary essentially unchanged across economics (resource allocation, budgets), operations research (the assignment and transportation problems), computer science (memory, CPU time, bandwidth, registers), ecology and physiology (energy budgets and metabolic allocation), finance (portfolio allocation), cognition and neuroscience (allocation of attention), medicine (triage), and telecommunications (spectrum). Domain breadth is at the ceiling because finite stuff under contention shows up almost everywhere a system is studied, and transfer evidence is similarly heavy: the same activity-analysis and assignment-problem machinery has been ported from one field into the next without translation friction. Structural abstraction sits one rung below maximum only because the operational vocabulary (supply, claimant, assignment) is slightly more concrete than a pure relational signature, but the abstraction still cleanly survives substrate change. The verdict is that allocation is one of the catalog's canonical universal operational primes, fully at home wherever scarcity meets competing demand.
- Composite substrate independence — 5 / 5
- Domain breadth — 5 / 5
- Structural abstraction — 4 / 5
- Transfer evidence — 5 / 5
Relationships to Other Abstractions¶
Current abstraction Allocation Prime
Parents (1) — more general patterns this builds on
-
Allocation presupposes Scarcity Prime
Allocation presupposes scarcity because the assignment of finite supply across competing claimants only becomes a problem when demand exceeds supply.Allocation presupposes scarcity because the assignment of a limited supply across competing claimants only becomes a problem when demand exceeds supply such that giving to one denies to another. Without scarcity's structural condition that available quantity is insufficient to satisfy all simultaneous demands, no allocation choice is required — abundance permits all claims to be met without competition or trade-off. Scarcity supplies the structural-precondition that makes allocation a problem worth solving; allocation supplies the bare-assignment operation that resolves the resulting competition into a definite distribution.
Children (39) — more specific cases that build on this
-
Bent's rule Domain-specific is a kind of Allocation
The proposed strict upward parent is
prime:allocation.prime:allocation is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Bent's rule adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the molecule and central atom, substituents and electronegativity convention, valence-bond hybridization model, orbital s and p fractions and orthogonality, bond directions and angles, predicted structural or spectroscopic observable, competing hyperconjugation and ionic explanations, computational evidence and domain limits are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Bent's rule. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge toprime:allocation. No live DAG mutation is authorized. -
Cathexis Domain-specific is a kind of Allocation
The proposed strict upward parent is
prime:allocation.prime:allocation is the nearest broader Prime while the source-domain invariant supplies the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Cathexis adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the theorist and translated term, text and date, psychic-energy model, investing agency, target representation or object, type and direction of investment, withdrawal or counterinvestment and interpretive limits are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Cathexis. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge toprime:allocation. No live DAG mutation is authorized. -
Credit rationing Domain-specific is a kind of Allocation
The proposed strict upward parent is
prime:allocation.Credit rationing literally allocates a scarce lending capacity among competing borrowers by rules other than price alone; asymmetric information and loan-contract incentives provide the domain-specific residual. The edge is proposal-only and points to a frozen prior-baseline Prime. The entry does not collapse into the parent because the nonprice allocation of limited lending at quoted terms under information or institutional constraints, rather than expensive credit, low aggregate lending, or every rejected application A thematic neighbor is declined whenever it does not literally subsume that rule. The prospective workspace queue contains one strict upward edge toprime:allocation. No live DAG mutation is authorized.
- Destination dispatch Domain-specific is a kind of Allocation
The proposed strict upward parent is `prime:allocation`.prime:allocation is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Destination dispatch adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the building and elevator group, origin and destination requests, demand model, car state and capacity, assignment objective, grouping algorithm, user interface, accessibility, fallback, evacuation boundary and performance metrics are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Destination dispatch. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:allocation`. No live DAG mutation is authorized.
- Edgeworth Box Domain-specific is a kind of Allocation
The minimal prospective placement is a composition/instantiation relation to live `prime:allocation`.The Edgeworth box represents the entire feasible allocation space of two fixed supplies across two claimants, then layers economic selection criteria on that space. It is a representation of allocation rather than a subtype of the allocation act, so composition is appropriate. `prime:indifference_curves` is an indispensable analytical component but not the organizing genus; one can draw the feasibility box before specifying preferences. Two-Sided Matching is a frozen semantic false neighbor because Edgeworth exchange uses quantities and prices rather than bipartite pairings and blocking pairs.
- Equivalence number method Domain-specific is a kind of Allocation
The proposed strict upward parent is `prime:allocation`.The method literally assigns one shared cost pool across competing product outputs under a conservation constraint; equivalence numbers and weighted units provide the DS allocation rule. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Equivalence number method adds domain-specific constraints. The entry does not collapse into that parent because the reference-product equivalence-number transformation, weighted-unit denominator, and conserved proportional cost allocation, not generic allocation, equal division, physical tracing, or an arbitrary spreadsheet ratio It also declines the closest thematic catalog neighbor: the neighbor does not literally subsume the constitutive identity of Equivalence number method. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:allocation`. No live DAG mutation is authorized.
- Imputation (Game Theory) Domain-specific is a kind of Allocation
**Allocation** is the proposed immediate parent.Cooperation, Pareto Efficiency, Fairness, Bargaining Power, and Constraint are related. Statistical Imputation is only a homonym and must remain separate. The prospective queue contains one strict edge to `prime:allocation`. No live DAG mutation is authorized.
- Kalai–Smorodinsky Bargaining Solution Domain-specific is a kind of Allocation
**Allocation** is the proposed immediate parent.Fairness, Proportionality, Pareto Efficiency, Bargaining Power, and Symmetry are related primes. The prospective queue contains one strict edge to `prime:allocation`. No live DAG mutation is authorized.
- Odd–even rationing Domain-specific is a kind of Allocation
Odd–Even Rationing instantiates Allocation because it assigns scarce access windows among claims by a declared parity classifier and schedule.The prospective workspace queue contains one strict upward edge to `prime:allocation`. No live DAG mutation is authorized.
- Path coloring Domain-specific is a kind of Allocation
The proposed strict upward parent is `prime:allocation`.The method allocates wavelengths or colors among conflicting paths; graph intersection structure supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Path coloring adds domain-specific constraints. The entry does not collapse into that parent because resource coloring on path intersections rather than on original vertices or edges It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Path coloring. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:allocation`. No live DAG mutation is authorized.
- Redistribution Domain-specific is a kind of Allocation
Redistribution is allocation specialized to a state-authorized collection-and-disbursement rule that moves resources along a named inequality axis.Allocation supplies the genus: Assign a limited supply across competing claimants under a feasibility constraint, independent of which criterion fills in the rule. Redistribution preserves that general structure while adding its differentia: The deliberate reallocation of income, wealth, or consumption between groups through state authority — a clearing-house collecting from a source base and paying a recipient base under rules set so the net flow runs from those with more to those with less along a named axis. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.
- Register allocation Domain-specific is a kind of Allocation
The proposed strict upward parent is `prime:allocation`.prime:allocation is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Register allocation adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the target architecture and register classes, intermediate representation, live ranges and interference, call convention and fixed uses, allocation algorithm, spill costs and inserted code, coalescing, correctness and performance evidence are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Register allocation. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:allocation`. No live DAG mutation is authorized.
- Shapley value Domain-specific is a kind of Allocation
The proposed strict upward parent is `prime:allocation`.The solution allocates collective surplus among contributors; cooperative marginal contribution supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Shapley value adds domain-specific constraints. The entry does not collapse into that parent because axiomatically unique marginal-contribution allocation over the complete coalition lattice It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Shapley value. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:allocation`. No live DAG mutation is authorized.
- Territorial Formula Financing Domain-specific is a kind of Allocation
The proposed strict upward parent is `prime:allocation`.prime:allocation is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Territorial Formula Financing adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the fiscal year and legislation, territory, expenditure base, escalation and population factors, eligible revenue bases, exclusions, data revisions, floor or transition provisions, entitlement, payment timing, and unconditional-use status are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Territorial Formula Financing. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:allocation`. No live DAG mutation is authorized.
- Warehouse Slotting Failure Domain-specific is a kind of Allocation
Warehouse slotting failure is a misallocation specialized to assigning high-frequency SKUs to positions with heterogeneous access cost.It inherits a limited set of positions, competing claimants, and a feasibility-constrained assignment. The child adds demand-frequency weights, rack and aisle access costs, repeated pick penalties, and drift between the two orderings.
- Weight function Domain-specific is a kind of Allocation
The proposed strict upward parent is `prime:allocation`.prime:allocation is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Weight function adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the carrier and base measure or index set, weight domain and codomain, positivity and integrability, weighted operation, normalization and limiting or zero-weight cases are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Weight function. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:allocation`. No live DAG mutation is authorized.
- Economy Of Force Prime is a kind of Allocation
Economy of force is a specialized allocation rule: drive non-decisive efforts to their minimum-viable floor so freed mass concentrates at the decisive point.It is allocation (assign limited supply across competing claimants) plus a decisiveness gradient + minimum-viable threshold + reserve.
- Mass Prime is a kind of Allocation
Mass is a specialized allocation move: concentrate a finite resource at a decisive point against a threshold-shaped response curve, rather than spread it evenly.It is allocation (assign limited supply) plus a response-curve-shape bet + locator + vulnerability cost. Sibling of economy_of_force under allocation.
- Queueing Prime is a kind of Allocation
Queueing is a kind of allocation that distributes finite service capacity across arriving demands by determining who waits and for how long.Queueing is a specialization of allocation: it assigns a limited supply (server time at a finite-capacity resource) across competing claimants (arriving jobs, requests, customers) under a feasibility constraint (one job at a time per server) guided by a discipline (FIFO, priority, LIFO). It inherits allocation's structural commitment — finite stuff flowing to multiple sinks — and particularizes it to the temporal case where the assignment is by wait order rather than instantaneous division, with arrival and service processes setting the dynamics.
- Scheduling Prime is a kind of Allocation
Scheduling is a specialization of allocation in which the limited resources include time slots and assignments must honor precedence and deadlines.Scheduling is a specialization of allocation. The general allocation pattern assigns limited supply across competing claims under feasibility and criterion. Scheduling specializes by including time as a key dimension of the limited resource: tasks are assigned to time slots and resources subject to precedence, deadlines, and capacity, optimizing makespan, lateness, or throughput. The same assignment-under-scarcity logic of allocation applies, with time slots as the additional structural feature and ordering-over-time as the central decision variable distinguishing scheduling from pure resource division.
- Sharding Prime is a kind of, typical Allocation
Sharding assigns a load across disjoint parallel owners by a stable key-to-shard function — a specialized allocation with a deterministic, routable-without-fan-out partition rule.Allocation supplies the genus: Assign a limited supply across competing claimants under a feasibility constraint, independent of which criterion fills in the rule. Sharding preserves that general structure while adding its differentia: Partition a load across owners by a stable key-to-shard function. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.
- Turn Taking Prime is a kind of Allocation
Turn-taking is the runtime allocation of a single one-at-a-time channel across contenders via an allocation rule that selects who goes next — a specialization of allocation (assign a limited supply across competing claimants).The channel/allocation separation is the structural core.
- Two-Sided Matching Prime is a kind of Allocation
Two-sided matching is a specialization of allocation in which pairings form by mutual selection across a bipartite preference structure rather than by price.Two-sided matching is a specialization of allocation. The general allocation pattern assigns limited supply across competing claims under a feasibility constraint and a criterion. Two-sided matching specializes by structuring the assignment as pairings between members of two sets, where both sides carry preferences and no money-price clears the market. The same who-gets-how-much commitment of allocation applies, with mutual selection across a bipartite relation as the specific mechanism and stability and efficiency as the specific evaluative criteria.
- Complete Streets Domain-specific is part of Allocation
Complete Streets contains allocation because it assigns a fixed-width right-of-way among competing modal claimants under a feasibility envelope and declared criterion.Lane, sidewalk, bikeway, transit, loading, and emergency shares instantiate the full allocation structure. Allocation supplies an internal constituent: Assign a limited supply across competing claimants under a feasibility constraint, independent of which criterion fills in the rule. Complete Streets requires that role within this mechanism: A transportation doctrine that designs a fixed-width road corridor for a declared portfolio of all users — pedestrians, cyclists, transit riders, freight, drivers — allocating the right-of-way as a zero-sum choice and auditing it by multi-modal level of service. Remove the parent-role and the child loses a required internal operation, even though the parent can exist outside the child. The child is therefore built from the parent rather than being a taxonomic kind of it.
- r/K Selection Theory Domain-specific is part of Allocation
r/K selection theory contains allocation because a bounded parental energy supply is assigned between offspring quantity and per-offspring investment.The parent supplies the finite supply, competing uses, feasibility envelope, and assignment mapping; natural selection supplies the domain-specific criterion that shifts the allocation across the continuum.
- Recovery Inequity Domain-specific is part of Allocation
Recovery inequity contains allocation because scarce rebuilding money, contractor capacity, permits, and institutional support must be distributed across affected claimants.The restoration tail is a distributive contest over finite throughput rather than automatic reversion to baseline. Allocation supplies the assignment of scarce recovery resources among claimants; the child adds unequal access channels, comparative trajectories, and recovery-specific accountability.
- Revenue Equivalence Theorem Domain-specific is part of Allocation
Revenue Equivalence contains a fixed allocation rule as the invariant outcome mapping that pins expected payments across auction formats.The theorem compares formats only after holding constant who receives the item as a function of type. Changing that rule, for example with a reserve price, moves outside the equivalence class and can change revenue.
- Road Diet Domain-specific is part of Allocation
A road diet contains allocation because it removes vehicle-capacity share and assigns recovered width to turn lanes, bikeways, sidewalks, parking, or public space.The intervention concretely reassigns finite right-of-way rather than merely closing capacity. Allocation supplies an internal constituent: Assign a limited supply across competing claimants under a feasibility constraint, independent of which criterion fills in the rule. Road Diet requires that role within this mechanism: Intentionally reduce a street's vehicle capacity and reallocate the recovered right-of-way to other uses — the classic four-to-three-lane conversion — because the throughput-maximising configuration sits below the joint optimum across safety, retail, and pedestrian function. Remove the parent-role and the child loses a required internal operation, even though the parent can exist outside the child. The child is therefore built from the parent rather than being a taxonomic kind of it.
- Vickrey Auction Domain-specific is part of Allocation
The auction contains an allocation rule assigning the scarce item to the highest reported valuer under a feasibility constraint.Winner determination is one of the mechanism's two deliberately separated rules. The child adds private reports and a pivot payment that make this allocation efficient and truthfully implementable.
- Auction Theory Prime presupposes Allocation
Auction theory presupposes allocation because auctions are mechanisms for assigning scarce items to claimants under a specified rule.Auction theory presupposes allocation because its subject matter is the assignment of scarce items — licenses, contracts, art, financial instruments — to claimants whose willingness to pay differs and is privately known. Without allocation's prior structure of dividing limited supply among competing demands, there is no problem for an auction format to solve. Auction theory inherits the general allocation problem and supplies a family of rule structures — English, Dutch, sealed-bid, double, combinatorial — that turn bids into assignments, then studies how format choice affects efficiency, revenue, information revelation, and collusion-resistance of the resulting allocation.
- Creative Destruction Prime presupposes Allocation
Creative destruction presupposes allocation because its reallocation of resources from less to more productive uses requires an underlying assignment of supply across uses.Creative destruction operates by reallocating capital, labor, and other productive resources from displaced firms and methods to ascendant ones, which presupposes the underlying machinery of assigning limited supply across competing uses. Without allocation as the structural substrate, there would be no assignment to revise: the displacement of incumbents and the rise of new entrants would have no resource-redistribution dimension. The allocation prime supplies the assignment structure on which the destructive-creative reshuffling acts.
- Pareto Efficiency Prime presupposes Allocation
Pareto efficiency presupposes allocation because the no-improvement criterion ranks assignments of limited supply across competing claimants.Pareto efficiency is the property of an allocation in which no change can make someone better off without making someone else worse off, which presupposes the underlying act of assigning limited supply to competing claimants. Without allocation's machinery of distributing scarce supply across competing demands, there would be no assignment whose efficiency the Pareto criterion could evaluate, no participants whose welfare comparisons would matter, and no feasible set of alternative assignments to scan for improvements. Allocation supplies the substrate on which Pareto efficiency operates as an evaluative criterion.
- Prioritization Prime presupposes Allocation
Prioritization presupposes allocation because ordering competing claims is only meaningful when a finite resource must be assigned among them.Prioritization actively orders competing claims on finite resources by some criterion of value, urgency, or dependency, producing a sequence that maximizes a chosen objective. The ordering is meaningful only when the resource is scarce and multiple demands compete for it — exactly the allocation problem of assigning limited supply across competing claimants. Allocation supplies the bare assignment structure; prioritization is allocation refined by an explicit ranking rule. Without the underlying scarcity-driven assignment problem, prioritization has nothing to rank and no resource to route by its ordering.
- Resource Management Prime presupposes Allocation
Resource management presupposes allocation because acquiring, provisioning, and reclaiming finite resources requires assigning supply across competing demands.Resource management is the operational discipline of handling the full lifecycle of finite resources — acquisition, provisioning, monitoring, reclamation — and at its heart sits the moment of assigning supply across competing consumers. Without allocation's machinery of assigning limited supply to competing claims under feasibility constraints, the management discipline would have no central act to coordinate around: scarcity would not translate into a distribution decision, and competing demands could not be served from a common pool.
- Friction Budgeting Domain-specific is a decomposition of Allocation
Friction Budgeting is Allocation applied to a bounded total of interaction cost distributed across the competing steps of a designed flow.Stripping UX vocabulary leaves a finite supply of tolerable cost assigned among candidate uses under a feasibility ceiling and a criterion for where each unit earns the most protection. The child adds the productive-versus-destructive friction test and design interventions.
- Deadweight Loss Prime is a decomposition of Allocation
Deadweight loss is the specific shape allocation takes when distortions prevent mutually beneficial transactions, leaving surplus uncaptured by any party.Deadweight loss is the inefficiency particularization of allocation: it names the structural shortfall between the realized assignment of resources and the welfare benchmark of competitive equilibrium. Where allocation names the bare assignment of limited supply to competing claims generally, deadweight loss specifies the case where the assignment forecloses mutually beneficial trades, producing a loss in which no party captures the foregone surplus — a particular form of misallocation distinguished from transfers, which merely shift surplus between parties.
- Externality Prime is a decomposition of Allocation
Externality is the specific shape allocation takes when third-party effects of an action are not reflected in the price the decision-maker pays.Allocation is the assignment of a limited supply across competing claimants subject to feasibility, with the question of who or what gets how much as the bare assignment itself. Externality is the particular shape this pattern takes when the assignment fails to incorporate third-party effects: a producer or consumer takes an action whose private cost or benefit diverges from the social cost or benefit, and the market — absent intervention — produces an allocation in which the unpriced residue lands on parties not in the transaction. A structurally-particularized instance of allocation whose specific defect is misassignment from unpriced flows.
- Load Balancing Prime is a decomposition of Allocation
Load balancing is the specific shape allocation takes when divisible work is assigned across substitutable units of parallel capacity.Load balancing is the particularization of allocation to a setting where the limited supply is the aggregate capacity of a pool of interchangeable units and the competing claimants are increments of a divisible workload. Where allocation names the bare assignment of finite supply to competing demands generally, load balancing fixes the structural features: the resources are substitutable in parallel, the demands are stream-like increments that can be split, and the assignment rule routes each increment to wherever spare capacity exists.
- Price Mechanism Prime is a decomposition of Allocation
The price mechanism is the specific shape allocation takes when assignments to claimants are coordinated by market prices summarizing decentralized information.The price mechanism is the specific shape allocation takes when the assignment of scarce resources to competing uses is coordinated by market prices that emerge from buyer demand and seller supply. It is a structurally-particularized instance of dividing limited supply among claimants, with the added commitment that the assignment is not directed by a central planner but produced by countless local decisions responding to a scalar signal — the price — that compresses dispersed information about scarcity, preferences, and costs. Allocation emerges as the aggregate of self-interested choices coordinated through that signal.
Hierarchy path (1) — routes to 1 parentless root
- Allocation → Scarcity → Constraint
Neighborhood in Abstraction Space¶
Allocation sits among the more crowded primes in the catalog (20th percentile for distinctiveness): several abstractions describe nearly the same structure, so a description that fits it will tend to fit its neighbors too — transporting it usually means disambiguating within this family rather than landing on it exactly.
Family — Unclustered & Miscellaneous (424 primes)
Nearest neighbors
- Decision — 0.75
- Exchange — 0.74
- Two-Sided Matching — 0.73
- Conflict of Interest — 0.73
- Coordination — 0.73
Computed from structural-signature embeddings · 2026-09-10
Not to Be Confused With¶
Allocation must be distinguished from Scarcity, which is its most frequent confusion. Scarcity is the condition — demand exceeds supply — under which allocation problems become non-trivial. Scarcity is a state of affairs; allocation is an act. A desert is scarce in water without anyone allocating; an unallocated water source under multiple claims is a scarcity awaiting an allocation. The prime relation is presupposition: allocation only bites under scarcity, but scarcity does not entail allocation (the parties might fight, flee, or fail to act at all). Confusion between the two leads practitioners to debate whether scarcity is "real" when the actual question is which allocation rule to adopt, and conversely to debate allocation criteria when the better lever is expanding supply or smoothing demand. Naming the two as distinct primes clarifies which question is on the table.
Allocation is also not Optimization, even though optimization is one of the most common ways to perform allocation. Optimization is the search for the best assignment under a specified objective function and constraint set. Allocation is the act of dividing the supply, by any criterion — optimal, heuristic, rule-based, random, customary, or arbitrary. A landlord assigning rooms by drawing names from a hat is allocating without optimizing. A central planner solving a linear-programming transportation problem is allocating by optimizing. A market reaching a Walrasian equilibrium is allocating by a decentralized optimization-like process. Optimization is one criterion-implementation method; allocation is the structural skeleton that any criterion fills. The confusion arises because operations-research textbooks present allocation problems in optimization form, leading the reader to identify the two. They are not identical: allocation can exist without optimization (random or rule-based assignment), and optimization can exist without allocation (one is minimizing a function with no contested supply). The prime is the bare assignment; optimization is one tool used to perform it.
Allocation must also be sharply distinguished from Mechanism Design and Auction Theory, which are incentive-aware procedures for allocation in settings where claimants strategically misrepresent their private values. Mechanism design starts from the recognition that claimants in real settings hold private information (true valuations, true needs) and have incentives to misreport them when the allocation depends on their reports. It builds allocation rules that are robust to such misreporting, ideally making truthful reporting a dominant strategy (e.g., the Vickrey-Clarke-Groves family of mechanisms). Auction theory is the canonical application: design a bidding rule that allocates a scarce good to high-value claimants while extracting revenue and inducing truthful bidding. Allocation, in the bare prime sense, presupposes no such strategic structure. A scheduler allocates CPU time across processes that have no strategic interests; a plant allocates photosynthate across organs that have no preferences. The mechanism-design layer is added on top of allocation when the claimants are strategic agents with private information. Conflating the two leads to over-engineering (designing incentive-compatible mechanisms for non-strategic claimants) and under-engineering (treating strategic settings as if simple rule-based allocation would not be gamed). The prime relation is that mechanism design is a specialization of allocation to strategic settings; allocation is the broader genus.
Finally, allocation is not Matching, although the two overlap. Matching is the structural prime for pairing entities across two sides — workers with jobs in stable-marriage-style matching, medical residents with hospitals via the National Resident Matching Program, kidney donors with recipients via kidney-exchange chains. Matching problems have bilateral structure: both sides have preferences over the other, and stability or some equivalent is the central solution concept. Allocation, by contrast, is unilateral: a single supply is divided across many claimants, who may or may not have preferences over the supply but typically do not have preferences over each other in a structurally relevant way. The bipartite assignment problem (n workers, n jobs, cost matrix) sits at the boundary — it is a one-to-one allocation that can also be read as a matching — but most allocations are not bilateral: a CPU scheduler allocates time-slices across processes (processes do not have preferences over time-slices); a hospital ED triages patients across treatment bays (the bays do not have preferences over patients); a plant divides photosynthate across organs (the organs do not "prefer" anything). Treating an allocation as a matching imports bilateral-preference machinery that does not exist in the problem; treating a matching as an allocation strips out the bilateral structure that makes the matching well-posed. The two primes are siblings, not duplicates, and the choice of which one applies turns on whether the structural problem is bilateral or unilateral.
Solution Archetypes¶
Solution archetypes in the catalog that build on this prime — directly (this prime is a source ingredient) or as a related prime.
Built directly on this prime (7)
- Decisive-Point Concentration: Create local superiority at the decisive point by massing finite effort there and deliberately accepting bounded weakness elsewhere.▸ Mechanisms (12)
- After-Action Concentration Review — After a concentration episode, reconstructs whether massing at the chosen point actually paid off, updates the model of how return scales with concentration, and feeds the lesson into the next decision.
- Focus Block Schedule — Reserves recurring, defended blocks of time for the one task that decides the most, and batches or sheds everything shallow into the margins.
- Incident-Command Resource Staging — Puts the whole resource pool under one commander, masses it at the point of main effort, holds a reserve to reinforce success, and plans the orderly stand-down.
- Main-Effort Statement — Names one main effort as the decisive point, says who owns it, and states plainly what the organization accepts giving up everywhere else.
- Minimum-Service-Floor Dashboard — Watches the deliberately-starved areas against pre-set minimum floors and fires a reallocation trigger the moment economizing there begins to cause real harm.
- Pivotal Segment Campaign — Pours a disproportionate share of go-to-market effort into the one customer segment that unlocks the rest, driving it past a decisive share threshold within a single window while other segments run on a maintenance baseline.
- Priority Budget Reallocation — Concentrates a divisible budget on the decisive few line items by deliberately cutting the many toward a defined floor, and books the opportunity cost as an authorized decision rather than a quiet trim.
- Reserve Release Gate — Holds a reserve uncommitted against the pull to spend it piecemeal, and defines the threshold conditions under which it is released all at once to reinforce success at the decisive point.
- Schwerpunkt Directive — A commander's order that fixes the point of main effort as binding intent, gives its owner priority of support, and masks the choice behind feints — subordinating the whole force to one decisive point.
- Surge Staffing Roster — Names exactly who moves to the decisive point, from which teams and for how long, and specifies the backfill the drained sources keep and the rest the surged crew is owed.
- Time-Boxed Focus Sprint — Concentrates a team's whole effort on one objective inside a hard, short, non-renewable time box — shielded from interruption, checked at the end, and deliberately followed by recovery rather than renewed into permanent crunch.
- Triage Priority List — Ranks competing demands by where effort changes the outcome and draws a hard cutoff, massing scarce capacity above the line while the deferred tail is set aside openly and re-checked as conditions shift.
- Displacement-Aware Capacity Admission: Before admitting or expanding one activity in a finite shared substrate, identify what it will displace and protect, resize, phase, offset, relocate, or reject the expansion accordingly.▸ Mechanisms (9)
- Capacity Reservation Rule — A rule that reserves part of the shared substrate for incumbent, public-good, safety, ecological, or vulnerable uses.
- Crowding-Out Monitoring Dashboard — A dashboard tracking substrate utilization, entrant growth, incumbent shrinkage, protected-floor violations, and mitigation status.
- Displacement Impact Assessment — A pre-admission assessment estimating which incumbent uses will shrink when a new activity consumes shared substrate.
- Incumbent Use Register — A register of existing formal and informal uses of a shared substrate, including protected functions and dependency strength.
- Moratorium and Reversal Gate — A stop rule that pauses or reverses expansion when observed displacement crosses protected thresholds.
- Offset or Relocation Plan — A plan for relocating displaced activity, expanding substrate, compensating affected parties, or substituting alternate capacity.
- Phased Admission Trial — A staged rollout of the entrant with measurement gates, rollback authority, and incumbent impact review.
- Shadow Displacement Accounting — A counterfactual accounting method that estimates what incumbent activity would have remained without the entrant.
- Substrate Capacity Budget — A budget stating total shared capacity, reserved floors, discretionary slack, phase-in allowance, and emergency reserve.
- Fixed-Sum Payoff Governance: When one participant’s gain is necessarily another participant’s equal loss, govern the fixed-pie boundary, distribution rule, and loss protections directly instead of pretending the interaction creates joint surplus.▸ Mechanisms (7)
- Contest Rulebook — Codifies eligibility, legal moves, scoring, tie-breaks, and appeals into one binding document that every rival agrees to before the contest starts.
- Distributional Loss Review — Evaluates loser impact, proportionality, compensation, minimum floors, and due-process adequacy once a fixed-sum decision has already named its winners and losers.
- Fixed-Pie Boundary Audit — Stress-tests a claimed fixed-pie boundary — are all affected actors counted, are losses quietly shifted to outsiders, is the scope honestly drawn — before fixed-sum rules are allowed to apply.
- Fixed-Sum Payoff Matrix — Maps participant payoffs across strategies or outcomes in a single table and verifies whether the totals remain constant, confirming the interaction is fixed-sum.
- Minimax Strategy Review — Evaluates each option by its worst-case loss and picks the robust action when opponent gain and own loss are tightly coupled and cooperation cannot be verified.
- Transfer Incidence Ledger — Records who gained, who lost, and which transfer or burden pathway links the two, so a fixed-sum decision's conservation is documented rather than assumed.
- Zero-Sum Framing Challenge — Forces reviewers to test whether a zero-sum frame is structural, rhetorical, or masking a variable-sum alternative, and routes each slice accordingly.
- Property Rights Bundle Governance: When access to a resource must be stable, enforceable, and transferable, define the property-rights bundle—use, exclusion, transfer, income, stewardship duties, limits, and remedies—rather than treating ownership as a single undifferentiated claim.▸ Mechanisms (14)
- Access License or Permit — Grants a scoped, conditional, revocable permission to use a resource — without handing over any ownership of it.
- Anti-Commons Clearance Process — Dissolves gridlock when too many separate rights-holders can each veto a resource, by consolidating or pooling the scattered claims into usable form.
- Benefit-Sharing or Royalty Agreement — Splits the income a resource generates among defined stakeholders on a standing formula, so the right to benefit is shared without the underlying resource changing hands.
- Commons Access Rule — Governs a shared resource that no one owns exclusively, setting who may draw from it and how much, so collective use does not collapse into overuse.
- Compensation or Takings Review — Tests whether the public interest justifies overriding a private right — and, if it does, what compensation makes the compulsory taking legitimate.
- Dispute Adjudication Clause — Pre-commits the parties to a named forum, governing law, and remedy path for resolving conflicts over a resource — decided before any conflict arises.
- Easement, Covenant or Use Restriction — A durable burden that attaches to the resource itself — carving out a specific right for a non-owner, or forbidding a specific use — and travels with it through every sale.
- Exclusion Enforcement Protocol — Turns the right to exclude into an operational routine — how the boundary is watched, who gets challenged, and what remedy follows a breach — so exclusivity is enforced rather than merely asserted.
- Property Rights Impact Assessment — Tests a proposed rights arrangement before it is enacted for who gains, who is dispossessed, and whether it risks overuse or anti-commons gridlock — so the distribution of sticks is chosen with eyes open.
- Reversion or Abandonment Rule — Sets the conditions under which a granted right lapses and returns — non-use, breach, or a fixed sunset — so rights don't ossify in hands that no longer use or deserve them.
- Rights Bundle Matrix — Lays ownership out as an explicit grid of who holds which stick over which resource, so 'who owns it?' dissolves into a cell-by-cell map of use, exclusion, transfer, income, and modification rights.
- Stewardship or Nonwaste Covenant — Binds a holder to a schedule of care-and-nonwaste duties that run with the resource, so a right to use never becomes a license to degrade what successors and the public inherit.
- Title or Entitlement Registry — Maintains the authoritative record of who holds which entitlement, how they came to hold it, and what encumbrances ride on it, so claims can be trusted and traced instead of relitigated.
- Transfer, Assignment, or Sale Contract — The instrument that moves specified sticks from one holder to another — fixing which rights convey, on what terms, and with what warranties — so a transfer is clean, complete, and hard to unwind.
- Rent-Seeking Channel Closure: When actors gain more by manipulating allocation rules than by creating value, identify the rent channel, lower its private payoff, protect the rule from capture, and make productive contribution the better path.▸ Mechanisms (15)
- Anti-Capture Rotation Protocol — Reassigns gatekeepers and reviewers on a schedule so that no single relationship with a regulated party has time to harden into capture.
- Auction with Rent Recapture — Allocates a scarce privilege by open competitive bidding so its rent is paid to the public purse rather than pocketed, turning the contest from lobbying gatekeepers into open price competition.
- Beneficial Ownership and Influence Disclosure — Requires the real people behind bidders, licence-holders, and lobbyists to be named on the record, so hidden ownership and undisclosed influence can no longer work the allocation in the dark.
- Competitive Rebid or Retendering — Forces an incumbent's contract or franchise back into open competition on a fixed cycle, so a privilege won once cannot quietly become a permanent, unearned rent.
- Conflict-of-Interest and Recusal Rule — Requires anyone with a personal stake in a specific decision to declare it and step out of that decision, closing the channel where a private interest quietly steers a public choice.
- Cooling-Off Period — Bars a decision-maker or gatekeeper from crossing to the parties they oversaw for a fixed waiting period, so the revolving door cannot pay off while the decision it might bias is still live.
- Entry-Barrier Sunset and Review — Puts an expiry date on the barriers that keep newcomers out, so each licence, standard, or approval requirement must periodically re-earn its keep or lapse.
- Independent Technical Evidence Panel — Moves the technical judgment behind an allocation to an arms-length expert body ruling on a shared evidence record, so the party with a stake can't be the one who certifies its own case.
- Performance-Based Clawback — Ties an award to the value it was granted to produce and recovers it if that value never materializes, so a privilege can't be captured up front and kept for nothing.
- Public Reason Docket — Requires each allocation decision to post its reasons on an open record where affected parties can respond, so a choice must survive being justified in the open.
- Randomized or Lottery Allocation — When qualified candidates can't be meaningfully ranked, allocates by random draw — so there is no discretion to lobby and no advantage to out-spend.
- Regulatory Capture Audit — Periodically examines whether a regulator has drifted from serving the public to serving the industry it oversees — mapping who influences it, tracing whom its decisions actually benefit, and tracking that drift over time.
- Rent-Seeking Audit — Traces where a system's allocation rules are being turned into private tolls, sizes the rent each channel yields, and tallies the effort burned fighting over it.
- Standardized Scoring Rubric — Fixes the criteria, weights, and required evidence of an allocation in advance and in public, so awards turn on stated, checkable merit rather than on who has the decider's ear.
- Sunset Clause Review — Attaches an expiry to a rule, fee, or control so it must periodically re-earn its keep — a scheduled re-test of whether the original purpose still justifies the value it costs, with lapse as the default.
- Residual Harm Accounting and Allocation: Name, measure, assign, and govern the harm that remains after defenses have done what they can.▸ Mechanisms (10)
- Adaptation Gap Report — Surveys the standing portfolio of defense, mitigation, and adaptation measures to find where residual harms still fall through unhandled — before the next event, not after it.
- After-Action Loss Feedback Review — Turns the residual loss from a specific event into design changes upstream, so the same harm is strengthened against rather than merely paid for again.
- Claims and Compensation Fund — Pre-funds a standing pool and a claims process so eligible residual losses are paid without renegotiating funding and terms from zero for every case.
- Harm-Bearer Agreement — A negotiated, binding allocation of who carries, pays for, insures, or governs each residual harm — settled among the parties before the loss lands, not after.
- Loss and Damage Register — A standing, structured record that keeps residual harm as named channels, magnitudes, bearers, evidence, and non-monetary losses — so the remainder cannot quietly become nobody's problem.
- Managed Retreat or Relocation Package — Addresses residual place-based loss by funding and organizing an equitable, staged move of people and assets away from harm continued defense can no longer justly hold.
- Post-Incident Residual-Loss Assessment — A post-event protocol that separates the loss the defenses prevented from the loss that got through, and attributes the residual — with its uncertainty — to the layers and causes involved.
- Residual Harm Eligibility Rule — A standing rule that sorts harms into three lanes — qualifies as governed residual, still preventable, or belongs to another remedy path — with an appeal for contested calls.
- Residual-Risk Acceptance Signoff — A signed, authority-bound record that a specific residual harm is knowingly accepted rather than repaired — with the rationale, the accepting authority, and the trigger that reopens it.
- Restorative Remedy Plan — A plan for redress that money alone cannot deliver — restoration, repair, apology, and trust-rebuilding aimed at the non-monetary losses a payout would leave untouched.
- Role-Expectation Conflict Reconciliation: Make incompatible role expectations visible and govern which duty controls, what must be redesigned, and when a person needs recusal, substitution, support, sequencing, or release.▸ Mechanisms (6)
- Duty-Priority and Harm Comparison — Compares authority, nonwaivable duties, affected-party harm, reversibility, and delay under each priority.
- Protected Role-Conflict Conference — Brings principals and affected parties into nonretaliatory resolution with authority and written outcome.
- Recusal, Delegation, or Separation Gate — Tests integrity, competence, authority, information, continuity, and replacement before changing occupancy.
- Role-Conflict Recurrence Audit — Samples workload, decisions, handoffs, exceptions, distress, and harm after redesign.
- Role-Expectation Conflict Matrix — Crosses roles and expectations by time, authority, resources, loyalty, information, ethics, and affected parties.
- Simultaneous Feasibility and Capacity Test — Compares time, timing, attention, competence, authority, and resources under realistic peaks.
Also a related prime in 17 archetypes
- Accountable Gatekeeping Design: Design choke-point selection so passage decisions use explicit criteria, bounded discretion, traceable reasons, review paths, and distribution audits rather than opaque gatekeeper preference.
- Bottleneck Power Governance: When one actor controls a necessary access point with no close substitutes, constrain that power through access duties, price/service rules, oversight, remedies, and paths to substitutes or contestability.
- Bounded Rivalry Governance: Use competition only inside an explicit arena whose prize, entrants, rules, metrics, harms, and recalibration paths are governed.
- Central Reserve Redeployment: Hold a mobile shared reserve where paths to several fronts are short, then shift and concentrate it fast enough to create local advantage before dispersed alternatives can coordinate.
- Cross-Side Platform Balancing: Design a platform market by balancing the two sides whose participation creates value for one another.
- Demand Curve Calibration and Response Design: Model how much of something is sought at different generalized costs, then use the calibrated response curve to guide allocation, pricing, capacity, and access decisions.
- Endogenous-Pie Payoff Design: When the size of the pie depends on how actors play, map the joint-payoff surface and redesign cooperation, safeguards, and allocation so choices expand or preserve value instead of destroying it.
- Endpoint Fan-Out Fulfillment: Design the deconsolidation, local staging, routing, service-mode, access, evidence, and recovery layer that turns efficient trunk flow into verified endpoint completion.
- Equilibrium-Aware Capacity Intervention Design: Before adding an attractive path or capacity option to a self-optimizing network, test the equilibrium response and add pricing, routing, metering, access, or rollback controls so local choices do not make the whole system worse.
- Fairness-Standard Selection and Reconciliation: Make fairness explicit and contestable: state who is comparable, which differences matter, what standard governs, how competing standards are prioritized, and when outcomes or evidence require revision.
Notes¶
Screened strong in project-06 round 1 — wide substrate breadth, clean formal signature, no home-domain baggage.
Project-06 hierarchy relations to carry into the edge pass: allocation → scarcity (presupposes — allocation only bites under limited supply); and allocation is likely a useful subsumption hub — several existing primes (load_balancing, queueing, auction_theory, mechanism_design) read as allocation mechanisms and could become its specializations in a later round. Flagged, not asserted.
The composite substrate-independence score of 5 reflects the prime's clean five-role formal signature and its appearance with essentially unchanged vocabulary across economics, operations research, computer science, ecology, physiology, finance, cognition, medicine, and telecommunications. The structural-abstraction score is held at 4 rather than 5 only because the role-vocabulary (supply, claimants, criterion) carries faintly economic connotations even though the structure itself is fully formal — a curated v2 review may revise this up.
The prime sits at an interesting boundary in the structural-vs-framed typology: the bare five-role pattern is structural (no human-practice requirement, no evaluative weight intrinsic to the prime), but the criterion slot is where evaluative weight enters in any human-institutional application. This is a clean case of a structural prime that hosts framed content (the criterion's value-loading) without itself being framed. The structural_framed grading is expected to land at the structural pole.
Substrate-furthest case for transfer evidence: organismal energy budgeting in ecology and physiology (no agents, no goals, no institutions, yet every structural role is occupied and the topology is identical to corporate capital allocation). This case is what makes the substrate-independence claim concrete rather than metaphorical.
References¶
[1] Koopmans, T. C. (Ed.). (1951). Activity Analysis of Production and Allocation: Proceedings of a Conference. Cowles Commission Monograph No. 13. John Wiley & Sons. Foundational volume formalizing the activity-analysis framework — supply, activities, and feasibility constraints — that became the backbone of operations-research treatments of resource assignment. SUPPORTS the Core Idea claim that Koopmans first formalized allocation via activity analysis. registry ↩
[2] Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press. Consolidated treatment of primal-dual LP including the transportation problem and the simplex method; pushes the abstraction of routing limited supply across sinks furthest. SUPPORTS the claim that Dantzig pushes the allocation abstraction furthest in the LP treatment of the transportation problem. registry ↩
[3] Hurwicz, L., & Reiter, S. (2006). Designing Economic Mechanisms. Cambridge University Press. Systematic theory of resource-allocation mechanisms — institutions through which economic activity is coordinated — spanning markets and centrally designed/planner mechanisms alike. SUPPORTS the claim that Hurwicz and Reiter trace resource-allocation mechanisms across markets and central planners. NOTE: original annotation was a copy-paste error describing a '2×2 dilemma / engineering incentives' from an unrelated prime; rewritten to match the resource-allocation-mechanism claim. registry ↩
[4] Cody, M. L. (1966). "A general theory of clutch size". Evolution, 20(2), 174–184. Articulates the 'principle of allocation' in evolutionary ecology: a finite time/energy budget partitioned across competing life-history demands under selection to maximize fitness. SUPPORTS the claim that Cody treats energy-budget partitioning as the canonical 'principle of allocation.' registry ↩
[5] Debreu, G. (1959). Theory of Value: An Axiomatic Analysis of Economic Equilibrium. Cowles Foundation Monograph No. 17. John Wiley & Sons. Axiomatic treatment of resource allocation under general equilibrium; develops the formal structure of feasible allocations and Pareto optimality of the price mechanism. SUPPORTS the claim that Debreu makes explicit the axiomatic structure of resource allocation under any criterion. registry ↩
[6] Tanenbaum, A. S., & Bos, H. (2014). Modern Operating Systems (4th ed.). Pearson. Standard operating-systems textbook developing process scheduling and memory/resource allocation; lays out the range of scheduling criteria from FIFO to priority to fairness-weighted. SUPPORTS the claim that Tanenbaum and Bos lay out the taxonomy of process and memory schedulers. registry ↩
[7] Kahneman, D. (1973). Attention and Effort. Prentice-Hall. Canonical capacity model: attention is a limited resource (effort) flexibly allocated across tasks under momentary intentions and enduring dispositions. SUPPORTS the claim that Kahneman sharpened the treatment of attention as a limited resource under criterion-driven assignment. registry ↩
[8] Milgrom, P. (2004). Putting Auction Theory to Work. Cambridge University Press. Connects auction-theoretic comparative statics to real deployments, centrally the FCC spectrum auctions (simultaneous ascending auction). SUPPORTS the claim that Milgrom studies the spectrum auction as the paradigm application of allocation-mechanism design. registry ↩
[9] Sen, A. K. (1970). Collective Choice and Social Welfare. Holden-Day. Foundational social-choice treatment that separates feasibility, individual choice, and social evaluation/aggregation as distinct analytic layers. SUPPORTS the clarity-section claim that Sen makes the separation between feasibility, choice, and evaluation foundational to social-choice analysis. NOTE: original annotation foregrounded 'preference incompatibility / decision impasse' (a framing borrowed from another prime); adjusted to the feasibility/choice/evaluation separation the marker cites. registry ↩
[10] Roth, A. E. (2002). "The economist as engineer: Game theory, experimentation, and computation as tools for design economics". Econometrica, 70(4), 1341–1378. Frames market and auction design as engineering practice converting agents' private information into allocations; draws centrally on the National Resident Matching Program (medical-residency allocation) and FCC spectrum auctions. SUPPORTS the claim that Roth applies market-design tools to medical-residency allocation. registry ↩
[11] Young, H. P. (1994). Equity: In Theory and Practice. Princeton University Press. Systematic treatment of equity in allocation through criterion comparison: equal split, proportional, priority, and need-weighted rules analyzed as alternative criteria applied to identical supply and claimants. SUPPORTS the abstract-reasoning claim that varying the criterion over fixed supply/claimants is the central analytic move. registry ↩
[12] Stearns, S. C. (1992). The Evolution of Life Histories. Oxford University Press. Synthesis of life-history evolution as the comparative study of criterion-driven energetic allocation (growth vs. reproduction, current vs. future reproduction, offspring number vs. size) across taxa. SUPPORTS the knowledge-transfer claim that Stearns makes organismal energy budgeting precise as criterion-driven allocation. registry ↩
[13] Lerner, E. B., Schwartz, R. B., Coule, P. L., et al. (2008). "Mass casualty triage: An evaluation of the data and development of a proposed national guideline". Disaster Medicine and Public Health Preparedness, 2(S1), S25–S34. Reviews START and develops the SALT mass-casualty triage protocol; the criterion is need-and-prognosis-weighted survival benefit per unit care. SUPPORTS the triage-criterion claim in the mass-casualty example. registry ↩
[14] Cramton, P. (2006). "Simultaneous ascending auctions". In P. Cramton, Y. Shoham, & R. Steinberg (Eds.), Combinatorial Auctions (Ch. 4). MIT Press. Analysis of the FCC simultaneous multi-round (simultaneous ascending) auction design as the canonical spectrum-allocation case. SUPPORTS the FCC-spectrum-auction example. NOTE: original def gave pp. 99–114; this is Chapter 4 of the volume — page range corrected/qualified to the chapter. registry ↩
[15] Love, R. (2010). Linux Kernel Development (3rd ed.). Addison-Wesley. Standard reference on Linux kernel internals describing the Completely Fair Scheduler (CFS) as a virtual-runtime-based proportional-fairness allocation of CPU cycles across runnable processes. SUPPORTS the CPU-scheduling (CFS) example. registry ↩