| paper | d4-conf-ijcai-2021-0743 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 3.5 is a genuine computational result, but its cooperative-equilibrium condition depends on an individual contribution changing whether the project succeeds. In an atomless population, an individual has zero mass and cannot be pivotal; retaining the finite-unit pivotality test does not make the proposed fractional allocation a Nash equilibrium among those residents. No stated continuous question preserves the result's strategic problem.
fails bit b-changes — the continuum limit changes the question
An atomless resident's action does not change aggregate contributions, so a successful project gives that resident the same public reward whether they contribute or free ride; the proponent acknowledges this but defends a different fractional feasibility benchmark.
fatal: True
The proposal covers only Theorem 3.5's cooperative-equilibrium existence decision; Theorems 3.6 and 3.10 and the intervention results are outside its scope.
My lead is the Unit-Pivotal Fluid Cooperative-Equilibrium Problem, a continuous high-multiplicity mirror of the paper’s cooperative-equilibrium existence problem.
The anchor is Theorem 3.5, proved in this paper. It says that deciding whether a pivotal participation game \((\vec e,\vec m,\tau)\) has a cooperative Nash equilibrium is NP-complete. In the paper’s characterization, this means deciding whether there is a participating set \(S\) such that, for every \(i\in S\),
\[
\max\left\{\tau,\frac{e_i}{m_i}\right\}\le e(S)<\tau+e_i.
\]
The paper proves membership in NP and proves NP-hardness by a reduction from Partition. The hardness is in selecting a subset of agents whose contributions put the total in the required range while making every participant willing to contribute.
Here is the continuous problem. An instance gives a population mass \(H\), a finite support \(T\) of types with rational proportions \(\mu_t\) summing to \(1\), endowment \(e_t\), and reward level \(m_t\in(0,1)\) for each type, and a project threshold \(B\). Type means the complete game-relevant description \((e_t,m_t)\). For each type choose a participating mass \(x_t\in[0,H\mu_t]\), and let
\[
E(x)=\sum_{t\in T}e_t x_t.
\]
A solution is a vector \(x\) such that \(E(x)\ge B\) and, for every type with \(x_t>0\),
\[
\max\left\{B,\frac{e_t}{m_t}\right\}\le E(x)<B+e_t.
\]
The question is whether such an \(x\) exists; if so, return one. Each resident still takes a binary action. The real-valued \(x_t\) records how much of a large type cohort participates.
This is plausible for a large municipal project with many households in a small number of contribution and benefit brackets. For example, millions of households may share one of a few endowment and reward profiles, while the project’s funding threshold grows with the population. The authors should recognize the question: it asks whether a successful cooperative equilibrium exists under their same participation incentives, replacing selection of individual residents with allocation of participating mass across types. The mirror covers Theorem 3.5’s existence decision, not the paper’s intervention-cost results.
I expect this fluid problem to be tractable. For a proposed total \(E\), type \(t\) can participate only when \(E\in[l_t,u_t)\), where \(l_t=\max\{B,e_t/m_t\}\) and \(u_t=B+e_t\). Between the sorted endpoints \(l_t,u_t\), the total contribution capacity of eligible types, \(C(E)=\sum_{t:\,E\in[l_t,u_t)} H\mu_t e_t\), is constant. Sweep those intervals and check whether some \(E\ge B\) in an interval also satisfies \(E\le C(E)\). Since participating mass is continuous, any such total can be assembled from eligible types’ capacities. This gives a polynomial-time decision and construction algorithm in the support size and input bit length. The expected gain is precisely that Partition’s indivisible subset choice becomes continuous allocation across cohorts.
The weak point is the pivotality convention. A strict atomless Nash game usually gives an individual zero influence on aggregate contributions, whereas this mirror retains the paper’s one-agent incentive test, represented by the \(e_t\) width in the upper bound. So this is a fluid high-multiplicity relaxation of their finite-agent equilibrium problem, not the usual nonatomic equilibrium concept. If the authors require the latter, the mirror would change the strategic question. I think the relaxation is still worth asking because it preserves their binary household decision and the core computational question—whether a successful cooperative outcome can be supported—while making population mass continuous.
Theorem 3.5 is the strongest anchor, and the intervention results inherit the same issue. The equilibrium condition requires each participant to be pivotal: for every \(i\in S\), total contributions must satisfy \(e(S)<\tau+e_i\). That finite-agent comparison is central to the result.
In a genuine atomless population, an individual’s action changes aggregate contributions by zero. If the project succeeds, a participant and a free rider receive the same public reward, while the free rider keeps \(e_i\). So every participant with \(e_i>0\) strictly prefers to free ride. For a positive threshold, there is no successful pure Nash equilibrium with positive contributions. Normalizing contributions per capita does not remove the problem: an individual’s effect vanishes, while the success rule retains its jump at the threshold. The finite game’s exact-threshold pivotality therefore has no ordinary atomless limit.
The proposed \(x_t\) problem preserves that finite-agent pivotality condition for a hypothetical “unit” of each type, even though no individual unit exists in the continuum. Its capacity sweep may correctly solve a fractional feasibility problem, but that problem does not establish a Nash equilibrium among the residents. Making each type cohort choose as a bloc would restore pivotality by changing the strategic unit from individuals to coordinated groups. Keeping unit-sized atoms preserves the finite game, rather than continuizing it. Threshold uncertainty might produce another model, but its incentives would depend on new assumptions about uncertainty and scaling.
The same obstruction reaches the paper’s intervention results. External investment and matching funds change aggregate contributions; they do not make an atomless resident pivotal. Under the paper’s matching-fund assumption \(m_i(1+\rho)<1\), a resident still prefers to free ride whenever success is unaffected by their action. External funding can make the project succeed without donors, but the paper excludes \(S=\emptyset\) from valid intervention sets. If empty participation were allowed, that case would reduce to funding the threshold, rather than inducing cooperation.
There is some evidence against a high-multiplicity interpretation of the hardness result itself: the Partition reduction assigns distinct endowments, and hence distinct game-relevant types, to its agents. A large population with a few repeated types could still motivate a fluid benchmark, but it would be a new regime rather than the regime driving Theorem 3.5.
I would make this a strong negative case, not a proof that no useful model can be built. The proponent’s unit-pivotal fluid relaxation is a clean benchmark and could be worthwhile if the authors want to study fractional allocations satisfying inherited finite-unit incentive inequalities. The case against is that calling it a continuous Nash-equilibrium mirror requires retaining a unit’s strategic effect after that unit has become measure zero.
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.