Allocation, Matching & Opportunity Cost

← Back to Decision, Search & Optimization Failure

Discrete agents, tasks, resources, or commitments are assigned without counterpart fit, indivisibility, comparative advantage, or visibility into displaced alternatives.

23 mechanisms across 4 solution archetypes. This is a recurring problem pattern within Decision, Search & Optimization Failure; the mechanisms below inherit it from the primary archetype they instantiate.

• Alternative Enumeration Checklist — Forces the decision process to generate credible alternatives before judging the chosen option.
• Assignment Model — Represents pairings between agents and tasks as an eligibility grid, then commits each agent to exactly one compatible partner.
• Attention Budget Audit — Identifies what important work, learning, relationship, or risk monitoring is displaced by current demands on attention.
• Calendar Allocation Review — Makes the opportunity cost of meetings, deadlines, and recurring commitments visible in time and attention systems.
• Capital Budgeting Comparison — Compares proposed capital uses against the next-best use of funds, capacity, or risk-bearing ability.
• Comparative Task Assignment Matrix — Scores actors against tasks by relative opportunity cost and available capacity so assignments follow lowest displaced value, not absolute skill.
• Constraint Satisfaction Search — Explores the space of discrete combinations to find any assignment that violates no constraint, driven by feasibility rather than an objective.
• Crew Scheduling Model — Builds legal duty bundles that cover every required shift under labor rules, minimum staffing, and equitable distribution of work.
• Cross-Functional Work Split — Divides one project across disciplines by relative cost and integration need, then defines the handoffs that stitch the pieces back together.
• Decision Rationale Template — Records the chosen option, displaced alternative, resource commitment, assumptions, and review trigger in a durable format.
• Facility Location Model — Chooses which whole sites to open so that demand is covered at acceptable cost and distance.
• Integer Programming Model — A formal declarative statement of a discrete decision — its binary and whole-number variables, objective, and constraints — written to be handed to a solver.
• Integer Programming Solver — Software that searches a formulated discrete model's feasible space and returns a proven or near-optimal commitment bundle.
• Internal Service Agreement — Turns inter-unit specialization into an operating arrangement with service levels, handoff formats, priorities, and escalation paths.
• Make–Buy–Partner Review — Decides whether a function should stay in-house, be bought on the market, or be run through partnership by weighing opportunity cost, transaction cost, and dependency.
• Policy Alternative Analysis — Requires a policy choice to name the public goods, constituencies, or outcomes displaced by the chosen intervention.
• Portfolio Tradeoff Review — Reviews active initiatives as a portfolio so adding or continuing one commitment explicitly displaces another.
• Project Selection Matrix — A structured table laying out candidate projects with their scores, costs, dependencies, and selection status for transparent human review.
• Role Design Workshop — Facilitates a redesign of standing roles around relative advantage while surfacing status, consent, and the fair distribution of the gains.
• Selection Review Board — A standing human body that deliberates over a proposed commitment bundle, rules on exceptions and fairness, and takes accountable ownership of the decision.
• Solver Dashboard — A live interface that visualizes a running solver — its candidate solutions, objective values, remaining gap, and constraint violations.
• Supplier or Partner Specialization Contract — Governs specialized exchange across organizations with dependency safeguards and fair bargaining so specialization does not become lock-in.
• Trade or Swap Arrangement — Lets two actors exchange tasks, shifts, or capabilities directly when each holds a different relative advantage and the swap costs almost nothing to arrange.