| paper | d4-journals-geb-2023-0127 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
The household-type model is a coherent population extension, and the proposed fair-share search problem is statable. But Theorem 2.1 is an existence result without a construction or complexity claim, so the paper has no named computational result to mirror.
fails bit a — no named computational result to mirror
The proposed mirror covers Theorem 2.1's fair-share and Pareto requirements; it leaves the envy, egalitarian-equivalence, market-equilibrium, and majority-fairness results aside. The finite piecewise-linear utility encoding is an addition.
The strongest honest lead is a population version of the paper’s unambiguous fair-share result. But there is a hard limit: this paper contains no named computational result of the kind your anchor rule requires. Theorem 2.1, proved here, says that every economy has a Pareto-optimal allocation satisfying the unambiguous fair-share guarantee. Proposition 3.2 says that some three-agent economies have no unambiguously envy-free Pareto optimum. Both are welfare existence results, not claims about algorithms or complexity. So neither is a qualifying anchor, and the paper supplies no discrete hardness result whose fate under continuization we could study.
The natural regime would be a large public provisioning system serving many similar family households. A type would be a household’s complete list of selves and their utility functions; mass would be the fraction of households with that profile. The number of households could be large while the number \(\tau\) of distinct profiles stays modest. This fits the paper’s family interpretation and continuizes the population, while its goods are already divisible.
If I had to give a prover a concrete prospective question, it would be Continuous Multi-Self Fair-Share Search. The input is a finite set of types \(t\), rational masses \(\mu_t\) summing to \(1\), a per-capita supply vector \(E\), and, for each type’s selves \(s\), a rational concave piecewise-linear utility \(u_{t,s}\). Find bundles \(x_t\in\mathbb{R}_+^G\) such that
\[
\sum_t \mu_t x_t\le E,\qquad
u_{t,s}(x_t)\ge u_{t,s}(E)\quad\text{for every }t,s,
\]
and the resulting type-constant allocation is Pareto-optimal, with efficiency understood up to changes on measure-zero sets. The solution is the list of bundles \(x_t\). This directly mirrors Theorem 2.1’s fairness and efficiency requirements, though it is a newly stated search problem, not a problem the paper analyzes computationally.
For this restricted encoding, the expected direction is tractability: maximizing \(\sum_t\mu_t\sum_s u_{t,s}(x_t)\) subject to feasibility and the fair-share constraints is a linear program, and an optimum is Pareto-optimal. That gives a plausible computational extension of the theorem, but not evidence that continuization dissolves hardness; the paper identifies no computational hardness to dissolve. The restriction to piecewise-linear utilities also gives the problem a finite input representation that the paper itself does not provide.
The weak point is therefore decisive for this programme: although the population mirror is plausible, its strongest anchor is not computational. It covers only the fair-share existence result, and it does not qualify as a case for a continuous mirror of a named complexity result.
The strongest case against starts with the paper’s results: none is a computational result. Theorem 2.1 establishes existence of an unambiguous fair-share Pareto optimum; Theorem 3.1 and Theorem 3.3 give further existence results; Propositions 3.2 and 4.1 give nonexistence examples. The paper defines no computational problem, input encoding, algorithm, or complexity bound. Its utilities are arbitrary continuous functions, so a complexity question would first need a new finite representation of preferences.
The proposed household scenario is still a sensible high-multiplicity regime. A type can include a household’s complete set of selves and utility functions, and per-capita supply gives a coherent continuous allocation model. But under the proponent’s piecewise-linear utility encoding, their fair-share search problem reduces directly to an LP: impose resource and fair-share constraints, then maximize the positive mass-weighted sum of all selves’ utilities. An optimum is Pareto-optimal. This gives a straightforward tractability result for the newly specified problem, not a continuous mirror of a computational result in the paper. The encoding and LP formulation are additions the authors did not study.
A stronger candidate would ask for envy-free or egalitarian-equivalent Pareto allocations across types. Those questions have plausible population interpretations, and cross-type envy constraints could make their algorithms genuinely interesting. They would still be newly formulated computational problems. Their difficulty would depend on the chosen utility representation and fairness definition, and the paper provides no discrete complexity result to connect them to. The paper’s existence and impossibility theorems do not supply that missing computational anchor.
So the negative case is strong under ChoCo’s stated mirror task: there is no named computational result here to continuize. It is weaker against the literal claim that no scenario could ever make a related continuous computational project worthwhile. Repeated households make the population model sensible, and an algorithmic study of it might be valuable as new work. The material supports “not a mirror of this paper’s computational results,” not the universal claim that no worthwhile continuous question could arise.
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.