| paper | d4-conf-ecai-2014-0203 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
The paper’s numbered results establish axiomatic properties of its allocation rules; none gives an algorithm, complexity claim, hardness result, or computational formulation used to compute. The replicated-goods model is plausible, but studying its computation would extend the paper rather than mirror a named computational result, so bit (a) fails.
fails bit a — no named computational result to mirror
No computational result is covered. The monotonicity, duplication, object-addition, cloning, and compatibility results remain axiomatic results outside the proposed computational mirror.
The paper has no named computational result that qualifies as an anchor under your criteria. Its numbered results concern allocation properties: for example, Theorem 6 proves monotonicity, Theorem 8 and Corollary 9 show failures of global monotonicity under stated conditions, and Theorem 14 proves duplication monotonicity in selected cases. None gives a complexity bound, hardness result, algorithm, or computational formulation the paper uses to compute allocations. The allocation rules are defined by optimization, but the paper studies their axiomatic properties.
There is a plausible continuous *model* behind those rules. Let a type be a complete ranking of a finite catalog of good kinds, and let \(\mu_t\) be the population share of type \(t\). Use \(x_{t,S}\) for the mass of type \(t\) receiving the integral bundle \(S\). Require \(\sum_S x_{t,S}=\mu_t\), and set each good kind’s supply per capita to \(q_g\), so \(\sum_{t,S:g\in S}x_{t,S}=q_g\). A large institution distributing standardized copies of resource kinds to many people with relatively few distinct rankings is a plausible regime: each person still receives an integral bundle, while a type’s mass can be split across bundles.
That model would require co-modifying the paper’s setting: it has a finite set of unique goods, so with fixed supply almost all agents would receive nothing as the population grows. Replicated good kinds with per-capita supply make the continuous allocation meaningful, and the scoring objective remains recognizable.
But this is only a candidate continuization of the paper’s *definitions*. It cannot be attached to a named computational result in the paper. So there is no honest per-anchor continuous problem or expected complexity class to give here; either would be a new research question, not a mirror of a computational claim the authors made.
The strongest case against a *mirror of this paper’s results* is that it contains no named computational result to mirror. Its theorems and propositions concern axiomatic properties of allocation rules; the paper gives no algorithm, complexity bound, or hardness result. The optimization-defined rules do suggest a computation problem, but studying that problem would add a computational contribution the paper itself does not make.
The proposed continuous model is plausible: many people with repeated ranking types share a supply of standardized goods whose quantity scales with population, while each person still receives an integral bundle. That co-modification is allowed by the programme, and I would not dismiss it as incoherent or treat existing high-multiplicity work as an objection. But it changes the paper’s finite set of unique goods into per-capita supplies of good kinds. It is a reasonable new allocation model, not a direct continuation of one of the paper’s named results.
Its most immediate computational question is also unpromising: under utilitarian aggregation, each good can be assigned independently to an agent who ranks it highest. In the continuous version, the analogous mass assignment is a linear program whose pricing separates over goods. Egalitarian or leximin objectives could pose richer questions, but they would need their own computational formulation and analysis; the paper neither supplies nor studies one.
The paper’s distinctive results do not offer another computational anchor. The monotonicity, object-addition, duplication, and cloning claims track particular agents or changes to a finite set of goods. In a population continuum, a single agent or single added good has zero mass unless the model is modified to give that change positive mass or supply. Such variants may be worth studying, but they would be new axiomatic questions, outside ChoCo’s computational scope.
So the case against is strong for *this paper as a source of ChoCo mirrors*: no computational result is stated, and the most direct continuous computation is simple. It is weak as a universal claim. The replicated-goods model is sensible, and a carefully chosen egalitarian variant might yield worthwhile complexity questions. I cannot honestly rule out every useful mirror; I can only say that any such project would extend the paper rather than mirror its results.
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.