| paper | d4-journals-jet-2018-0098 |
| 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 characterize implementability and establish equivalences; they give no algorithm, complexity bound, hardness result, or computational formulation used to compute. The large-electorate suggestion does not connect a continuous computational question to a qualifying result, so bit (a) fails.
fails bit a — no named computational result to mirror
No result has a continuous computational mirror anchored to it; Propositions 1–6 and Corollaries 1–2 are characterization and implementation results without a computational anchor.
The most plausible population setting is constitutional design for a large electorate. A type could record an agent’s ranking of the alternatives and their rights over state changes; mass would be the share of society with that complete type. The design question would be whether a rights structure makes its equilibrium outcomes match a social choice rule for each distribution of types. That is close to the paper’s subject and could be recognizable to its authors.
But it is not a qualifying computational mirror under the programme’s criteria. The paper has no named result asserting a complexity classification or algorithm for a computational problem. The nearest result, Proposition 1 (proved here), characterizes rights-structure implementability: an SCR is implementable iff it is image monotonic, and this is also equivalent to implementation by an individual-based rights structure. Corollary 1 says that a unanimous SCR is implementable iff it is Maskin monotonic. Propositions 3–6 give further characterizations and equivalences involving Nash, strong Nash, code-of-rights, and deviation-constrained implementation. These are theoretical characterizations, not computational results.
There is also a real modeling gap: the paper’s rights attach to coalitions, while a continuum mirror needs a precise account of which positive-mass groups can exercise a right. Its image-monotonicity condition compares named agents’ preferences across profiles, which does not directly become a condition on distributions of types.
So the population angle is plausible, but I cannot honestly supply a named computational anchor or a per-anchor computational question from this paper. It contains no named computational result at all. The continuous implementation question might be a worthwhile new project, but this paper does not provide the required anchor for a continuous computational mirror.
The decisive objection is that this paper has no computational result to mirror. Proposition 1 characterizes rights-structure implementability by image monotonicity; Corollary 1 specializes that to Maskin monotonicity for unanimous rules. Propositions 2–6 characterize other forms of implementation and equivalence. None gives an algorithm, a complexity bound, a hardness result, or an approximation question. The proponent’s nearest candidate, Proposition 1, is therefore not a computational anchor: it is a statement about which social choice rules satisfy a condition across the full preference domain.
The large-electorate scenario is plausible, but it does not supply the missing computational problem. A direct continuum lift also runs into a modeling choice the paper’s characterization makes salient: its canonical rights structures can rely on individual agents’ rights. In a nonatomic population, a singleton has zero mass. If rights must be exercised by positive-mass coalitions, the model needs a rule for which groups hold rights—perhaps type-level rights or quorum thresholds. Those may be sensible extensions, but they add an institutional design choice absent from the paper. Putting rights into voter types is especially awkward because the rights code is the designer’s object, not an exogenous voter attribute.
One could formulate a computational project around a continuous version: for example, decide whether a compactly represented rule on distributions is implementable under a specified class of type-level rights. But that requires choosing how the rule is encoded, how rights are represented, and which coalitions may act. The paper’s results provide no complexity claim for that problem; its characterization would at most motivate a new one.
So the negative case is strong on the programme’s stated criterion: this paper offers no named computational result whose population mirror can be assessed. It is weaker as a claim that continuous implementation theory could never be worthwhile. A mass-based implementation theory may be interesting in its own right, but on the evidence here it would be a new project, not a continuous computational mirror of this paper.
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.