Equalized Set Size in Fairness and Prediction

• Equalized Set Size is defined as balancing group-conditional expected set sizes to a constant λ in conformal prediction, reducing the burden of uncertainty on users.
• In fair set cover and allocation, it enforces that each group or agent receives an equal count of selected sets or items, ensuring strict demographic parity.
• The inherent trade-off between achieving equalized coverage and equalized set size highlights the challenges of reconciling predictive accuracy with fairness constraints.

Searching arXiv for the cited papers to ground the article. {"query":"(Gao et al., 14 May 2026) Equalized Set Size conformal prediction", "max_results": 5} {"query":"(Dehghankar et al., 2024) Fair Set Cover demographic parity selected sets equal counts", "max_results": 5} Equalized Set Size denotes a family of cardinality-balancing constraints in which set sizes, or expected set sizes, are required to match across designated units. In the literature considered here, the most explicit formalization appears in conformal prediction, where one chooses group-specific thresholds so that the group-conditional expected prediction-set size is the same constant across groups. Closely related uses arise in fair set cover, where the balanced object is the number of selected sets from each protected group, and in fair allocation, where every agent must receive a bundle of exactly the same size. These formulations are structurally related but not identical: they balance different objects, under different feasibility constraints, and with different fairness implications (Gao et al., 14 May 2026, Dehghankar et al., 2024, Mancho et al., 28 Jul 2025).

1. Domain-specific meanings

In split conformal prediction, Equalized Set Size means equality of group-conditional expected prediction-set size. If $\widehat C_t(X)$ is the prediction set at threshold $t$, and $G(X)=g$ is a prespecified group label, the relevant functional is

$$\ell_g(t):=\mathbb E\big[|\widehat C_t(X)|\mid G=g\big].$$

Equalized Set Size requires group-specific thresholds $t_g$ such that

$\ell_g(t_g)=\lambda \qquad \forall g.$

The equality is therefore in expectation and conditional on group, not pointwise over individual predictions (Gao et al., 14 May 2026).

In fair set cover, the balanced object is different. There, demographic information is attached to the available sets themselves, not to the universe elements, and fairness constrains the composition of the selected cover. With groups $C=\{c_1,\ldots,c_k\}$, target fractions $f_h$, and selected cover $X\subseteq S$, fairness requires

$|X\cap S_h| = f_h\,|X|.$

The closest literal analogue of “equalized set size” is count-parity, where $t$0 for all groups, so the final cover contains the same number of selected sets from each group. This is explicitly not a notion of equal coverage received by demographic groups of elements (Dehghankar et al., 2024).

In fair division under equal-sized bundles, the central constraint is that each agent must receive exactly $t$1 items: $t$2 Because removing an item from another agent’s bundle would violate feasibility, the relevant corrective operation is a one-for-one flip between bundles rather than the removal-based comparison used in standard EF1 and EFX. This shifts the meaning of “almost envy-free” in a cardinality-constrained environment (Mancho et al., 28 Jul 2025).

These usages suggest that Equalized Set Size is best understood as a domain-dependent balancing principle on set cardinality, selected-set representation, or expected predictive ambiguity, rather than as a single universal invariant.

2. Equalized expected set size in conformal prediction

The conformal-prediction formulation is population-level and is built on standard split conformal calibration. With nonconformity score $t$3, calibration scores $t$4, and threshold $t$5, the prediction set is

$t$6

Under pooled calibration one uses a single empirical threshold $t$7, whereas group-conditional calibration uses thresholds $t$8 for each group $t$9. At population level,

$G(X)=g$0

with

$G(X)=g$1

Equalized Set Size introduces a different policy family. Instead of forcing

$G(X)=g$2

it requires a common expected size: $G(X)=g$3 The paper later denotes the corresponding thresholds by $G(X)=g$4, satisfying

$G(X)=g$5

This notion is explicitly motivated as a fairness criterion on the burden of uncertainty communication. Larger prediction sets mean more uncertainty and more burden on the user, so Equalized Set Size asks that different groups not systematically receive larger prediction sets on average. The paper also defines

$G(X)=g$6

the expected set size in group $G(X)=g$7 when using the group’s own coverage-calibrated threshold. These $G(X)=g$8 values are the key bridge between size parity and coverage parity: if they differ, then exact group-wise coverage already induces cross-group set-size disparity (Gao et al., 14 May 2026).

3. Incompatibility with Equalized Coverage

The central theoretical result in the conformal-prediction literature is that Equalized Coverage and Equalized Expected Set Size are generally incompatible. Equalized Coverage is achieved by choosing $G(X)=g$9, so that

$$\ell_g(t):=\mathbb E\big[|\widehat C_t(X)|\mid G=g\big].$$0

Equalized Set Size instead chooses $$\ell_g(t):=\mathbb E\big[|\widehat C_t(X)|\mid G=g\big].$$1 so that

$$\ell_g(t):=\mathbb E\big[|\widehat C_t(X)|\mid G=g\big].$$2

One direction is formalized by the theorem titled “Equalized coverage induces cross-group expected set size disparity.” Under continuity of $$\ell_g(t):=\mathbb E\big[|\widehat C_t(X)|\mid G=g\big].$$3, monotonicity of $$\ell_g(t):=\mathbb E\big[|\widehat C_t(X)|\mid G=g\big].$$4, and the paper’s reference-group condition, groupwise coverage thresholds $$\ell_g(t):=\mathbb E\big[|\widehat C_t(X)|\mid G=g\big].$$5 necessarily create nonzero size disparity: $$\ell_g(t):=\mathbb E\big[|\widehat C_t(X)|\mid G=g\big].$$6 The reverse direction is given by “Equalized expected set size induces cross-group coverage disparity.” With local regularity assumptions, lower-bounded score density $$\ell_g(t):=\mathbb E\big[|\widehat C_t(X)|\mid G=g\big].$$7, derivative bound $$\ell_g(t):=\mathbb E\big[|\widehat C_t(X)|\mid G=g\big].$$8, and

$$\ell_g(t):=\mathbb E\big[|\widehat C_t(X)|\mid G=g\big].$$9

the paper proves that if $t_g$0, then

$t_g$1

while if $t_g$2, then

$t_g$3

Hence, whenever the common target $t_g$4 lies strictly between two distinct $t_g$5 values, coverage disparity is unavoidable (Gao et al., 14 May 2026).

The mechanism is cross-group heterogeneity in the score distributions, measured by

$t_g$6

If $t_g$7, the conflict disappears. If $t_g$8, calibration policy determines where the distortion appears. For pooled threshold $t_g$9, coverage distortion is

$\ell_g(t_g)=\lambda \qquad \forall g.$0

and the conservation law gives

$\ell_g(t_g)=\lambda \qquad \forall g.$1

with $\ell_g(t_g)=\lambda \qquad \forall g.$2 when $\ell_g(t_g)=\lambda \qquad \forall g.$3 is continuous at $\ell_g(t_g)=\lambda \qquad \forall g.$4. The pooled-threshold uncertainty relation then yields

$\ell_g(t_g)=\lambda \qquad \forall g.$5

The same heterogeneity governs the cost of moving between policies. Switching from pooled calibration $\ell_g(t_g)=\lambda \qquad \forall g.$6 to groupwise coverage $\ell_g(t_g)=\lambda \qquad \forall g.$7 incurs RMS set-size distortion

$\ell_g(t_g)=\lambda \qquad \forall g.$8

while moving from $\ell_g(t_g)=\lambda \qquad \forall g.$9 to equalized-size thresholds $C=\{c_1,\ldots,c_k\}$0 incurs RMS coverage distortion

$C=\{c_1,\ldots,c_k\}$1

The empirical results mirror the theory. On Bias in Bios at $C=\{c_1,\ldots,c_k\}$2, pooled RMS coverage distortion is $C=\{c_1,\ldots,c_k\}$3, RMS set-size distortion after $C=\{c_1,\ldots,c_k\}$4 is $C=\{c_1,\ldots,c_k\}$5, and RMS coverage distortion under equalized expected set size is $C=\{c_1,\ldots,c_k\}$6. On MultiNLI, the corresponding values are $C=\{c_1,\ldots,c_k\}$7, $C=\{c_1,\ldots,c_k\}$8, and $C=\{c_1,\ldots,c_k\}$9. On FACET, they are $f_h$0, $f_h$1, and $f_h$2. These experiments support the paper’s claim that group heterogeneity is not removed by calibration; it is displaced between the coverage and size dimensions (Gao et al., 14 May 2026).

4. Equalized selected-set counts in fair set cover

Fair Set Cover introduces an explicit selected-set analogue of Equalized Set Size. In the classical setting, one has a universe

$f_h$3

a family of sets

$f_h$4

and a cover $f_h$5 such that

$f_h$6

The fairness extension assigns each set $f_h$7 to exactly one demographic group $f_h$8, with $f_h$9 denoting the sets of group $X\subseteq S$0. Fairness is demographic parity over the selected sets: $X\subseteq S$1

Two special cases are singled out. In count-parity,

$X\subseteq S$2

so the selected cover contains an equal number of sets from each group. In ratio-parity,

$X\subseteq S$3

so the output preserves the original group proportions in the input family. The generalized framework allows any rational target vector $X\subseteq S$4 summing to $X\subseteq S$5 (Dehghankar et al., 2024).

Algorithmically, exact balancing is enforced through hard combinatorial constraints. In the unweighted count-parity case, each greedy round chooses exactly one set from each group, which is formalized by the max $X\subseteq S$6-color cover subproblem with constraints

$X\subseteq S$7

In the generalized case, if

$X\subseteq S$8

the per-round constraints become

$X\subseteq S$9

Thus exact equalized selected-set counts are not a soft penalty but a hard quota mechanism.

The paper gives three main unweighted methods. A naive post-processing method guarantees exact fairness with approximation ratio

$|X\cap S_h| = f_h\,|X|.$0

An exact-fairness greedy algorithm achieves

$|X\cap S_h| = f_h\,|X|.$1

in

$|X\cap S_h| = f_h\,|X|.$2

A faster LP-based randomized algorithm achieves expected approximation

$|X\cap S_h| = f_h\,|X|.$3

while still preserving exact fairness. Analogous guarantees hold in the weighted setting. The paper also proves that FSC is NP-complete and that, without additional assumptions, there is no polynomial-time approximation ratio $|X\cap S_h| = f_h\,|X|.$4 for any computable nondecreasing $|X\cap S_h| = f_h\,|X|.$5, unless $|X\cap S_h| = f_h\,|X|.$6 (Dehghankar et al., 2024).

Empirically, the price of fairness is small. On the Resume Skills dataset, $|X\cap S_h| = f_h\,|X|.$7 has average fairness ratio $|X\cap S_h| = f_h\,|X|.$8 and average cover size $|X\cap S_h| = f_h\,|X|.$9, while $t$00 has fairness ratio $t$01 and average cover size $t$02. The efficient approximation algorithm $t$03 also achieves fairness ratio $t$04 with average size $t$05. In the paper’s terminology, exact parity therefore yields “zero unfairness” with only a modest increase in output size (Dehghankar et al., 2024).

5. Equal-sized bundles in fair allocation

In fair allocation under equal-sized bundles, the equalization constraint is literal cardinality parity. There are $t$06 agents and $t$07 indivisible goods, $t$08, and an allocation

$t$09

must satisfy

$t$10

Valuations are nonnegative and additive: $t$11

Because bundle size must remain fixed, the relevant local repair operation is a flip. If agent $t$12 holds $t$13 and agent $t$14 holds $t$15, then the one-for-one exchange produces

$t$16

A flip is rational with respect to $t$17 if

$t$18

This yields the notions of envy-freeness up to one flip (EFF1) and envy-freeness up to any flip (EFFX). An allocation is EFF1 if, for every pair $t$19, either $t$20 does not envy $t$21, or there exists a rational flip after which $t$22 does not envy $t$23. It is EFFX if the same holds for every rational flip. The paper also studies multiplicative relaxations such as $t$24-EFFX, and proves that if an allocation is $t$25-EF, then it is also $t$26-EFFX (Mancho et al., 28 Jul 2025).

The fixed-size constraint changes the algorithmic landscape sharply. The paper proves that any generalized Round-Robin algorithm fails to guarantee $t$27-EFFX for every $t$28 whenever $t$29, even for $t$30 agents with identical valuations. A natural equal-size adaptation of envy cycle elimination also fails to guarantee any positive $t$31-EFFX approximation, even for $t$32. At the same time, some positive exact statements survive: any allocation is either EF or $t$33-EFF1; if $t$34, every allocation is EFF1; and when $t$35, EFFX allocations always exist for additive valuations.

Under additional structure, stronger guarantees are available. If agents share a common ranking over item values, the paper’s adapted envy-cycle algorithm returns a

$t$36

allocation, while a lower-bound instance shows that the same algorithm cannot guarantee better than

$t$37

If agents agree on the top $t$38 items and valuations are bounded through

$t$39

a more elaborate envy-graph algorithm with swaps and privileged agents runs in polynomial time and returns a

$t$40

allocation; for $t$41, it returns an exact EFFX allocation. With only $t$42-bounded top-$t$43 valuations and no common top-$t$44 set, the guarantee becomes

$t$45

The efficiency benchmark is $t$46-bundle maximum Nash welfare. The paper proves that any $t$47-bundle MNW-optimal allocation is

$t$48

and that this bound is tight. By contrast, a social-welfare-maximizing allocation may be only

$t$49

and a leximin allocation may be only about

$t$50

The paper also gives examples showing that EFX and EFFX are largely incomparable, so equal-sized bundles do not merely add a side constraint to classical fair division; they alter the underlying fairness geometry (Mancho et al., 28 Jul 2025).

6. Related combinatorial and partitioning notions

A different but related use of equalized or near-equal set size appears in additive combinatorics. For a sequence $t$51 in an abelian group, the paper on subsum representation shows that when

$t$52

one can partition the terms into nonempty sets $t$53 so that

$t$54

and, apart from one highly structured counterexample when $t$55 and $t$56, the partition can be chosen with sizes as equal as possible: $t$57 Here equalization is not a fairness notion but a structural refinement that improves how sumset methods apply to subsum problems (Grynkiewicz, 2019).

In probabilistic combinatorics, equalized set size may refer to a ground set partitioned into equal-sized blocks. One paper partitions $t$58 into blocks of common size $t$59, chooses a random $t$60-subset, and studies

$t$61

Under

$t$62

the probability tends to

$t$63

where

$t$64

Equal block size is essential there because it makes the failure events exchangeable and yields a Poisson-type asymptotic formula (Handelman, 2016).

Equal-cardinality partition optimization provides another nearby notion. Given an even-sized set

$t$65

the problem is to find disjoint complementary subsets

$t$66

with

$t$67

minimizing

$t$68

The paper does not solve the NP-hard global problem, but it gives a locally optimal algorithm under pairwise swaps in

$t$69

Here “equalized set size” means strict equality of subset cardinalities, not equality of sums or expected predictive ambiguity (Gokcesu et al., 2021).

A useful contrast is provided by equal-sum partitioning of

$t$70

into $t$71 subsets $t$72 with

$t$73

That construction problem does not impose equal subset cardinalities, and the recursive algorithm explicitly allows variable numbers of elements per subset. It is therefore about equalized subset sums, not equalized set size in the cardinality sense (Büchel et al., 2018).