| paper | d4-journals-mss-2010-0051 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
No named theorem asserts an algorithm, complexity bound, hardness result, or computational formulation used to compute. The existence and nonexistence theorems therefore provide no computational result to mirror; a population model of preference types and mass allocations would be new work.
fails bit a — no named computational result to mirror
No named computational result is covered. Theorems 2–8 establish existence or nonexistence of envy-free divisions, while Theorems 1 and 5 provide mathematical tools.
This paper contains no named computational result of the kind your anchor rule requires, so I can’t make a qualifying anchor-based case for a continuous mirror.
Theorem 3 gives a counterexample to guaranteed existence for two cakes cut into two pieces; Theorem 7 does so for three or more cakes cut into three pieces. Theorems 2, 6, and 8 give existence guarantees in other settings. These are mathematical existence claims, not complexity classifications or algorithmic results: the paper specifies no computational input model, algorithm, or running time. Its limiting argument uses arbitrarily fine triangulations and compactness, and its preferences need only satisfy general conditions such as closedness.
The population mirror is also a poor fit: the paper has two players, while its continuity lies in divisible cake pieces and the space of divisions. Turning the players into a large population with preference types would change the problem, and the paper’s theorems would not anchor that new question. A computational problem about finding the divisions guaranteed by Theorems 6 or 8 could be proposed as new work, but it would not be a continuous mirror of a named computational result in this paper.
The strongest case against a mirror is that the paper states no computational result to mirror. Theorem 1 and Theorem 5 are mathematical tools; Theorems 2–8 establish existence or nonexistence. None specifies a computational problem with an input model, algorithm, or complexity bound. The introduction’s question “is there a method to find it?” hints at a possible follow-up, but does not define one: the proofs use general closed preference sets and arbitrarily fine triangulations, without specifying how preferences are represented or how a division is output. Formalizing an algorithmic task around those proofs could be worthwhile, but it would be new computational work, not a continuous mirror of a result in this paper.
The population axis is also absent. The paper’s continuous object is the division polytope: cut sizes vary continuously, while the society consists of exactly two players with linked preferences over combinations of pieces. A high-multiplicity version could describe a continuum of people by types encoding their complete linked preferences, scale the cakes per capita, and ask for an envy-free allocation of mass among bundles. That is the strongest plausible extension. But it adds type distributions, mass assignments, and resource constraints that the paper’s theorems do not address. It may be a sensible fair-division problem; it does not give a computational mirror of Theorems 3, 6, 7, or 8.
So the negative case is strong against treating this paper as an anchor for ChoCo: its results are topological existence claims about two players, and its continuity is in outcomes rather than population. The broader claim that no scenario could yield worthwhile work is weaker. A carefully specified population model of linked-preference types might be valuable, but its value would come from the new model and questions, not from a computational result established here.
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.