What does Partner Selection on the Pareto Frontier conclude, in numbers, about “The Pareto Front: Why Weighted Scoring Misses the Part That Bends Inward”?
Answer: With no floors all 300 people pass, 9 of them on the front. With both floors at 0.5, 43 people remain, a share of 0.143, 3 of them on the front. With both at 0.6, 14 remain, a share of 0.047. With the floors at 0.7 and 0.7, only 2 people remain, a share of 0.007, and only 1 of them is on the front. With both floors at 0.8 nobody remains.
Scope of the numbers: Its populations, traits and parameters are synthetic or illustrative, and all calculations are generated by its programs. Marked boxes separate evidence, hypotheses and classical sources; the book contains 22 programs.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.007, 0.047, 0.143, 0.5, 0.6, 0.7
| floor fs | floor fe | pass | on front | share passing |
|---|---|---|---|---|
| 0.0 | 0.0 | 300 | 9 | 1.000 |
| 0.5 | 0.5 | 43 | 3 | 0.143 |
| 0.6 | 0.6 | 14 | 2 | 0.047 |
| 0.7 | 0.6 | 4 | 1 | 0.013 |
| 0.7 | 0.7 | 2 | 1 | 0.007 |
| 0.8 | 0.7 | 2 | 1 | 0.007 |
| 0.8 | 0.8 | 0 | 0 | 0.000 |
| once the floors pass the front, no candidate in this pool clears | ||||
| them; the empty set is a property of the floors, not of the pool |
Show the full program
# Chapter 4. p43: hard floors cut the front; when floors meet, it is empty
# Same synthetic pool as p41 (seed 41401). A chooser sets floors on
# both objectives: S >= fs and E >= fe. Count candidates that pass and
# how many of them sit on the first front of the full pool.
import random
rng = random.Random(41401)
N = 300
pool = []
for _ in range(N):
s = rng.random()
cap = 1.0 - 0.6 * s + rng.gauss(0.0, 0.12)
e = max(0.0, min(1.0, cap * rng.random() ** 0.35))
pool.append((round(s, 4), round(e, 4)))
def on_front(p, pts):
for q in pts:
if q[0] >= p[0] and q[1] >= p[1] and q != p:
return False
return True
front = [p for p in pool if on_front(p, pool)]
print("floor fs floor fe pass on front share passing")
for fs, fe in ((0.0, 0.0), (0.5, 0.5), (0.6, 0.6), (0.7, 0.6),
(0.7, 0.7), (0.8, 0.7), (0.8, 0.8)):
ok = [p for p in pool if p[0] >= fs and p[1] >= fe]
onf = [p for p in front if p[0] >= fs and p[1] >= fe]
print("{:8.1f} {:8.1f} {:4d} {:8d} {:13.3f}".format(
fs, fe, len(ok), len(onf), len(ok) / N))
print("once the floors pass the front, no candidate in this pool clears")
print("them; the empty set is a property of the floors, not of the pool")Single source and citation
Fan, Y. (2026). Dual-Mating Multi-Objective Conflicts, Parental-Investment Asymmetry and the Pareto Frontier of Partner Selection (Version 1.0.0), Chapter 4: The Pareto Front: Why Weighted Scoring Misses the Part That Bends Inward. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-421 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026421,
author = {Fan, Yafu},
title = {Dual-Mating Multi-Objective Conflicts, Parental-Investment Asymmetry and the Pareto Frontier of Partner Selection},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Roles, Not Sexes: Asymmetric Parental Investment, Acceptance Thresholds and Overlapping Effect Sizes
- Chapter 2 · Berkson Selection: Where the Observed Trade-off Comes From
- Chapter 3 · The Collapse of the Feasible Set: The "Impossible Triangle" as a Joint-Threshold Probability
- Chapter 5 · Budget Constraints and Stated Preferences: Necessities, Luxuries and a Test of the "Dual-Track" Hypothesis
- Chapter 6 · Bargaining Boundaries and Stable Matching: Outside Options, Threat Points and the Single Rate of "Wanting It All"
- Chapter 7 · Classical Sources East and West: Exit Costs in "Mang", the Multi-Objective Contract of the "Meaning of the Marriage Rite" and Darwin in 1871
- Chapter 8 · Field Tools and Checker Specifications: Calculator, Checkers, Ledger and Preregistered Tests