d4-journals-mss-2017-0049

· ? (d4-journals-mss-2017-0049)

no mirror
paperd4-journals-mss-2017-0049
authors—
venue?
filed underunclassified
judged bygpt-6-luna / xhigh (triple__luna__xhigh__c6r1)
judge confidencehigh
authors would recognise itno

Why no mirror

Theorem 3.1 proves a range restriction, and Corollary 4.5 characterizes rules satisfying axioms; neither asserts a computational result. A mass-based characterization would pose a new axiomatic question, but this paper has no named computational result to anchor a continuous mirror.

fails bit a — no named computational result to mirror

What the mirror covers

No computational result is covered; Theorem 3.1 and Corollary 4.5 are axiomatic results.

The case FOR (proponent)

This paper has no named computational result: no theorem, lemma, corollary, or proposition asserts that a problem is in P, NP-hard, FPT, or otherwise classifies its computational complexity. Theorem 3.1 proves that rules satisfying the four axioms select only the four corner outcomes; Corollary 4.5 characterizes those rules. Both are axiomatic results, so neither qualifies as an anchor under the requested standard.

There is a plausible population-level setting behind the paper: siting public facilities along two neighboring regions with many residents and relatively few recurring dip locations. A type could be a country and dip location, mass its share of residents, and the decision the pair of facility locations. But turning this into a computational question would require adding a task—such as evaluating a specified rule—that the paper does not study. A nonatomic version also makes individual strategy-proofness vacuous unless the model is changed.

So the paper offers a conceivable setting for a population-continuum model, but no qualifying anchor for a continuous mirror of its computational results. I would not present a prover-ready mirror question as if it followed from this paper’s named results.

The case AGAINST (opponent, writing after the proponent)

The best negative case is that the paper’s mathematical object is a rule on named agents, not a computational problem on a population. Its main results characterize which functions from finite profiles to outcomes satisfy four axioms. They do not ask an algorithmic question with an instance to solve, an output to compute, or a complexity claim to transfer. A distribution over dip types is easy to imagine here, but that alone does not give a continuous mirror of a result in this paper.

The strongest proposed repair is to ask for a mass-based version of the characterization. But the characterization permits rules defined by an arbitrary family of decisive coalitions. Those coalitions can distinguish agents with identical dips, so a histogram of type masses need not determine the rule’s outcome. Restricting attention to anonymous rules could make the distribution sufficient, but that changes the class being characterized and supplies a new restriction rather than a continuous version of Corollary 4.5.

There is a second obstacle to turning the original incentive condition into a population-level one. In a nonatomic society, an individual has zero mass and cannot change the outcome, so individual strategy-proofness becomes vacuous. Replacing it with incentives for a positive mass of agents to move together could produce a meaningful model, but that is a different solution concept. The paper gives no result about it to mirror.

So the proponent is right that one can construct a plausible continuum setting, and that the paper contains no named computational result. The possible mirrors—anonymizing the characterized rules, or replacing individual deviations with mass deviations—would pose new axiomatic questions. They may be interesting, but the paper itself gives little reason to expect a worthwhile computational mirror. The negative case is strongest as a scope judgment; it cannot rule out a useful new project built from the model.

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.