| paper | Approximating One-Sided and Two-Sided Nash Social Welfare With Capacities |
| authors | — |
| venue | AAMAS 2025 |
| filed under | fairalloc · indivisible |
| judged by | gpt-5.6-luna / xhigh (triple__luna__xhigh__c2r1) |
| judge confidence | high |
| authors would recognise it | yes |
Theorem 4.1
statement extracted from the paper’s text layer
Given finite firm types \(\mathcal F\), worker types \(\mathcal W\), rational masses \(\phi_f,\psi_w\), capacities \(\c_f\), type-symmetric monotone normalized subadditive valuations \(V_f(b)\) for integral bundles \(b\in\mathbb Z_{\ge0}^{\mathcal W}\) with \(\lVert b\rVert_1\le c_f\), and worker values \(\omega_w(f)\), choose firm-mass variables \(z_{f,b}\) satisfying \(\sum_b z_{f,b}=\phi_f\) and \(\sum_{f,b}b_wz_{f,b}=\psi_w\) to maximize population Nash welfare \(\exp((\sum_{f,b}z_{f,b}\log V_f(b)+\sum_{f,b,w}b_wz_{f,b}\log\omega_w(f))/(\sum_f\phi_f+\sum_w\psi_w))\), or compute a specified-factor approximation.
A high-multiplicity two-sided labour market with \(\phi_f\) identical firms of each type and \(\psi_w\) identical workers of each type; \(z_{f,b}\) distributes firm mass over integral bundles, while worker-type mass constraints enforce matching and the objective is weighted logarithmic Nash welfare.
The type-level valuation representation and the claimed \(1.33\)-approximation lift require a formal treatment of count-based subadditive valuations, configuration feasibility, and oracle complexity that the paper itself does not provide.
fatal: False
The mirror directly covers the two-sided setting and Theorem 4.1's approximation structure; Theorem 5.1 is covered only after replacing the invalid averaging formulation by integral per-firm configurations, while Theorem 3.1 is left aside.
The strongest positive case is a high-multiplicity two-sided labour-market mirror. My lead anchor is Theorem 4.1, proved in this paper: there is a \(1.33\)-approximation for Capacitated Two-Sided NSW under subadditive firm valuations.
Imagine a large centralized labour market with millions of workers and many employer units, but only a few hundred recurring worker and employer profiles. A worker type contains the complete vector of values for employer types. A firm type contains its capacity and its complete valuation over bundles of worker types. Thus agents of one type are genuinely indistinguishable; idiosyncratic prices or preferences would simply define separate types.
Let \(\mathcal F\) and \(\mathcal W\) be finite sets of firm and worker types, with masses \(\phi_f,\psi_w\in\mathbb Q_{\ge0}\). A firm type \(f\) has capacity \(c_f\) and a monotone, normalized, subadditive valuation
\[ V_f(b),\qquad b\in\mathbb Z_{\ge0}^{\mathcal W},\quad \lVert b\rVert_1\le c_f, \]
where \(b_w\) is the number of workers of type \(w\) in the bundle. A worker type \(w\) has cardinal value \(\omega_w(f)\) for firm type \(f\).
The continuous problem is:
\[ \textsc{Capacitated Two-Sided NSW}_{\infty} \]
Choose \(z_{f,b}\ge0\), where \(z_{f,b}\) is the mass of firms of type \(f\) receiving bundle \(b\), subject to
\[ \sum_b z_{f,b}=\phi_f \]
for every \(f\), and
\[ \sum_{f,b} b_w z_{f,b}\le \psi_w \]
for every worker type \(w\). In the positive-welfare regime, all worker mass is matched. The objective is the population Nash welfare
\[ \operatorname{NSW}_{\infty}(z) = \exp\!\left( \frac{ \displaystyle \sum_{f,b}z_{f,b}\log V_f(b) + \sum_{f,b,w}b_wz_{f,b}\log\omega_w(f) }{ \displaystyle \sum_f\phi_f+\sum_w\psi_w } \right). \]
The task is to output a feasible mass allocation maximizing this quantity, or an \(\alpha\)-approximation to it.
This is recognizably the authors’ problem, not a tractability-induced simplification: firms still receive bundles, capacities remain per firm, firm valuations remain combinatorial, and workers still choose among firms. Only the population has been replaced by masses. A rational solution can be implemented by assigning the corresponding fractions of a large cohort of identical workers and firms.
The paper’s flow proof also survives aggregation. Give each firm type a “main” copy of capacity \(\phi_f\) and a secondary copy of capacity \((c_f-1)\phi_f\). A worker-type-to-main-copy edge has cost
\[ -\log\!\bigl(V_f(e_w)\omega_w(f)\bigr), \]
and an edge to a secondary copy has cost
\[ -\log\omega_w(f). \]
This is a minimum-cost flow over types and masses. Subadditivity gives
\[ V_f(b)\le \lVert b\rVert_1\max_{w:b_w>0}V_f(e_w), \]
and weighted AM–GM bounds the aggregate bundle-size loss by
\[ \left(\frac{\Psi}{\Phi}\right)^{\Phi/(\Phi+\Psi)}, \qquad \Phi=\sum_f\phi_f,\quad \Psi=\sum_w\psi_w, \]
whose maximum is below \(1.33\). I therefore expect this mirror to be Class A: the paper’s \(1.33\)-approximation should extend to the type-level problem, with exact optimization and sharper ratios becoming pricing questions.
The main follow-up questions are whether additive valuations permit an exact convex or flow formulation, whether fixed numbers of firm types yield a PTAS, and whether arbitrary subadditive type valuations create a genuinely continuum-specific pricing problem.
A second, especially clean anchor is Theorem 5.1, also proved in this paper. It states that Uncapacitated Two-Sided NSW is NP-hard to approximate within \(1.0000759\) under additive valuations. Its proof uses Lemma 5.2, modified from Garg and Murhekar [23], but Theorem 5.1 itself is established here.
For its continuous mirror, take additive firm values \(v_f(w)\), no firm capacity, and masses \(\phi_f,\psi_w\). Let \(x_{fw}\) be the mass of workers of type \(w\) assigned to firms of type \(f\), with
\[ \sum_f x_{fw}=\psi_w. \]
In the nonatomic limit, identical firms of type \(f\) can be balanced, so each receives average utility
\[ \bar u_f(x)=\frac{1}{\phi_f}\sum_w v_f(w)x_{fw}. \]
The continuous problem is to maximize
\[ \exp\!\left( \frac{ \displaystyle \sum_f\phi_f\log \bar u_f(x) + \sum_{f,w}x_{fw}\log\omega_w(f) }{ \displaystyle \sum_f\phi_f+\sum_w\psi_w } \right). \]
This is a concave maximization over linear flow constraints: the firm terms are logarithms of affine functions of \(x\), and the worker terms are linear. Hence it should admit a polynomial-time \((1+\varepsilon)\)-approximation through standard convex optimization. In the theorem’s reduction, worker values are uniformly \(1\), so the worker term is constant and the structure is even simpler.
This is a good example of hardness disappearing for the right reason. The theorem’s reduction encodes indivisible item allocation. In the high-multiplicity mirror, \(x_{fw}\) is not a fractional individual worker: it is a fraction of a large cohort of identical workers. The combinatorics caused by indivisibility vanish, while the two-sided Nash objective and additive preferences remain.
I would not anchor on Theorem 3.1 without additional assumptions. A one-sided mirror is plausible, but arbitrary submodular valuations over named items do not automatically induce a canonical valuation over masses of item types. The two-sided additive and subadditive settings provide a substantially cleaner case.
The weakest point is precisely this valuation-extension issue. The mirror requires symmetry within worker types: a firm’s value must depend on the counts of worker profiles, not on hidden identities among supposedly identical workers. The paper’s oracle model alone does not guarantee that. The uncapacitated scenario in Theorem 5.1 is also less realistic than the capacitated labour-market setting. But the symmetric repeated-cohort regime is a legitimate high-multiplicity instance family, and Theorem 4.1 gives a concrete, capacity-sensitive mirror whose algorithmic structure is already visible in the paper.
The strongest negative point is that the proponent’s cleanest formulation of Theorem 5.1 is not actually the high-multiplicity limit of the paper’s objective. It replaces each firm’s utility by an average utility and then takes its logarithm. Nash welfare does not commute with that averaging.
For example, take two identical firms and three identical workers, with additive value \(1\) for every worker and worker value \(1\) for every firm. Every integral matching giving both firms positive utility has bundle sizes \(1\) and \(2\), so the firms’ geometric mean is \(\sqrt{2}\). The proposed continuous formula gives both firms average utility \(3/2\), hence welfare \(3/2\). Replicating this market \(k\) times does not remove the gap: the normalized logarithmic firm welfare remains \(\frac{1}{2}\log 2\), not \(\log(3/2)\). This is Jensen’s inequality, not a vanishing finite-population artefact.
The faithful mirror must therefore retain integral per-firm configurations, with variables \(z_{f,b}\) denoting mass of firms receiving bundle \(b\), and objective \(\sum_{f,b}z_{f,b}\log V_f(b)\). That defeats the proponent’s claimed concave-flow formulation for Theorem 5.1. It also means the paper’s reduction does not automatically yield either hardness or tractability for the repaired problem: one has introduced a configuration problem with potentially exponentially many integer bundles and a nontrivial pricing problem. This is a legitimate research direction, but it is not the continuous convex program claimed in the positive case.
That objection does not, however, defeat every possible Theorem 5.1 mirror. The configuration formulation is recognizable, rational masses can be denominator-cleared into replicated finite markets, and the programme explicitly allows such high-multiplicity extensions. The fact that the paper’s hardness reduction may not survive is not an objection under ChoCo’s rules.
Theorem 4.1 is more difficult to defeat. Its type-level configuration formulation is faithful: firms still receive integral bundles, capacities remain per firm, and only identical firms and workers are aggregated. The minimum-cost-flow proof can plausibly be lifted by replacing unit capacities with masses and coupling one “main” worker with up to \(c_f-1\) secondary workers for each unit of firm mass. Subadditivity gives the same pointwise bound, and denominator clearing restores an ordinary replicated market. A labour market with repeated employer and worker cohorts is also a credible high-multiplicity regime.
The remaining objections—that the valuation over worker-type counts needs a new representation, and that the configuration space may require difficult separation—are real technical gaps, but they are precisely computational questions worth studying, not reasons the mirror is meaningless.
So the strongest honest negative case defeats the proponent’s averaged-utility mirror of Theorem 5.1. It does not defeat the repaired configuration mirror, and it does not defeat Theorem 4.1. I therefore cannot honestly sustain the universal claim that no worthwhile continuous mirror exists; the negative case is ultimately weak because Theorem 4.1 supplies a credible population-continuous, capacity-sensitive computational problem.
The adversarial triple: the proponent anchors on up to three named results; the opponent sees that case and must defeat every anchor; the judge decides which case convinced it. These are the pipeline’s own outputs, generated by tools/triple_run.py — no human edited them. The paper’s own text is not reproduced here beyond the quoted statement above.