← All parts of this equation

Equation 12 · Part 10 · Why Cost and Latency Belong in the Evaluation Score, Not a Footnote

≥

A≻B  ⟺  sA≥sB,  cA≤cB,  lA≤lB,  with at least one inequality strict.A \succ B \iff s_A \ge s_B,\ \ c_A \le c_B,\ \ l_A \le l_B,\ \ \text{with at least one inequality strict.}
≥

What this part means

Greater than or equal to.

Its job in the formula

Greater than or equal to.

The passage around this formula

Given that, the more defensible comparison between two agents is not a rank at all. It is a dominance relation. Say agent A Pareto-dominates agent B if A is at least as good on every axis and strictly better on at least one: A≻B  ⟺  sA≥sB,  cA≤cB,  lA≤lB,  with at least one inequality strict.A \succ B \iff s_A \ge s_B,\ \ c_A \le c_B,\ \ l_A \le l_B,\ \ \text{with at least one inequality strict.}. The Pareto frontier across a set of candidate agents is the subset that no other candidate dominates — the agents for which improving on any one axis would require giving something up on another. This relation makes no assumption about how much a point of accuracy is worth in dollars or seconds. It only says when one agent is unambiguously not worse than another. That is a weaker claim than a rank, and it is weaker on purpose: it is the claim the…

Read this part in the article →

Learn the underlying idea

An inequality compares values without claiming they are equal. It describes a range, threshold, or bound that a quantity may satisfy.

Open the illustrated inequalities: bounds and allowed ranges guide →

Sources cited in the article section

These citations provide research context; check each source for the exact claim it supports.