| paper | d4-conf-aaai-2024-0322 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The paper contains no numbered result asserting an algorithm, complexity bound, or other computational claim. Its computational statements about EF1 and EFX are background claims or open problems, so none can anchor a continuous mirror of this paper.
fails bit a — no named computational result to mirror
No result in the paper is eligible for a continuous-population mirror; the cited fair-division algorithms and the paper’s empirical and agenda-setting discussion are left without an anchor.
I can’t make an anchor-backed positive case from this paper under the stated rules. It is an agenda article, and it contains no numbered theorem, lemma, corollary, or proposition asserting a computational result. Section 2.0.1 says that EF1 allocations always exist and can be computed in polynomial time, citing earlier work; it also describes EFX existence and computation as open. Those are relevant claims, but they are not numbered results of this paper. Its discussion of experiments on perceived fairness is not a computational-complexity result either.
There is a plausible setting for future work: large allocation programmes where many people share complete valuation types and resources scale with the population. But turning that into a complexity question about allocating mass across integral bundles would create a new research problem, rather than mirror a named result in this paper. A continuous model of the distribution of fairness judgments would be closer to the paper’s agenda, but it would be empirical or axiomatic rather than the computational question this programme targets.
So the honest count is zero eligible anchors, and there is no per-anchor problem to hand to a prover. That is a limitation of the paper for this exercise, not evidence that fair allocation has no sensible continuous-population questions.
The proponent raises zero anchors, so there is no per-result mirror to defeat. That is the strongest case against a continuous mirror *of this paper*: it reports no numbered computational result whose high-multiplicity version could be studied. The nearest candidates do not fill the gap. EF1’s existence and polynomial-time computability are cited background claims; EFX is presented as an open problem. Neither is a computational result established by this paper. The perception experiments are empirical findings, not complexity results.
A better attempt would be to make one of those allocation questions the mirror—for example, ask about EF1 or EFX when many agents share complete valuation types and supplies scale with the population. That could be a sensible research question. But it would be a mirror of the cited fair-division literature, not of a result in this agenda paper. Likewise, putting a distribution of fairness judgments into a model would engage with the paper’s central theme, but the paper supplies no computational problem or result for that model to mirror.
The paper’s contribution is an agenda about how people judge fairness, including the effects of information, agency, context, and procedure. Those are not themselves computational claims. Encoding people as complete types may be appropriate in some large allocation settings, but it does not create a computational result in this paper or turn its empirical questions into one.
So the negative case is strong for “no worthwhile continuous mirror of this paper’s results”: there are no such results to anchor one to. It does not establish the broader claim that no continuous-population question in fair division is worthwhile. The proponent is right to leave that possibility open.
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.