Elimination Sequencing
A model for narrowing a known set of constraints into a single committed decision, without asking the person to specify the comparison criteria themselves.
In categories that require a decision without deep domain expertise, people often know their own constraints with certainty (behavioural, budgetary, circumstantial) but lack a reliable way of converting that knowledge into the comparison criteria a system expect. Unfamiliarity with the vocabulary makes this worse, but the gap exists at a conceptual level even with plain terms. Faced with this gap, most people guess, defer to an existing trusted relationship, or abandon the comparison entirely.
The system asks a small sequence of questions, each one narrowing the option space. The first question carries the highest elimination power available. Every subsequent question is dynamic, based on the previous answer — two people could be asked entirely different questions based on their answer to the first one. Cost or any other high-stakes factor is deliberately held back until later, since if asked earlier it could anchor the user and distort the answers that follow. The system keeps track of what has been selected and what has been ruled out. Questions are formed in language that lets users recognise their constraints in lived-in terms.
The sequence ends in a committed recommendation, allowed to expand to what the option space allows but not to an overwhelming degree. When real variance between recommendations exists, the system shows a single recommended option. If no real variance exists, it shows more than one, accompanied by the reasoning.
The person works through the questions and acts on the final recommendation. On their repeat use, they skips fewer as the sequence progresses. The system’s side of the signal is a final set that is small and genuinely varied, with options different enough from each other for the choice to mean something.
A short list of yes-or-no facts doesn’t need a system that adapts in real time — a basic form with a decision tree can do the same job for less effort. When all remaining options at the end of questioning are basically the same or small variations of the same (three colours of ceiling fans, for example), the final answer is more of a coin flip than a confident and informed recommendation. Elimination Sequencing is also not ideal for decisions too big or too personal to hand off entirely.
Elimination Sequencing is not a model of preference discovery — the user already holds the constraints, they just cannot articulate them as comparison criteria. It extracts a known position through structured questioning that adapts at each step. The nearest adjacent model is Decision Compression, which works in the opposite direction: the user does not know what they want, and the system surfaces proposals until one lands. Elimination Sequencing fits when constraints are objective and self-known; Decision Compression fits when preferences are vague and latent.