Tradeoffs & Decision Support¶

← Back to Mechanisms by Solution Family

Solutions that expose competing objectives, preference structure, stopping rules, and consequences so a choice can be made under constraint.

193 mechanisms across 23 solution archetypes in this solution family. A mechanism inherits the primary family of the archetype it instantiates; family is about the move the solution makes, not the domain where it originated.

Archetype Overview¶

This unusually large family has a compact overview for orientation. Each archetype name jumps to its fully visible section below.

Solution archetype	Mechanisms	Description
Arbitrage Prevention Mechanism Design	8	Design fences around differentiated offers so the intended buyer segment can access its offer while higher-willingness or ineligible buyers cannot cheaply arbitrage into it.
Audience-Boundary Signal Spillover Governance	10	Before sending a bounded signal, map who else will see it, how they will interpret it, and what response load or legitimacy spillover they may create.
Bottleneck Capacity Shadowing	4	Identify which constraint most limits the objective and how much value is gained by relaxing it.
Bounded-Rationality Decision Design	9	Match decision method, search depth, sufficiency threshold, and escalation to the real limits and stakes of the choice.
Compounding Advantage Flywheel Design	9	Turn cumulative use, learning, scale, data, or reputation into a bounded flywheel where each added unit improves the return to the next unit, while guarding against runaway lock-in, exclusion, fragility, and bubbles.
Constrained Resource Allocation	8	Allocate scarce resources to maximize a defined objective while respecting explicit constraints.
Convex Exposure Gain Design	10	Design the system so bounded exposure to volatility has capped downside, measurable upside, and a pathway that converts stress into durable capability.
Deadweight Loss Reduction	11	Remove or redesign avoidable wedges that block mutually beneficial activity while preserving the constraints that protect safety, fairness, public goods, and externalities.
Decision Load Management	9	Manage the number, timing, and complexity of decisions so decision quality does not degrade from fatigue.
Defensible Boundary Retreat	8	Withdraw deliberately from an increasingly indefensible position to a safer boundary before rising hold costs, forced displacement, or irreversible lock-in remove the option to move well.
Demand Curve Calibration and Response Design	10	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.
Discrete Commitment Optimization	9	Choose among indivisible options or commitments when partial allocation is impossible.
Dynamic Subproblem Reuse	7	Reuse solutions to recurring subproblems so repeated decision work does not have to be recomputed.
Objective Weighting Governance	9	Govern how competing objectives are weighted so optimization does not hide value judgments.
Pareto Frontier Navigation	6	Search for options where no objective can improve without worsening another, then choose consciously along the efficient frontier.
Payoff Restructuring	8	Change the rewards, costs, penalties, or risks in a strategic interaction so rational choices move toward a better outcome.
Policy Evaluation Before Deployment	3	Evaluate a decision policy across simulated or historical states before deploying it in the real system.
Regret-Signal Calibration	10	Use regret as a calibrated counterfactual signal: compare the actual outcome with a credible better forgone alternative, then route the signal to learning, reversal, repair, or closure.
Revealed Preference Validation Against Indifference Curves	10	Use what actors actually choose under constraints to infer their trade-off curves, then test whether those inferred curves are coherent enough to guide decisions.
Robust Solution Selection	9	Choose solutions that perform acceptably across plausible parameter variation instead of only under best-estimate assumptions.
Sensitivity Analysis Protocol	8	Vary key assumptions or parameters to see which ones materially change the conclusion.
Sequential Policy Optimization	8	Choose actions over time by accounting for current state, uncertain transitions, future rewards, and long-term policy effects.
Tradeoff Guardrail	10	Set non-negotiable limits on what may be sacrificed while optimizing other objectives.

Arbitrage Prevention Mechanism Design¶

Design fences around differentiated offers so the intended buyer segment can access its offer while higher-willingness or ineligible buyers cannot cheaply arbitrage into it.

8 mechanisms · View full solution archetype

Advance-Purchase or Time-Window Restriction — Limits low-price access to timing conditions that price-sensitive segments can use but high-urgency segments find less attractive.
Bulk-Purchase and Resale Monitor — Flags suspicious purchase volumes, secondary-market listings, account-sharing patterns, or repeated eligibility anomalies before leakage erodes the segmented price.
Exception, Appeal, and Manual Review — Allows legitimate users to correct false denials, accessibility conflicts, credential gaps, or unusual but valid use cases.
Feature Tier Design — Differentiates versions by features, support level, flexibility, capacity, timing, or convenience so segments self-select into appropriate offers.
Geographic or Channel Restriction — Constrains where or through which channel an offer is valid to reduce cross-market leakage.
Identity-Bound Entitlement — Binds a ticket, license, account, voucher, subscription, or benefit to an identified user or organization so it cannot be casually transferred to another segment.
Non-Transferable Terms and Refund Rule — Uses contractual terms, refund limits, cancellation rules, and reassignment constraints to reduce resale while still allowing legitimate remedies.
Usage Quota or Rate Limit — Prevents a low-price account or entitlement from being used at a scale characteristic of a higher-priced segment, keeping cheap seats from serving expensive demand.

Audience-Boundary Signal Spillover Governance¶

Before sending a bounded signal, map who else will see it, how they will interpret it, and what response load or legitimacy spillover they may create.

10 mechanisms · View full solution archetype

Adjacent-Audience Pre-Mortem — Before sending, imagines each adjacent audience's worst plausible reading and reaction, surfacing the harms and legitimacy damage the signal could trigger.
Audience Boundary Map — Diagrams who the signal is aimed at, which adjacent audiences sit within earshot, and the channels that will carry it across the boundary.
Boundary Permeability Scorecard — Rates, boundary by boundary, how easily a signal will cross from its intended audience to each adjacent one, and flags the sieve.
Clarification and Redirect Path — Pre-built routes and messaging to correct a misreading and steer misplaced responses to the right owner once spillover is detected.
Interpretive Context Brief — The framing, background, and anticipated-questions that travel with a signal so adjacent audiences — and the intermediaries relaying it — read it as intended.
Sentinel Uptake Monitor — Places watchers across the signal's channels to catch, early, when and where an adjacent audience picks it up and begins to amplify it.
Signal Cue Audit — Dissects the signal's explicit and implicit cues to find where a word, number, image, or omission will be read differently by a neighbouring audience.
Spillover After-Action Review — After a signal event, reconstructs what actually spilled, to whom, through which channel, and updates the permeability model so the next signal is planned better.
Spillover Response Load Test — Estimates the volume and tempo of reactions a signal will draw from adjacent audiences and checks whether the response apparatus can absorb them.
Staged Release Protocol — Releases a signal in phases or to a limited scope so exposure grows only as fast as the response apparatus and the harm boundary allow.

Bottleneck Capacity Shadowing¶

Identify which constraint most limits the objective and how much value is gained by relaxing it.

4 mechanisms · View full solution archetype

Before/After Constraint Monitoring — Tracks, after a relief action, whether performance actually moved, where the new limiting constraint appeared, and whether the gain leaked downstream.
Bottleneck Valuation Map — A visual that lays out each constrained point, the concrete relaxation options available there, and their ranked relief priority — with migration risk flagged.
Constraint Sensitivity Report — Documents, from a fixed baseline, how the objective responds as each constraint or capacity is varied across a credible range — and what each level of relief would cost.
Shadow Price Analysis — Reads the dual of a solved optimization model to price the marginal objective gain from relaxing each binding constraint by one unit.

Bounded-Rationality Decision Design¶

Match decision method, search depth, sufficiency threshold, and escalation to the real limits and stakes of the choice.

9 mechanisms · View full solution archetype

Algorithmic Escalation Gate — Escalates from a simple rule to formal analysis when threshold conditions or anomaly signals are met.
Choice Architecture Simplification — Reduces irrelevant options and presentation burden while preserving meaningful alternatives and agency.
Cognitive Offloading Aid — Moves memory, comparison, sequencing, or calculation burden into checklists, tables, prompts, or tools.
Default and Delegation Protocol — Routes routine choices to vetted defaults, automation, or qualified owners with override and exception logging.
Post-Decision Calibration Review — Compares forecast, confidence, process, and outcome to recalibrate future thresholds and methods.
Progressive Option Screening — Uses cheap broad filters before costly deep evaluation while retaining false-negative review and reentry.
Satisficing Threshold Rule — Closes search when a candidate meets explicit minimum criteria and continued search has lower expected value.
Timeboxed Search — Allocates a bounded search interval with a fallback, checkpoint, and escalation path.
Two-Stage Review — Separates rapid provisional action from later verification, correction, or ratification.

Compounding Advantage Flywheel Design¶

Turn cumulative use, learning, scale, data, or reputation into a bounded flywheel where each added unit improves the return to the next unit, while guarding against runaway lock-in, exclusion, fragility, and bubbles.

9 mechanisms · View full solution archetype

Bubble and Lock-In Red Team — Attacks a claimed flywheel to expose where its growth is speculative froth and where its concentration has become dangerously fragile — before the story is believed.
Compounding Curve Review — Reads the shape of the marginal-return curve across successive increments to tell a still-improving flywheel from one that has quietly flattened or begun to reverse.
Cumulative Reputation System — Accumulates verified track-record into a persistent, portable reputation stock so that each additional trusted interaction makes the next one easier to win.
Data Flywheel Dashboard — Instruments the data-improvement loop on one live view — use to data to model quality to user value to more use — so a team can see whether the flywheel is actually turning.
Experience Curve Review — Certifies whether cost or quality is genuinely improving through learning-by-doing as cumulative production grows — and captures the lessons that drive it — separating a real experience effect from ordinary scale or price moves.
Fixed-Cost Amortization Plan — Spreads a large fixed investment across a growing volume of units so average cost falls as the base grows — and pins the volume threshold at which the investment pays for itself.
Open Standard or Portability Rule — Guarantees open interfaces, data portability, and exit rights so a compounding platform's participants keep the freedom to leave — bounding lock-in before the loop becomes too entrenched to govern.
Platform Seeding Program — Bootstraps a cold two-sided or complement-driven loop by recruiting anchor participants and seeding early complements until the flywheel can spin on its own.
Reinvestment Cadence — A standing rule that routes a fixed share of each cycle's gains back into the flywheel's driver on a regular schedule — and throttles the reinvestment as the curve saturates.

Constrained Resource Allocation¶

Allocate scarce resources to maximize a defined objective while respecting explicit constraints.

8 mechanisms · View full solution archetype

Budget Allocation Model — Distributes a fixed pot of money across competing programs by weighting each against declared strategic priorities under ceilings and mandates.
Capacity Allocation Rule — A standing rule that hands out a renewable service capacity each period and recalibrates as utilization and backlog feed back.
Grant Allocation Review Protocol — Allocates a fund to applicants through eligibility screening, scored review, conflict-of-interest controls, and a documented decision record.
Inventory Allocation Policy — Rations scarce physical stock across regions, channels, and customer tiers so higher-priority demand is served first without overselling.
Linear Programming Solver — Computes the allocation that maximizes a linear objective over a feasible region defined by linear constraints.
Portfolio Allocation Model — Spreads investment or project capacity across a set of opportunities to maximize a risk-adjusted objective that survives adverse scenarios.
Production Planning Model — Plans how materials, labor, and machine time are spent across product lines, surfacing which resource is the binding bottleneck.
Staff Scheduling Model — Assigns finite labor hours to shifts, roles, and units so every coverage, skill, and labor-rule constraint is satisfied at once.

Convex Exposure Gain Design¶

Design the system so bounded exposure to volatility has capped downside, measurable upside, and a pathway that converts stress into durable capability.

10 mechanisms · View full solution archetype

After-Action Learning Harvest — Converts what an exposure episode revealed into retained lessons, design changes, and updated playbooks — before the memory fades and the gain is lost.
Chaos Engineering Game Day — Deliberately injects realistic failures into a live system inside a pre-declared blast radius, measuring against a steady-state hypothesis, to prove and improve resilience before reality does.
Controlled Burn or Ecological Disturbance — Applies a small, governed disturbance on a deliberate cycle to burn off dangerous accumulation, in systems adapted to — and renewed by — periodic stress.
Deliberate Practice with Desirable Difficulty — Aims a chosen class of productive difficulty at a learner's specific weak points, so that effortful, error-surfacing practice builds durable, transferable skill.
Feature-Flag Experimentation — Wraps each change in a runtime toggle so a new variant reaches only a scoped slice of users and can be ramped up or killed instantly — turning every release into a bounded, reversible bet.
Progressive Overload Protocol — Raises challenge in small, planned increments while protecting recovery, so capacity adapts upward without tipping into injury or collapse.
Red-Team Stress Exercise — A sanctioned adversary attacks the system's plans, defences, and assumptions on purpose, so weaknesses surface as findings you can harden against rather than as a real breach.
Small-Bet Option Ladder — Runs many small, capped, reversible bets in parallel, then pours resources into the few that pay off and retires the rest — buying open-ended upside while each individual loss stays small.
Supplier Stress Rotation — Deliberately routes bounded, real volume to backup suppliers and pathways on a schedule, so a redundant source stays exercised, proven, and ready — instead of failing on its first real use in a crisis.
Volatility Budget with Loss Limit — Sets an explicit budget for how much volatility and cumulative loss the system may spend on experiments, meters the spend live, and forces a stop the moment the loss limit is hit — so exposure can never add up to ruin.

Deadweight Loss Reduction¶

Remove or redesign avoidable wedges that block mutually beneficial activity while preserving the constraints that protect safety, fairness, public goods, and externalities.

11 mechanisms · View full solution archetype

Congestion or Capacity Pricing Adjustment — Retunes the price of access so it rises and falls with real-time scarcity, letting congested capacity route to its highest-value use instead of being rationed by queue and idle time.
Cost–Benefit Assessment Protocol — Weighs a proposed distortion repair on full welfare terms — surplus recovered, who gains and loses, and how robust the case is — instead of accepting 'it costs less' as proof it is better.
Distortion-Reduction Review — The intake diagnostic: locates the wedge blocking beneficial activity, separates the genuinely wasteful part from the part that protects something, and sizes the recoverable loss.
Impact Assessment Table — A single comparable grid that lays each affected party's estimated gain or loss beside the protected constraints and the post-change signals to watch, so governance can see the incidence at a glance.
Matching Improvement Program — Rebuilds how willing parties find and pair with each other when thin or clumsy matching — not raw scarcity — is what leaves valuable trades unmade.
Permit or Approval Streamlining — Strips avoidable delay, duplication, and uncertainty out of a permission process while ring-fencing the substantive checks that actually protect safety, rights, or the environment.
Price-Control Redesign — Reworks an administered price — a cap, floor, or subsidy — that is generating shortage, surplus, or underuse, while rebuilding the access or safety protection the control was actually providing.
Quota or Allocation Rule Review — Re-examines a quota, cap, queue, or eligibility formula that is locking high-value uses out or leaving capacity idle, asking whether the allocation can be reopened without losing the rationing purpose it legitimately serves.
Regulatory Simplification Pilot — Runs a narrower or faster rule on a walled-off slice of cases under close monitoring, with a built-in expiry, to test whether the protected purpose survives at lower cost before any permanent change.
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.
Tariff, Fee, or Toll Redesign — Recalibrates an authority's charge — a tariff, fee, or toll — that has grown into a wedge deterring useful activity, keeping only the part that still serves a legitimate revenue, cost-recovery, or externality purpose.

Decision Load Management¶

Manage the number, timing, and complexity of decisions so decision quality does not degrade from fatigue.

9 mechanisms · View full solution archetype

Approval Threshold Matrix — A threshold table linking decision stakes to required review depth or approval level.
Choice Set Pruning Method — A method for filtering or tiering options before detailed comparison.
Decision Batching Workflow — A workflow that groups similar decisions into planned review windows.
Decision Calendar — An artifact that places recurring decisions onto an intentional cadence.
Decision Triage Queue — A workflow that routes incoming decisions by urgency, stakes, reversibility, and owner.
Default Option Design — An interface or policy mechanism that preselects a safe ordinary path while preserving override.
Delegation Rulebook — A document specifying which decisions are delegated to which roles under which constraints.
Fatigue Check Protocol — A checklist or pause protocol that responds to signs of degraded decision quality.
Low-Stakes Decision Automation — A tool or rule that handles low-variance routine decisions without repeated human deliberation.

Defensible Boundary Retreat¶

Withdraw deliberately from an increasingly indefensible position to a safer boundary before rising hold costs, forced displacement, or irreversible lock-in remove the option to move well.

8 mechanisms · View full solution archetype

Asset Decommissioning and Salvage Runbook — Retires, salvages, or safely quarantines what is left behind and books the surviving obligations, so the abandoned position stops silently consuming resources or leaking liability.
Hold-vs-Retreat Scenario Stress Test — Projects the hold-cost curve forward under several plausible futures and compares the net value of holding against retreating, so the case to withdraw rests on staying losing across a range of scenarios rather than on a single gloomy forecast.
Managed Retreat Trigger Review — Sets evidence-based retreat triggers in advance and reviews them on a standing cadence against the rising hold-cost curve and the reversibility horizon, so withdrawal is decided by proof rather than nerve.
New Boundary Stabilization Review — Verifies after the move that the new boundary actually holds under real load — capacity, defenses, funding, and governance in place — before the retreat is declared complete.
Old-Position Sunset Clause — Puts a fixed expiry on the commitment to hold a position so it must be actively renewed to continue, flipping the default from indefinite holding to scheduled retreat unless the case to stay is remade on the record.
Phased Relocation Plan — Sequences the withdrawal as a staged, partly reversible ladder of moves rather than a single leap, so functions keep running while the old position is relinquished piece by piece.
Receiving Boundary Readiness Assessment — Tests whether the receiving boundary is genuinely more defensible and can actually absorb what is being moved to it, before anyone commits to leaving the old position.
Retreat Compensation and Continuity Package — Bundles the compensation, bridging services, and participation guarantees owed to the people a retreat displaces, so withdrawal is a governed transfer of support rather than an abandonment.

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.

10 mechanisms · View full solution archetype

Conjoint or Discrete Choice Model — Reconstructs demand from the ground up by making people choose among attribute bundles, recovering how much each feature — including price — is worth.
Cross-Elasticity Matrix — Maps how demand for each item responds to price changes in every other item, exposing which goods are substitutes, which are complements, and where demand merely moves rather than disappears.
Demand Curve Estimation Workbook — The auditable ledger that assembles every observed cost-quantity-segment observation into a single, uncertainty-tagged demand schedule.
Demand Segmentation Dashboard — A living, segment-sliced view of who is responding to cost changes and how the demand picture is drifting since the last decision.
Equity Access Impact Review — Interrogates a demand model to check whether it is measuring genuine value or merely unequal ability to bear cost, and guards the access of those it would price out.
Price Sensitivity Experiment — Deliberately varies a price or price-like cost in the field to measure the causal response, rather than inferring it from history.
Revealed Preference Choice Log — Reads demand from the choices people actually made under real costs, trusting behavior over stated intent.
Scenario Demand Stress Test — Pushes the calibrated demand schedule to extreme, off-baseline conditions to find where it breaks before a real shock does.
Shadow Price Probe — Infers the implicit price of a good with no money price from how much time, effort, or risk people willingly bear to get it.
Waitlist and Stockout Analysis — Recovers the demand that capacity hid — the queues, stockouts, and abandoned attempts that never became a transaction.

Discrete Commitment Optimization¶

Choose among indivisible options or commitments when partial allocation is impossible.

9 mechanisms · View full solution archetype

Assignment Model — Represents pairings between agents and tasks as an eligibility grid, then commits each agent to exactly one compatible partner.
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.
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.
Project Selection Matrix — A structured table laying out candidate projects with their scores, costs, dependencies, and selection status for transparent human review.
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.

Dynamic Subproblem Reuse¶

Reuse solutions to recurring subproblems so repeated decision work does not have to be recomputed.

7 mechanisms · View full solution archetype

Dynamic Programming Method — Solves an optimization problem by decomposing it into overlapping subproblems, solving each exactly once in dependency order, and recombining the stored results into the whole.
Dynamic Programming Table — A grid indexed by subproblem state whose cells hold the stored partial answers, filled bottom-up so each subproblem is computed once and looked up thereafter.
Memoization Cache — Wraps a repeatedly-called pure computation so its result is stored under an argument-derived key on the first call and returned instantly on every later matching call.
Modular Planning Template — A reusable, blank plan structure that carves recurring work into standard modules and specifies how they recombine, so each new plan is filled in rather than reinvented.
Precedent Index — Connects recurring issue patterns to their stored resolutions and, before reuse, runs a fit check on jurisdiction, facts, and context so only genuinely matching precedents are applied.
Recurrence Equation — The mathematical relation that expresses a subproblem's value in terms of its smaller neighbors' values — the compact engine a reuse structure evaluates.
Reusable Playbook Library — A curated store of ready-made response modules — playbooks — retrieved by situation and recombined into current work, with an owner who keeps them fresh and a measure of how often they are reused.

Objective Weighting Governance¶

Govern how competing objectives are weighted so optimization does not hide value judgments.

9 mechanisms · View full solution archetype

Audit Trail for Weight Changes — Records changes to weights, authority, rationale, and effective dates.
Deliberative Weight-Setting Session — Facilitates discussion and justification of proposed objective weights.
Multi-Criteria Decision Analysis — Provides structured methods for comparing alternatives across multiple criteria.
Ranking Stability Report — Reports whether rankings or winners remain stable under weight changes.
Scorecard Disclosure Template — Documents objectives, weights, scales, rationale, and sensitivity notes.
Stakeholder Weight Review Panel — Reviews proposed weights for legitimacy, impact, and acceptability.
Weight Sensitivity Sweep — Tests decision outcomes across plausible alternative weight sets.
Weighted Scoring Model — Combines weighted objectives into a score, ranking, or priority list.
Weighted Sum Objective — Implements a combined objective as an explicit weighted sum.

Pareto Frontier Navigation¶

Search for options where no objective can improve without worsening another, then choose consciously along the efficient frontier.

6 mechanisms · View full solution archetype

Dominance Screening — Removes every option that another feasible option matches or beats on all objectives, shrinking a listed field to its non-dominated set before any value choice is made.
Efficient Frontier Plot — Draws the non-dominated options as points in objective space with the efficient boundary traced through them, so which options are efficient is visible at a glance.
Knee Point Analysis — Finds the bend in the frontier where extra gains start costing disproportionately more, nominating that point of diminishing returns as a pragmatic default.
Multiobjective Optimization Model — Formalizes the objectives and constraints as math and searches the feasible space to generate frontier points where the options are too many or too continuous to list by hand.
Tradeoff Curve Visualization — Plots one objective against another along the frontier to expose the exchange rate — how much of one must be given up per unit of the other, and where that price accelerates.
Weighted Scoring Overlay — Chooses among the non-dominated options by attaching explicit, stakeholder-elicited weights to each objective and scoring every frontier point — keeping the value judgment on the surface.

Payoff Restructuring¶

Change the rewards, costs, penalties, or risks in a strategic interaction so rational choices move toward a better outcome.

8 mechanisms · View full solution archetype

Access Priority Rule — Grants faster access, preferred queue position, capacity, visibility, or scarce resources to actors who meet desired behavior conditions.
Clawback or Recovery Clause — Recovers a previously granted payoff when later evidence shows misconduct, underperformance, misrepresentation, or failure to satisfy conditions.
Contract Incentive Clause — Builds bonuses, penalties, retainage, clawbacks, service credits, warranties, or shared-savings provisions into an agreement.
Liability Shift or Warranty — Moves downside risk toward the actor best positioned to prevent it, changing expected costs of low-quality or risky action.
Penalty, Tax, or Fee — Adds a cost to behavior that imposes risk, waste, congestion, external harm, or strategic defection.
Reputation Score or Public Rating — Changes future opportunities, trust, or status by making behavior visible and comparable to others.
Shared Savings or Gainsharing — Splits the benefits of improved performance so the party able to change behavior receives part of the system-level gain.
Targeted Subsidy or Bonus — Adds a positive payoff for desired behavior, usually when the behavior creates system value but actors would otherwise underinvest in it.

Policy Evaluation Before Deployment¶

Evaluate a decision policy across simulated or historical states before deploying it in the real system.

3 mechanisms · View full solution archetype

Off-Policy Evaluation — Estimates how a candidate policy would perform directly from logged data generated by a different policy, correcting statistically for the fact that the logs were never collected under the candidate.
Policy Simulation — Rolls the candidate policy forward through a model of the environment, generating synthetic trajectories — including rare states no log contains — to see how it behaves over time before it touches the real system.
Simulation-Based Validation Report — Assembles the scenarios, assumptions, metrics, results, known limits, and a deployment recommendation into a single reviewable document a gate authority can act on.

Regret-Signal Calibration¶

Use regret as a calibrated counterfactual signal: compare the actual outcome with a credible better forgone alternative, then route the signal to learning, reversal, repair, or closure.

10 mechanisms · View full solution archetype

Actionability-Filter After-Action Review — Runs a post-outcome review that turns a regret into a durable rule change only when the lesson is both controllable and recurring — otherwise it routes the regret to closure.
Commitment Reset Memo — A written re-decision that treats a regretted commitment as if it were being chosen fresh today — continue on modified terms, reverse, or repair — so sunk cost stops driving the call.
Counterfactual Plausibility Screen — Tests whether the 'better' path you are regretting was actually available, feasible, and knowable at the decision point — passing only credible alternatives and rejecting hindsight fantasy.
Forgone-Alternative Decision Journal — A contemporaneous log of what was chosen, what was rejected, and what was known at the time — written before the outcome lands, so a later regret review cannot be quietly rewritten by hindsight.
Minimax Regret Matrix — Lays candidate options against uncertain future states, scores each option's regret in a state as its shortfall from that state's best option, and picks the option whose worst-case regret is smallest.
No-Fault Learning Review — A blameless review that rebuilds what was known and reasoned at the decision point and separates controllable choices from bad luck, so people surface information instead of hiding it.
Regret Gap Table — Breaks a single realized regret into its component value differences — money, time, trust, safety, optionality, learning — and shows which stakeholders bear each one.
Regret Pre-Mortem — Before committing, imagines the decision has already failed and works backward to the most plausible future regrets — then maps whose they are and preserves low-cost options against the ones worth guarding.
Reversal-Window Check — Locates a regretted decision on the reversibility clock — how much time, lock-in, and switching cost stand between now and a closed exit — and flags when the window to change course is about to shut.
Rumination Timebox — Caps how long a regret may be replayed — a fixed budget of review, after which the signal is either converted into a concrete action or formally accepted and closed — so reflection does not decay into rumination.

Revealed Preference Validation Against Indifference Curves¶

Use what actors actually choose under constraints to infer their trade-off curves, then test whether those inferred curves are coherent enough to guide decisions.

10 mechanisms · View full solution archetype

Budget Set Reconstruction — Rebuilds the set of options a chooser could actually afford and reach at the moment of choice, so a selection can be read as a preference rather than as a constraint.
Choice Architecture Confound Audit — Inspects the real choice environment — defaults, ordering, layout, friction — for the presentation features that could have shaped a choice, so preference is not read off a decision the interface made.
Choice Bundle Normalization — Re-expresses every option as a common-unit bundle of attributes and prices, so trade-offs made on different occasions can be compared on the same footing.
Dominance Violation Scan — Flags any single choice where an available option was at least as good on every attribute and strictly better on one — a selection no coherent preference should make.
Ethical Preference Inference Review — Governs whether inferring and acting on someone's revealed preferences is permissible — checking consent, the evidence's limits, and whether the use exploits rather than serves the chooser.
Indifference Region Visualization — Draws the inferred trade-off contours as shaded regions whose width shows how confidently the curve is known and how it varies across segments.
Marginal Substitution Estimator — Estimates the local rate at which a chooser traded one attribute for another, reading marginal substitution rates off choices made near the margin.
Preference Reversal Probe — Deliberately re-presents the same options in an altered frame or order to see whether the chooser's ranking flips — separating a stable preference from a framing artifact.
Revealed Preference Consistency Matrix — Assembles every 'chosen-over' relation from a choice history into a matrix and tests it for cycles and intransitivity that no single stable preference ordering could produce.
Stated vs Revealed Gap Report — Quantifies the gap between what people say they value and what their behavior reveals, broken out by segment and reported with the confidence the comparison actually supports.

Robust Solution Selection¶

Choose solutions that perform acceptably across plausible parameter variation instead of only under best-estimate assumptions.

9 mechanisms · View full solution archetype

Decision Matrix Under Uncertainty — Displays candidates, scenarios, performance thresholds, robustness metrics, and tradeoff notes so selection is auditable.
Maximin / Satisficing Rule — Chooses an option that maximizes the minimum acceptable performance or clears a defined performance floor across scenarios.
Minimax Decision Rule — Selects the option with the least severe worst-case loss when guarding against credible downside is the governing concern.
Monte Carlo Robustness Screen — Samples many plausible parameter combinations to estimate how often each candidate remains acceptable, with sampling assumptions documented.
Regret Analysis — Compares how much each option would underperform the scenario-specific best choice, supporting decisions that avoid severe ex post regret.
Robust Optimization Model — Implements robust selection by optimizing under uncertainty sets, downside constraints, or scenario families rather than a single best-estimate parameter vector.
Robust Policy Design Review — Applies robust selection to a policy rule by checking whether it remains acceptable across populations, states, scenarios, or implementation contexts.
Scenario Robustness Check — Evaluates each candidate solution against named scenarios and records where it remains acceptable, fails, or requires contingency support.
Stress-Tested Plan Review — Reviews a plan or design against adverse but plausible conditions before selecting it for implementation.

Sensitivity Analysis Protocol¶

Vary key assumptions or parameters to see which ones materially change the conclusion.

8 mechanisms · View full solution archetype

Assumption Stress-test Workshop — Convenes the people who own or dispute the assumptions to argue defensible ranges, name the decision-carrying ones, and set the validation agenda.
One-way Sensitivity Analysis — Moves one input at a time across its range while holding everything else fixed, then ranks assumptions by how far each alone swings the outcome.
Probabilistic Sensitivity Simulation — Draws thousands of joint samples from input distributions and reports the share of draws in which the recommendation holds versus flips.
Scenario Variation — Bundles many assumptions into a few internally coherent named worlds and reads the outcome under each to judge whether the plan survives all of them.
Sensitivity Table — Records one row per assumption — its range, outcome response, materiality verdict, and critical flag — so the whole analysis can be audited line by line.
Threshold Analysis — Solves backward for the exact value of an input at which the recommendation flips, turning that break-even point into a monitoring trigger.
Tornado Chart — Draws each input's outcome swing as a horizontal bar, sorted widest-first, so the dominant drivers are legible at a single glance.
Two-way or Multi-way Sensitivity Analysis — Varies two or more inputs at once across a grid of combinations to expose interaction — the effects that appear only when assumptions move together.

Sequential Policy Optimization¶

Choose actions over time by accounting for current state, uncertain transitions, future rewards, and long-term policy effects.

8 mechanisms · View full solution archetype

Adaptive Policy Review Cycle — A recurring governance loop that compares observed outcomes against the policy's assumed transitions and fires a revision when the two drift apart.
Dynamic Programming / Value Iteration — Solves for the optimal policy by sweeping a value array with discounted one-step-lookahead backups until the values stop changing, then reading the greedy action off each state.
Markov Decision Process Model — Writes a repeated decision as a formal tuple of states, actions, transition probabilities, rewards, and horizon — the shared scaffold every solver, simulator, and learner reads from.
Off-Policy or Historical Replay Evaluation — Estimates how a proposed policy would have performed by replaying historical logs from the policy that actually ran, reweighted to correct for what the old policy chose to try.
Policy Iteration — Carries an explicit current policy and converges by alternating an exact evaluation of that policy with a greedy, state-by-state improvement over the available actions.
Reinforcement Learning Policy Learning — Learns a policy directly from trial-and-error interaction when the transition and reward models are unknown, bounded by an exploration guardrail that keeps live mistakes survivable.
Simulation Rollout Evaluation — Estimates a candidate policy's trajectory-level value by rolling it forward through a simulator many times, surfacing the rare and costly paths a single-step score would hide.
Threshold Policy Rule — Expresses the policy as transparent state thresholds and escalation bands — act when the state crosses this line — so operators can read, audit, and trust it.

Tradeoff Guardrail¶

Set non-negotiable limits on what may be sacrificed while optimizing other objectives.

10 mechanisms · View full solution archetype

Budget Floor — Reserves a minimum allocation for a protected purpose so that optimizing other priorities can't drain it below the level that purpose needs to survive.
Compliance Threshold Check — A pass/fail test that verifies a decision meets codified legal, contractual, or policy minima before it is approved, so nothing advances that would breach an external floor.
Ethical Guardrail Review — A convened human review, triggered when a decision may sacrifice a protected ethical value — fairness, dignity, privacy, accountability — that no numeric threshold can adequately capture.
Exception Register — A living ledger of every approved waiver — with owner, rationale, compensating control, and expiry — so deviations stay visible and time-bound instead of quietly becoming the norm.
Minimum Service Guarantee — Fixes a floor on the service beneficiaries actually receive, so efficiency drives can optimize freely above it but never cut below the promised baseline.
Nonfunctional Requirement — Writes a system's quality floors — reliability, security, latency, accessibility — as required design constraints, so feature work cannot quietly spend them.
Quality Gate — A checkpoint standing at a stage boundary that blocks advancement until evidence of quality meets a set bar, so schedule or cost pressure can't push unfinished work downstream.
Rights Constraint — Marks certain protections as categorically off-limits — not a weight to be balanced but a line no amount of aggregate benefit may cross.
Safety Floor — Sets a hard safety limit, kept a margin above the true danger line, that halts or escalates any operation approaching it — whatever the schedule says.
Stop-Ship Criterion — A short list of no-go conditions that, if any is present at the ship gate, blocks release outright — no matter how ready everything else is.