How does superintelligence work when an AI must recommend the best study plan but there is no single plan that wins at everything? One option finishes eight practice questions in twenty-five minutes. Another finishes twenty-four in forty-five. The first is faster, while the second completes more questions. Neither dominates the other on both measures. A trustworthy assistant should not announce one universal winner without knowing what the user values.
The mechanism is Pareto dominance and the Pareto frontier. A choice dominates another when it is at least as good on every stated criterion and strictly better on at least one. The choices that no other option dominates form a frontier of trade-offs. This helps AI systems remove clearly inferior options while preserving genuinely different alternatives that depend on the user’s priorities.
This reader-friendly guide compares seven fictional study plans, using minutes required and practice questions completed as two invented outcome measures. We identify four non-dominated options, explain three dominated plans and classify twenty-four claims. All values are hypothetical teaching data, not measured learning outcomes, real tutoring recommendations or an AI benchmark. “How Superintelligence Works” names the educational series; it is not a claim that present AI systems have achieved artificial superintelligence.
Quick notes: the practical meaning
- Objective 1: fewer required minutes is better.
- Objective 2: more completed practice questions is better.
- Seven fictional plans: G, A, C, B, E, D and F.
- Pareto frontier: G (25,8), A (30,12), B (40,18), E (45,24).
- Dominated plans: C (35,10), D (50,18), F (60,22).
- No frontier plan is best on both measures simultaneously.
- A user must supply a time limit or minimum practice target to select a personally useful plan.
1. Why best needs a definition
An assistant asked for the best plan may optimise speed, number of questions, cost, enjoyment, accessibility, or something else. Different readers can value those criteria differently.
Without an explicit objective, calling one plan best may conceal an arbitrary weighting. Pareto analysis offers a useful intermediate step: identify options that are clearly worse, then discuss trade-offs among the remaining choices.
2. Two objectives can conflict
Completing more questions may require more minutes. Finishing as quickly as possible may mean completing fewer practice problems. Both outcomes can be desirable in different circumstances.
An AI must not secretly convert a two-objective decision into a single numerical grade with invented weights. It should keep each criterion visible and let the user’s constraints help resolve the remaining choice.
3. What does dominance mean?
Option X dominates option Y if X is no worse than Y on every specified criterion and strictly better on at least one. With two objectives, X must take no more time and complete at least as many questions, with a strict improvement somewhere.
A dominated plan is clearly inferior under that limited comparison. But the conclusion depends on the criteria and source data actually included in the problem.
4. Strictly better in at least one
If two plans have identical time and question counts, neither strictly dominates the other under the definition just given, although they are indistinguishable on these two criteria.
Strictness is essential. Merely saying no worse in both would classify an equal plan as better without identifying any actual improvement. An assistant needs a consistent mathematical rule for ties.
5. A Pareto frontier is not a single winner
The Pareto frontier is the set of options that are not dominated by any other available option under the chosen criteria. Every frontier plan offers at least one trade-off that prevents another plan from being better in all listed respects.
A non-dominated option need not be ideal for every user. It may have the fastest time but fewer questions, or the highest question count but take longer. The frontier narrows the decision without making up preferences.
6. The fictional Cedar Revision Plans
Imagine seven alternate study activities, each producing a stipulated number of completed practice questions within a stated time. We define the outcomes in advance for teaching, and assume the same broad kind of task is counted.
The figures are invented; they are not observations of actual pupils, evidence of questions answered correctly or measurements of learning. The model considers only minutes and number of completed questions, excluding difficulty, fatigue and understanding.
7. The seven-plan reference ledger
- G — 25 minutes; 8 practice questions completed.
- A — 30 minutes; 12 questions.
- C — 35 minutes; 10 questions.
- B — 40 minutes; 18 questions.
- E — 45 minutes; 24 questions.
- D — 50 minutes; 18 questions.
- F — 60 minutes; 22 questions.
- All values are fictional and refer to the same limited two-criterion comparison.
- Minimise minutes; maximise completed questions.
8. Check the shortest plan
G takes twenty-five minutes, less than every other plan. It completes eight questions. No alternative can dominate G under these two metrics because every other plan needs more time.
That makes G non-dominated. However, it does not make G the best choice for someone who must complete at least twelve questions. Non-dominated and suitable for a particular requirement are different conditions.
9. Check plan A
A takes thirty minutes and completes twelve questions. It is slower than G by five minutes but completes four more questions. Therefore G does not dominate A, and A does not dominate G.
A is a genuine trade-off option. It has no competitor that completes at least twelve questions in thirty minutes or less under the frozen ledger, so it belongs to the frontier.
10. Why A dominates C
C requires thirty-five minutes and completes ten questions. A needs just thirty minutes while completing twelve. A uses five fewer minutes and completes two more questions.
Thus A is strictly better on both stated measures and dominates C. If those are the only criteria, an AI can remove C from the candidate shortlist without knowing the user’s preferred balance between time and quantity.
11. The meaning of removing a dominated option
Removing C means it is unnecessary for this two-criterion decision under the supplied values. It does not mean the activity is unsafe, unpleasant or educationally useless.
A real plan might differ in subject difficulty, student accessibility, teacher presence or cost. If those criteria matter, the comparison must be expanded before treating C as inferior in practice.
12. Check plan B
B takes forty minutes and completes eighteen questions. A is faster but completes only twelve; E completes more than eighteen but takes longer than forty.
Since none of the other six plans is both as fast as B and at least as productive, B remains non-dominated. Its advantage is a middle point between faster, smaller plans and slower, larger ones.
13. Why B dominates D
D takes fifty minutes and completes eighteen questions. B completes the same eighteen questions in forty minutes. B is no worse in questions and ten minutes better in time.
This is a textbook dominance example: equality on one criterion plus a strict gain on another. D is dominated even though its completed question count matches B.
14. E also dominates D
E takes forty-five minutes and completes twenty-four questions. Compared with D’s fifty minutes and eighteen questions, E is five minutes faster and completes six more questions.
More than one option can dominate the same candidate. The fact that B already dominates D does not remove the usefulness of identifying additional dominance relationships during an audit.
15. Why E belongs to the frontier
E completes twenty-four questions, the highest count of the seven alternatives, while taking forty-five minutes. No other plan completes twenty-four or more in forty-five minutes or less.
Therefore E is non-dominated. It has the largest number of completed questions in this fixture, but G, A and B are faster. Highest question count does not equal universal best plan.
16. Why E dominates F
F requires sixty minutes and completes twenty-two questions. E requires forty-five minutes and completes twenty-four. E is fifteen minutes faster and completes two more questions.
F is dominated by E on both criteria. This is a direct comparison of the toy outcomes. It says nothing about whether Plan F might involve harder or more educationally valuable questions in reality.
17. Why a longer plan is not automatically dominated
E takes longer than B but completes more questions. As neither is as good as the other on both measures, neither dominates the other.
The same principle explains why G is retained despite its low total of eight. Its minimum time is a genuine advantage for a user with a very tight schedule.
18. The Pareto classification table
- G (25 min, 8 questions) — NON-DOMINATED.
- A (30 min, 12 questions) — NON-DOMINATED.
- C (35 min, 10 questions) — DOMINATED by A.
- B (40 min, 18 questions) — NON-DOMINATED.
- E (45 min, 24 questions) — NON-DOMINATED.
- D (50 min, 18 questions) — DOMINATED by B and E.
- F (60 min, 22 questions) — DOMINATED by E.
- Four non-dominated plans; three dominated plans.
- All seven plans use the same fictional two-objective rules.
19. Check the full frontier
The four frontier options are G, A, B and E. Moving through them in increasing time order gives more completed questions at each step: eight, twelve, eighteen and twenty-four.
No earlier frontier plan completes as many questions as a later one, and no later frontier plan is as fast as an earlier one. That is why all four remain as legitimate trade-offs.
20. A graph makes dominance visible
Put minutes on the horizontal axis and questions on the vertical axis. Better choices lie farther left and higher up. A plan dominates another if it is at least as far left and as high, with an improvement in one direction.
C lies to the right of and below A. D lies to the right of B at the same height. F lies to the right of and below E. These visual positions reflect the mathematical comparisons.
21. A strict thirty-minute cap
Suppose a user can spend no more than thirty minutes. The eligible plans are G and A. G finishes eight questions; A finishes twelve.
If the goal is to maximise questions within that cap, A is the better choice. If the user instead strictly minimises time, G is faster. The constraint helps narrow the options, but the remaining objective still matters.
22. At least ten questions within thirty-five minutes
Set the requirements at no more than thirty-five minutes and at least ten completed questions. A (30,12) and C (35,10) both satisfy the thresholds. G (25,8) does not meet the question minimum.
A dominates C, so A is the clearly better feasible option under the listed criteria. This shows how a Pareto check can simplify a constrained choice without inventing numerical preference weights.
23. At least fifteen questions within forty minutes
Under a forty-minute limit and a minimum of fifteen questions, B (40,18) meets both conditions. G, A and C do not reach fifteen, while E, D and F take more than forty minutes.
Thus B is the sole feasible option in the seven-plan list. A model can identify a unique answer here because the user’s explicit constraints remove the trade-off.
24. At least twenty questions within forty-five minutes
Under a forty-five-minute limit and at least twenty questions, E (45,24) qualifies. F completes twenty-two but takes sixty minutes, which exceeds the cap.
None of the other options reaches the twenty-question threshold. E is uniquely feasible for this particular requirement, not universally best for all learners.
25. What if there is no question minimum?
Suppose the user only wants the shortest activity in the list. G wins because twenty-five is the smallest duration. The number of completed questions no longer controls the decision.
This shows why a single objective can produce a single winner even when the original two-objective frontier contains several non-dominated alternatives. The user decides which criteria matter.
26. What if the goal is maximum questions?
Suppose there is no time constraint or penalty and the user merely wants the highest number of completed practice questions among the listed options. E finishes twenty-four, more than any other.
That is an unambiguous answer within the toy ledger. It does not imply that completing twenty-four questions produces the best learning or that forty-five minutes suits a particular real pupil.
27. Efficiency ratio is a different metric
A user could ask for questions per minute rather than treating time and count as separate objectives. Under the fictional values, G averages 8/25 = 0.32, A 12/30 = 0.40, B 18/40 = 0.45 and E 24/45 ≈ 0.533 questions per minute.
E has the highest of these four calculated rates. But a ratio-based objective is a new decision rule, and a model should label it separately rather than claim it was the only obvious meaning of best.
28. The frontier can change with a third criterion
If plans also differed in cost, accessibility or difficulty, a plan dominated on time and question count could remain attractive because of a third factor. The Pareto frontier might then include more alternatives.
Our seven-plan fixture deliberately excludes additional criteria. Its four-item frontier is correct only under that declared scope. Real educational suitability requires much more context.
29. The data must be comparable
The measure completed questions treats every counted question as one unit. But twenty simple questions and twenty challenging ones may represent different learning experiences.
A true educational recommendation would need information about difficulty, correctness, understanding and learner needs. The fictional numbers allow a clean mathematical explanation; they are not a complete measure of learning quality.
30. Dominance does not prove learning effectiveness
Plan E dominates F on the stated time and count metrics. That does not prove E is a better intervention for every pupil or achieves better examination outcomes.
An assistant should preserve the limited definition of its recommendation. Optimisation of an incomplete metric is not a substitute for evidence about the actual educational goal.
31. Twenty-four claims for an AI to classify
- 01. “G takes twenty-five minutes” — SUPPORTED.
- 02. “E completes twenty-four questions” — SUPPORTED.
- 03. “A uses less time and completes more questions than C” — SUPPORTED.
- 04. “A dominates C” — SUPPORTED.
- 05. “B dominates D” — SUPPORTED.
- 06. “E dominates D” — SUPPORTED.
- 07. “E dominates F” — SUPPORTED.
- 08. “F dominates E” — CONTRADICTED.
- 09. “D is non-dominated under the two criteria” — CONTRADICTED.
- 10. “G belongs to the Pareto frontier” — SUPPORTED.
- 11. “A belongs to the Pareto frontier” — SUPPORTED.
- 12. “B belongs to the Pareto frontier” — SUPPORTED.
- 13. “E belongs to the Pareto frontier” — SUPPORTED.
- 14. “There are exactly four non-dominated plans” — SUPPORTED.
- 15. “Every non-dominated plan takes the same time” — CONTRADICTED.
- 16. “B is feasible with at most forty minutes and at least fifteen questions” — SUPPORTED.
- 17. “E is uniquely feasible with at most forty-five minutes and at least twenty questions” — SUPPORTED.
- 18. “Plan F completes twenty-two questions in sixty minutes” — SUPPORTED.
- 19. “Plan C requires fewer minutes than A” — CONTRADICTED.
- 20. “Plan E has the greatest question count in the list” — SUPPORTED.
- 21. “Plan E is automatically best for every real pupil” — NOT ESTABLISHED.
- 22. “The question counts prove these plans improve actual learning” — NOT ESTABLISHED.
- 23. “C and D are both dominated” — SUPPORTED.
- 24. “There are three dominated plans” — SUPPORTED.
32. Reconcile the answer-key labels
There are 18 supported statements, 4 contradicted statements and 2 not-established statements, totalling 24. The labels follow from the seven-option ledger and the precise definition of dominance.
The two unknown statements concern real educational effects and individual suitability. The numerical comparison establishes the toy frontier but cannot establish that any particular study method improves a real learner’s knowledge.
33. Why a dominated plan might still be chosen in reality
Imagine C is conducted by a trusted teacher, contains more suitable questions or requires no internet connection. Those attributes are not included in the toy data, so they cannot change the mathematical dominance result as presently defined.
They can, however, change a real recommendation once new relevant criteria and evidence are supplied. A trustworthy AI invites the user to name essential priorities instead of treating two arbitrary columns as a complete description of an educational service.
34. A weighted score is another decision tool
A user might assign importance to minutes and quantity, convert them to comparable scales and calculate a combined score. That can produce a single winner, but the result depends on the weights and normalisation.
Pareto analysis avoids inventing those weights as a first step. It removes options that are clearly inferior without requiring a subjective exchange rate between a minute of time and a completed question.
35. A safe recommendation starts with constraints
First check any non-negotiable conditions: maximum time, accessibility needs, budget, approved content and learner suitability. Then compare the remaining choices on the objectives the user actually values.
A plan that violates a hard constraint is infeasible for that reader, even if it belongs to the Pareto frontier of an unrestricted dataset. Feasibility and non-dominance must not be confused.
36. Can the frontier contain every option?
Yes. If each faster option completes fewer questions and each slower option completes more, none may dominate any other. Every option could be non-dominated under the two metrics.
That outcome would not make Pareto analysis incorrect. It would show that every option involves a trade-off and that further preferences are needed to choose among them.
37. Can the frontier contain just one option?
Yes. If one plan is no slower and completes at least as many questions as every alternative, with a strict improvement against each, it dominates the rest and is the sole frontier member.
Our actual seven-plan fixture does not have such an option. G is fastest and E completes the most, so there is no universal winner under the two criteria.
38. A classroom plotting exercise
Give pupils the seven pairs (minutes, questions) and ask them to plot the points. Draw an arrow from a dominating plan to each inferior plan, using a rule of fewer minutes and at least as many questions.
The learners should identify the four frontier points and explain why C, D and F are eliminated. Then give different time limits and question targets so they see why the final recommendation changes.
39. The central lesson
Pareto dominance tells us when one option is clearly no worse on every stated criterion. The non-dominated frontier retains the genuine trade-offs that cannot be resolved without a person’s priorities.
A reliable AI assistant can identify dominated choices, report the remaining alternatives and ask what constraints matter when necessary. It should not turn a two-column mathematical comparison into a claim about every learner’s real needs.
Frequently asked questions
- What does dominated mean? — Another option is at least as good on every criterion and better on at least one.
- Is every frontier option equally good? — Not for every user; each represents a different trade-off.
- Why is C dominated? — A is faster and completes more questions.
- Why is D dominated? — B uses less time for the same number of questions, and E also beats D.
- Why is G on the frontier despite fewer questions? — It has the shortest duration.
- Does the frontier choose one best plan? — Not necessarily; the user’s priorities determine the final choice.
- Does counting practice questions prove learning? — No, real outcomes need separate evidence.
Connected learning and references
- How Super Intelligence Works — main curriculum.
- Goals, Constraints and Trade-Offs — the broader planning context.
- Greedy Algorithms — local choices and complete plans.
- Weighted Scores — an alternative method for combining criteria.
- Pareto Efficiency — formal background and trade-offs.
- Google OR-Tools — optimisation approaches, constraints and objectives.