Pith. sign in

REVIEW 4 major objections 4 minor 28 references

What Pareto-Efficiency Adjustments Cannot Fix

T0 review · 4 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Segregation survives every Pareto-efficiency fix to school choice

desk verdict Real results under narrow assumptions, but Proposition 1's statement outruns its proof and the abstract's segregation claim omits the priority condition that makes it true. read the letter →

arxiv 2506.11660 v1 pith:KIHWKLSR submitted 2025-06-13 econ.TH

Josue Ortega , Gabriel Ziegler , R. Pablo Arribillaga , Geng Zhao This is my paper · ORCID
classification econ.TH MSC 91B6891B32
keywords schoolchoicedeferredacceptancestable-dominatingmechanismssegregationrank-efficiencyRawlsianinequalityunimprovablestudentsParetoefficiency
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper asks whether mechanisms designed to fix the Pareto-inefficiency of the Deferred Acceptance (DA) algorithm also fix its distributional problems, and finds they cannot. The authors prove that any Pareto-efficient mechanism that weakly dominates DA preserves the exact number of advantaged and marginalized students at every school, so a school that is fully segregated under DA stays fully segregated. They also prove tight worst-case bounds: both Rawlsian inequality and rank-inefficiency can be as bad as half the number of schools under these mechanisms, even when DA itself is Pareto-efficient. The practical consequence is that efficiency-adjusted admissions reforms, however useful for student welfare, cannot by themselves reduce school segregation or guarantee equitable outcomes.

What carries the argument

The proof machinery is the envy digraph $G^{DA}(P)$ induced by the DA matching, in which each student points to students whose assignments they prefer. A student is unimprovable exactly when they lie on no cycle in this digraph (Lemma 3). The paper shows that when marginalized students have lower priority than every advantaged student at every school, no trading cycle can contain both groups, because an advantaged student envying a marginalized student's school would form a blocking pair with that school. Advantaged students at mixed schools are shown to be unimprovable, and at least one marginalized student is unimprovable, so all trades occur within groups, preserving each school's group composition.

What would settle it

Run a stable-dominating mechanism such as EADA on a school-choice problem where a marginalized student has a walk-zone or lottery priority that outranks some advantaged student at a desirable school; if the school's share of marginalized students changes relative to DA, the tiered-priority assumption is the operative condition, not the mechanism class. Alternatively, construct a stable-dominating matching that changes the demographic composition of a school under tiered priorities—this would directly contradict Theorem 1.

Watch

Extended reading notes

Core claim

The central claim is that stable-dominating mechanisms—mechanisms that produce Pareto-efficient matchings weakly dominating the DA outcome—are structurally incapable of changing the demographic composition of any school when students are partitioned into advantaged and marginalized groups with tiered priorities. Theorem 1 states that the number of advantaged and marginalized students accepted to each school under any stable-dominating mechanism is constant, hence fully segregated schools under DA remain fully segregated. Proposition 1 shows that the worst-case Rawlsian inequality ratio and the worst-case rank-inefficiency ratio for such mechanisms are both exactly $n/2$, where $n$ is the number of schools, and these ratios are tight; the motivating example shows a Pareto-efficient DA allocation where the worst-off student gets rank $n$ while an alternative Pareto-efficient allocation gives everyone rank at most 2.

Load-bearing premise

The segregation theorem assumes that every marginalized student has lower priority than every advantaged student at every school; if real priorities allow the groups to interleave, the conclusion that trading cycles never mix groups can fail.

Editorial extensions

If this is right

  • Any stable-dominating mechanism, including EADA, DA-endowed top trading cycles, and MIDA, leaves the number of advantaged and marginalized students at each school exactly as DA did.
  • Schools that are fully segregated under DA—admitting only advantaged or only marginalized students—remain fully segregated under every Pareto-efficient mechanism that dominates DA.
  • The worst-case Rawlsian inequality of stable-dominating mechanisms is $n/2$ times the first-best, where $n$ is the number of schools, and this bound is tight.
  • The worst-case rank-inefficiency of stable-dominating and Pareto-efficient mechanisms is also $n/2$ times the rank-minimizing benchmark, so efficiency adjustments cannot guarantee good average ranks in the worst case.
  • Reducing segregation in school choice requires interventions that go beyond Pareto improvements, such as changing priority structures or implementing quota or reserve policies.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The segregation-preservation result depends on the strict tiered-priority assumption; in real systems with walk-zone, sibling, or lottery priorities that interleave groups, trading cycles could cross the advantaged-marginalized divide and alter school composition, so the invariance is a property of tiered priorities rather than of stable-dominating mechanisms in general.
  • The same composition-invariance argument extends to any number of priority tiers, implying that efficiency adjustments cannot reduce stratification in multi-tier settings either, and only deliberate priority violations—such as reserved seats—are likely to integrate schools.
  • A direct empirical test would be to run a stable-dominating mechanism like EADA on a school-choice dataset with interleaved priorities (for example, where some marginalized students live in the walk zone of a desirable school) and check whether the share of marginalized students at mixed schools changes; this would separate the tiered-priority mechanism from the general conclusion.
  • The $n/2$ worst-case ratios suggest that the cost of stability and Pareto-efficiency is unbounded in the number of schools, so policy debates about DA versus alternatives should focus on average-case behavior and on explicit equity constraints rather than on worst-case guarantees.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper studies mechanisms that weakly Pareto-dominate the student-proposing Deferred Acceptance (DA) outcome, called stable-dominating mechanisms. It makes two main claims. First, even when DA is Pareto-efficient, stable-dominating mechanisms can be a factor n/2 worse than the Rawlsian and rank-minimizing mechanisms in terms of the worst-off student's rank and the average rank (Proposition 1). Second, under the assumption that students are divided into advantaged and marginalized groups with every marginalized student having lower priority than every advantaged student at every school, any stable-dominating mechanism preserves the exact advantaged/marginalized composition of every school, so fully segregated schools under DA remain fully segregated (Theorem 1, Propositions 2-4). The paper concludes that efficiency adjustments cannot fix DA's rank-inefficiency, inequality, or segregation.

Significance. The paper addresses a timely policy question, and the core negative results, if properly qualified, are interesting. The tight n/2 examples are clean and make the point that Pareto efficiency is compatible with severe rank-inequality and inequality. The segregation invariance under nested priorities is a crisp, non-obvious result and complements empirical work on DA segregation. The proof strategy via the envy digraph is promising. However, the current manuscript's abstract and Theorem 1 overreach beyond the model's assumptions, and Proposition 1's proof contains gaps. These issues are fixable without changing the central ideas.

major comments (4)
  1. [Abstract; §4.2, Theorem 1] The abstract states that the demographic composition of every school is perfectly preserved under any Pareto-efficient mechanism that dominates DA, without the qualifying assumption introduced in Section 4.2 that every marginalized student has lower priority than every advantaged student at every school. This assumption is indispensable. Consider four unit-capacity schools s1-s4 with students A1,A2 (advantaged) and M,X (marginalized). Preferences: A1: s2≻s1≻s3≻s4; M: s1≻s2≻s3≻s4; A2: s3≻s1≻s2≻s4; X: s2≻s4≻s3≻s1. Priorities: s1: A1≻M≻X≻A2; s2: M≻X≻A1≻A2; s3: A2≻A1≻M≻X; s4: X≻A1≻A2≻M. DA assigns A1-s1, M-s2, A2-s3, X-s4. The matching A1-s2, M-s1, A2-s3, X-s4 weakly Pareto-dominates DA and is Pareto-efficient, yet s1 changes from advantaged-only to marginalized-only and s2 from marginalized-only to advantaged-only. The theorem and the policy conclusion that any segregation-reducing policy must go beyond Pareto improvements must therefore be explicitly conditioned on the nested-priority assumption.
  2. [§4.1, Proposition 1] The upper-bound proof for RkI is not valid as written. The sentence 'The sum of ranks in RM(P) cannot be any smaller than n+1' is false for problems with m<n; for example, with m=2 and n=10, both students can receive their first choice, giving a sum of 2. The follow-up 'as otherwise M†(P)=RM(P)' is also not established, since a Pareto-efficient mechanism can have a strictly larger sum of ranks than the rank-minimizing mechanism. Consequently the claimed bound RkI(M′;n)≤n/2 does not follow from the supplied argument. The Rawlsian part also needs a sentence explaining why an arbitrary mechanism M* (not only DA) must assign every student to their top choice when the Rawlsian denominator is 1. Please supply a correct proof or restrict the statement to the case m=n where the construction applies.
  3. [§3, Eqs. (1)-(2)] The model allows a null school s∅ for unassigned students, but the rank function rk_i is defined only on the finite set S with values 1..n. Therefore max_i rk_i[M_i(P)] and sum_i rk_i[M_i(P)] are undefined for any problem in which some student is assigned to s∅. Either restrict P_{m,n} to instances with no unassigned students or extend the rank function to include s∅ with a suitably large rank, and re-verify Proposition 1 under that convention.
  4. [§4.2, Propositions 2 and Theorem 1] The proof of Proposition 2 contains a non sequitur: after showing that no rejection occurs at school s in round t, it states 'Then school s does not reject any student at time t′≤t.' Earlier rejections at s are not ruled out by the argument, and an extra monotonicity argument is needed to exclude them. Since Theorem 1's proof explicitly invokes Proposition 2, this gap matters. In addition, the proof of Theorem 1 jumps from 'advantaged students at mixed schools are unimprovable' and 'some marginalized student is unimprovable' to exact count preservation; the authors should either provide a formal cycle-decomposition argument (which could use Proposition 3 and Lemma 2 directly) or rewrite the proof.
minor comments (4)
  1. [§1, Table 1] The text refers to 'Table 2 below' for the six-student motivating example, but the table is labeled TABLE 1; the later eight-student example is labeled TABLE 2.
  2. [§4.1, Footnote 4] Footnote 4's statement of school priorities is hard to parse; please write it in explicit quantifier form and specify the remaining preferences and priorities, or state clearly that they are arbitrary.
  3. [§3.1, Lemma 3] Lemma 3 is load-bearing for the segregation result and is attributed in part to the authors' companion paper (Ortega et al., 2025); please include a self-contained proof or ensure the companion manuscript is publicly available.
  4. [§4.2, Proof of Theorem 1] The sentence 'No advantaged student can access this school through any cycle (nor would like to)' is unclear; the parenthetical 'nor would like to' should be justified or removed.

Circularity Check

0 steps flagged · score 2.0 of 10

No meaningful circularity: core results follow from independently grounded lemmas and an explicit priority assumption; the self-citations are not load-bearing.

full rationale

The paper contains no fitted parameter relabeled as a prediction and no derivation that reduces to its own inputs. Proposition 1 is proved by an explicit worst-case construction and elementary rank bounds; the n/2 ratios are not hidden restatements of the definition of stable-dominating. Theorem 1 is conditional on the Section 4.2 assumption that every marginalized student has lower priority than every advantaged student at every school; under that assumption, the composition-invariance conclusion follows from DA stability plus the trading-cycle characterization of unimprovability. The abstract states the segregation result without restating this assumption, which is a scope/overreach concern, not a circularity. The only self-citations are the envy-digraph concept and Lemma 3, but Lemma 3 is also attributed to Kesten (2010), Erdil (2014), and Tang and Yu (2014), so it has independent grounding; the companion-paper references to MIDA and welfare results are contextual rather than load-bearing. Accordingly, the derivation chain is self-contained apart from minor, non-load-bearing self-citation.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

Pure theory with no parameters fitted to data. The results use the standard school-choice model and prior lemmas; the only strong modeling assumption is the group-ordered priority structure. The rank of the null school is not defined, a technical loose end.

assumptions (4)
  • domain assumption School choice problem has finite students/schools, strict student preferences, strict school priorities, and quotas.
    Standard model from Abdulkadiroglu and Sonmez (2003), Section 3.
  • domain assumption Marginalized students have lower priority than every advantaged student at every school.
    Section 4.2, before Proposition 2. This extreme priority structure is the condition under which the segregation invariance result is proved.
  • standard math Unimprovable students are exactly those outside cycles of the DA envy digraph (Lemma 3).
    Quoted from Kesten (2010), Erdil (2014), Tang and Yu (2014), and the authors' companion paper; used to prove Propositions 3-4 and Theorem 1.
  • standard math Every Pareto-efficient matching can be obtained as a serial dictatorship.
    Used in the Proposition 1 upper bound on rank-inefficiency; a known result in assignment theory.

how reviews work

0 comments
Cite this review

Pith. "Pith review of What Pareto-Efficiency Adjustments Cannot Fix." pith.science (2026). https://pith.science/paper/KIHWKLSR

@misc{pith2026250611660,
  author       = {Pith},
  title        = {Pith review of: What Pareto-Efficiency Adjustments Cannot Fix},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KIHWKLSR}},
  note         = {Machine review of arXiv:2506.11660}
}
read the original abstract

The Deferred Acceptance (DA) algorithm is stable and strategy-proof, but can produce outcomes that are Pareto-inefficient for students, and thus several alternative mechanisms have been proposed to correct this inefficiency. However, we show that these mechanisms cannot correct DA's rank-inefficiency and inequality, because these shortcomings can arise even in cases where DA is Pareto-efficient. We also examine students' segregation in settings with advantaged and marginalized students. We prove that the demographic composition of every school is perfectly preserved under any Pareto-efficient mechanism that dominates DA, and consequently fully segregated schools under DA maintain their extreme homogeneity.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

28 extracted references · 27 canonical work pages

  1. [1]

    Strategy-proofness ver- sus efficiency in matching with indifferences: Redesigning the nyc high school match

    Abdulkadiro˘glu, Atila, Parag A Pathak, and Alvin E Roth (2009), “Strategy-proofness ver- sus efficiency in matching with indifferences: Redesigning the nyc high school match.” American Economic Review, 99(5), 1954–78

    work page 2009

  2. [2]

    School choice: A mechanism design approach

    Abdulkadiro˘glu, Atila and Tayfun Sönmez (2003), “School choice: A mechanism design approach.” American Economic Review, 93(3), 729–747. [2, 5] Afacan, Mustafa Oguz, Zeynel Harun Aliogullari, and Mehmet Barlo (2017), “Sticky matching in school choice.” Economic Theory, 64, 509–538

    work page 2003

  3. [4]

    Rawlsian matching

    Afacan, Mustafa O˘guz and Umut Dur (2024), “Rawlsian matching.”Mathematical Social Sciences, 129, 101–106

    work page 2024

  4. [5]

    Catchment areas, stratification, and access to better schools

    Calsamiglia, Caterina and Antonio Miralles (2023), “Catchment areas, stratification, and access to better schools.” International Economic Review, 64(4), 1469–1492. [5, 14] Cerrone, Claudia, Yoan Hermstrüwer, and Onur Kesten (2024), “School choice with con- sent: An experiment.” The Economic Journal. [4, 5] Chen, Yiqiu and Markus Moller (2023), “Regret-fr...

    work page 2023

  5. [6]

    School choice with consent

    [5, 15] Kesten, Onur (2010), “School choice with consent.” The Quarterly Journal of Economics, 125(3), 1297–1348. [2, 4, 7, 8] Knipe, Taylor and Josué Ortega (2025), “Improvable students in school choice.” arXiv preprint arXiv:2504.12871. [4, 7] Kojima, Fuhito (2012), “School choice: Impossibilities for affirmative action.”Games and Economic Behavior, 75(...

    arXiv 2010

  6. [7]

    School choice design, risk aversion and cardinal segregation

    Calsamiglia, Caterina, Francisco Martínez-Mora, and Antonio Miralles (2021), “School choice design, risk aversion and cardinal segregation.” The Economic Journal, 131(635), 1081–1104

    work page 2021

  7. [8]

    Stable-dominating rules

    Alva, Samson and Vikram Manjunath (2019), “Stable-dominating rules.” Technical re- port, Working paper, University of Ottawa. [3, 5, 7] Anshelevich, Elliot, Anirban Dasgupta, Jon Kleinberg, Éva Tardos, Tom Wexler, and Tim Roughgarden (2008), “The price of stability for network design with fair cost allocation.” SIAM Journal on Computing, 38(4), 1602–1623

    work page 2019

  8. [9]

    College admission with multidimensional priv- ileges: The brazilian affirmative action case

    Aygün, Orhan and Inácio Bó (2021), “College admission with multidimensional priv- ileges: The brazilian affirmative action case.” American Economic Journal: Microeco- nomics, 13(3), 1–28

    work page 2021

Show all 28 references
  1. [10]

    Rawlsian assignments

    Demeulemeester, Tom and Juan Pereyra (2022), “Rawlsian assignments.”arXiv preprint

    2022

  2. [11]

    Matching with indifferences: A comparison of algorithms in the context of course allocation

    Diebold, Franz and Martin Bichler (2017), “Matching with indifferences: A comparison of algorithms in the context of course allocation.” European Journal of Operational Re- search, 260(1), 268–282

    2017

  3. [12]

    School choice under partial fair- ness

    Dur, Umut, A Arda Gitmez, and Özgür Yılmaz (2019), “School choice under partial fair- ness.” Theoretical Economics, 14(4), 1309–1346

    2019

  4. [13]

    Strategy-proof stochastic assignment

    17 Erdil, Aytek (2014), “Strategy-proof stochastic assignment.”Journal of Economic Theory, 151, 146–162

    2014

  5. [14]

    Segregation and affirmative action in school choice

    Escobar, Juan F and Leonel Huerta (2025), “Segregation and affirmative action in school choice.” Journal of Political Economy: Microeconomics. [5, 15] Featherstone, Clayton (2020), “Rank efficiency: Modeling a common policymaker objec- tive.” Unpublished paper , University of ...

    2025

  6. [15]

    Preferences and the price of stability in matching markets

    Boudreau, James W and Vicki Knoblauch (2013), “Preferences and the price of stability in matching markets.” Theory and Decision, 74, 565–589

    2013

  7. [16]

    College admissions and the stability of mar- riage

    Gale, David and Lloyd S Shapley (1962), “College admissions and the stability of mar- riage.” The American Mathematical Monthly, 69(1), 9–15

    1962

  8. [17]

    Stable and extremely un- equal

    Galichon, Alfred, Octavia Ghelfi, and Marc Henry (2023), “Stable and extremely un- equal.” Economics Letters, 226, 111101

    2023

  9. [18]

    Effective affirma- tive action in school choice

    Hafalir, Isa E, M Bumin Yenmez, and Muhammed A Yildirim (2013), “Effective affirma- tive action in school choice.” Theoretical Economics, 8(2), 325–363

    2013

  10. [19]

    School choice priority structures and school segregation

    Kessel, Dany and Elisabet Olme (2018), “School choice priority structures and school segregation.” Unpublished working paper,

    2018

  11. [20]

    Worst-case equilibria

    Koutsoupias, Elias and Christos Papadimitriou (1999), “Worst-case equilibria.” In An- nual symposium on theoretical aspects of computer science, 404–413, Springer

    1999

  12. [21]

    Centralized admission systems and school segregation: Evidence from a national reform

    Kutscher, Macarena, Shanjukta Nath, and Sergio Urzúa (2023), “Centralized admission systems and school segregation: Evidence from a national reform.”Journal of Public Eco- nomics, 221, 104863. [3, 5, 11, 14] Kuvalekar, Aditya and Antonio Romero-Medina (2024), “ A fair procedur...

    2023

  13. [22]

    The cost of strategy-proofness in school choice

    Ortega, Josué and Thilo Klein (2023), “The cost of strategy-proofness in school choice.” Games and Economic Behavior, 141, 515–528

    2023

  14. [23]

    Identifying and quantifying (un)improvable students

    Ortega, Josué, Gabriel Ziegler, Pablo Arribillaga, and Geng Zhao (2025), “Identifying and quantifying (un)improvable students.” arXiv preprint. [5, 8, 15] Pycia, Marek (2019), “Evaluating with statistics: Which outcome measures differentiate among matching mechanisms?” Unpubli...

    2025

  15. [24]

    Harvard University Press

    Rawls, John (1971), A Theory of Justice. Harvard University Press

    1971

  16. [25]

    Oxford University Press

    Sen, Amaryta (1999), On ethics and economics. Oxford University Press

    1999

  17. [26]

    A new perspective on kesten’ s school choice with consent idea

    18 Tang, Qianfeng and Jingsheng Yu (2014), “ A new perspective on kesten’ s school choice with consent idea.” Journal of Economic Theory, 154, 543–561. [5, 7, 8] Tang, Qianfeng and Yongchao Zhang (2021), “Weak stability and pareto efficiency in school choice.” Economic Theory,...

    2014

  18. [27]

    From immediate acceptance to deferred acceptance: effects on school admissions and achievement in england

    Terrier, Camille, Parag A Pathak, and Kevin Ren (2021), “From immediate acceptance to deferred acceptance: effects on school admissions and achievement in england.” Tech- nical report, National Bureau of Economic Research. [3, 5, 11, 14] Troyan, Peter, David Delacrétaz, and An...

    2021

  19. [28]

    Obvious manipulations

    Troyan, Peter and Thayer Morrill (2020), “Obvious manipulations.”Journal of Economic Theory, 185, 104970

    2020

  20. [29]

    School choice in- creases racial segregation even when parents do not care about race

    Ukanwa, Kalinda, Aziza C Jones, and Broderick L Turner Jr (2022), “School choice in- creases racial segregation even when parents do not care about race.”Proceedings of the National Academy of Sciences, 119(35), e2117979119. [5]

    2022

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.