Decision Method¶

A decision method is a repeatable procedure that represents a decision frame, feasible alternatives, objectives or loss, evidence and uncertainty, preference or priority information, and an aggregation or search rule to recommend, rank, or adapt a course of action.

Version: v1 · 2026-09-28 · History
Domain-specific #: 8884
Domain group: Formal Sciences
Origin domain: Operations Research
Subdomains: Decision Analysis, Decision Science → Operations Research

Core Idea¶

A decision method is a repeatable procedure that represents a decision frame, feasible alternatives, objectives or loss, evidence and uncertainty, preference or priority information, and an aggregation or search rule to recommend, rank, or adapt a course of action. The defining question for Decision Method is not whether a case shares a topical word with familiar examples. It is whether the case realizes the same organized identity: decision frame and alternatives, objectives and preferences, evidence and uncertainty model, procedure, output, and validation. Those roles make Decision Method testable across varied instances without reducing it to a loose theme.

How would you explain it like I'm…

The Same-Steps Choosing Recipe

When you pick a game to play with friends, you could just shout one out. Or you could use the same steps every time: list the games, think about what everyone likes, think about what you know, like whether it might rain, and then pick using a fair way. Using the same set of steps to choose is a decision method.

A Repeatable Way to Choose

A decision method is a step-by-step way of choosing that you can use again and again. It needs a few parts: a clear question, the choices you could make, what you are trying to get or avoid, the facts you have and how sure you are about them, how much each thing matters to you, and a rule for combining all of it. Out comes a suggestion, like a best choice or a ranked list. Just having a goal, or one rule of thumb, or a guess about the future is not a decision method by itself. It has to be the whole repeatable recipe.

Structured Decision Procedure

A decision method is a repeatable procedure that turns a clearly framed decision into a recommendation, ranking, or adaptive course of action. Its parts include the decision frame and feasible alternatives, objectives or losses, the evidence and a model of uncertainty, preference or priority information, and an aggregation or search rule that combines them. It also produces a defined output and should be validated. Something only counts as a decision method if it realizes this structure; a goal, a single rule, a slogan, a forecast, a software tool, or the choice that was made are not automatically decision methods. That boundary keeps the idea from becoming a label for anything related to deciding.

A decision method is a repeatable procedure that represents a decision frame, the feasible alternatives, objectives or a loss function, evidence and its uncertainty, and preference or priority information, and applies an aggregation or search rule to recommend, rank, or adapt a course of action. Its identity lies in this organized set of roles: frame and alternatives, objectives and preferences, evidence and uncertainty model, procedure, output, and validation. The positive boundary is an explicit, repeatable procedure that maps a defined frame, values, evidence, and uncertainty to ranking or action guidance. The negative boundary excludes a mere goal, a single rule, a heuristic slogan, a prediction, a software interface, or a chosen outcome. These tests keep the concept from becoming a catch-all for anything related to decision-making.

Scope of Application¶

Decision Method applies wherever the positive boundary and the complete role pattern can be established. The scope of Decision Method is therefore structural within the stated domain, not universal merely because one role appears elsewhere. Scope claims about Decision Method must state the bearer or participant, operating conditions, relevant scale, and evaluative purpose. A putative Decision Method pattern that appears only after stripping away those conditions may be an analogy rather than an instance.

Clarity¶

Decision Method clarifies analysis by separating identity, instance, means, and result. The Decision Method identity is the reusable organization described here; an instance realizes it; a means enables it; and a result follows from its operation. Confusing those Decision Method levels creates false duplicate nodes and misleading DAG edges. For the Decision Method role decision frame and alternatives, the operative question is: what in this case specifies actor, feasible actions, search areas, options, constraints, and stopping scope?

Manages Complexity¶

Decision Method compresses many concrete variants into a small role system. This Decision Method compression allows comparison without pretending that every instance shares implementation details, history, or value. The Decision Method abstraction keeps the relations needed to explain category membership and discards detail that does not bear on that question. The decision frame and alternatives role manages one source of complexity by giving curators a stable place to record how an instance specifies actor, feasible actions, search areas, options, constraints, and stopping scope.

Abstract Reasoning¶

Reasoning with Decision Method begins by proposing a candidate bearer and mapping every structural role. The Decision Method map can then be tested through counterfactual removal: if a role disappeared, would the case remain the same kind of thing, become a defective instance, or leave the class entirely? Comparative Decision Method reasoning should vary one role at a time while holding the others stable.

Knowledge Transfer¶

The Decision Method blueprint can transfer as an analytic scaffold: identify the roles, map them to a new case, test exclusions, and retain the receiving domain's terminology and evidence standards. Transfer of Decision Method concerns the organization of inquiry, not an assertion that every domain uses the same mechanisms. The transferable Decision Method question contributed by decision frame and alternatives is how the receiving case specifies actor, feasible actions, search areas, options, constraints, and stopping scope.

Relationships to Other Abstractions¶

Current abstraction Decision Method Domain-specific

Foundational — no parent edges in the catalog.

Children (2) — more specific cases that build on this

Bayesian search theory Domain-specific is a kind of Decision Method

Bayesian search theory satisfies the defining boundary of Decision Method: A decision method is a repeatable procedure that represents a decision frame, feasible alternatives, objectives or loss, evidence and uncertainty, preference or priority information, and an aggregation or search rule to recommend, rank, or adapt a course of action.
Potentially all pairwise rankings of all possible alternatives Domain-specific is a kind of Decision Method

Potentially all pairwise rankings of all possible alternatives satisfies the defining boundary of Decision Method: A decision method is a repeatable procedure that represents a decision frame, feasible alternatives, objectives or loss, evidence and uncertainty, preference or priority information, and an aggregation or search rule to recommend, rank, or adapt a course of action.

Neighborhood in Abstraction Space¶

Decision Method sits in a crowded region of the domain-specific corpus (30^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Generic Domain Practice Definitions (22 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08