| paper | d4-journals-geb-2014-0010 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
The named theorems establish incompatibility among axioms for allocation rules; none asserts an algorithm, computational hardness, or a computational formulation used to compute. A distribution over preference and endowment types could support a related axiomatic question, but it would not give these results the computational character required for a mirror.
fails bit a — no named computational result to mirror
No theorem yields a computational mirror. Theorems 1 and 2 give the central axiomatic impossibilities; Theorems 3 and 4 establish robustness to alternative parametrizations. Divisible commodities make the outcome space continuous, not the population.
I can’t make a compliant case for a continuous mirror: the paper contains no named computational result. The numbered theorems concern axiomatic existence, not the complexity or algorithms for a computational problem.
Theorem 1, proved in the paper, says that with two agents and a preference domain containing linear preferences, for every \(\delta\in(0,1]\), no allocation rule is individually rational, \(\delta\)-efficient, and strategy-proof. Theorem 2, also proved there, says that under the same conditions, no rule is individually rational, efficient, and \(\delta\)-strategy-proof. Theorems 3 and 4 give robustness versions of those impossibilities under conditions on alternative parametrizations. None asserts a computational result of the kind required for an anchor.
The most plausible population setting would be a large exchange cohort whose types combine preferences and endowments, with mass representing the fraction of agents of each type. But asking whether a type-contingent allocation rule for that society satisfies individual rationality, efficiency, and strategy-proofness would be a new axiomatic question. The paper’s two-agent impossibility theorems do not anchor it. Moreover, its divisible commodities are continuity of the outcome space, while its headline results concern only two agents; neither supplies the required continuous-population computational question.
The strongest case against a ChoCo mirror is that the paper has no computational result to mirror. Theorem 1 and Theorem 2 establish axiomatic impossibilities: no rule in the specified two-agent exchange economy satisfies certain combinations of individual rationality, efficiency, and strategy-proofness. Theorems 3 and 4 show robustness to classes of alternative axiom parametrizations. None states a complexity result or gives an algorithmic problem with an encoded society as input. That is a decisive mismatch with the programme’s scope.
The most plausible improved mirror would describe a large exchange population by a distribution over complete types, where each type includes preferences and endowments. One could then ask whether an allocation mechanism on that population satisfies continuous versions of the paper’s axioms. That is a coherent extension of exchange theory, but its central question is still axiomatic existence. The original theorems quantify over rules on a domain of economies; they do not specify a finite input from which an algorithm must compute an allocation, test a property, or optimize a parameter. Making the population continuous does not supply that missing computational target.
One could instead pose a new algorithmic problem—for example, compute an individually rational efficient allocation from a finite-support distribution of preference and endowment types. But that problem does not preserve the paper’s central contribution about compatibility with strategy-proofness and weakened axioms. Or one could retain those axioms and ask whether a suitable rule exists for a continuum of types; that retains the economic question but remains an axiomatic existence question. Neither is a computational mirror of the paper’s results.
The two-agent setting and the paper’s divisible commodities reinforce this diagnosis, but they are not the main objection: large exchange cohorts and complete types are imaginable, and outcome continuity alone would not rule out a population mirror. The problem is that the paper supplies no named computational result for such a mirror to continue. So the negative case is strong for this programme’s remit, while stopping short of claiming that continuous exchange economies could not support worthwhile research of their own.
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.