| paper | d4-conf-ecai-2014-0216 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 3 and the paper’s other named results establish incentive properties of mechanisms, but none gives an algorithm, complexity bound, hardness result, or computational formulation. The proposed population version of Theorem 3 also loses individual false-name deviations in an atomless society unless reframed as positive-mass coalition manipulation, which changes the question.
fails bit a — no named computational result to mirror
No continuous mirror covers a named computational result; the paper’s results concern conditions for false-name-proofness and strategy-proofness, plus an example where decomposition violates allocation feasibility.
I cannot make a rubric-compliant positive case: this paper has numbered mechanism-design results, but no named computational complexity result. Theorem 1, cited from Yokoo, characterizes strategy-proof mechanisms via PORF; Theorem 2, also cited, characterizes false-name-proof PORF mechanisms using WAP and NSA. The paper’s own Theorem 3 says that PIA is sufficient for the decomposition to preserve false-name-proofness. Theorem 4 and Proposition 1 give necessary conditions, Theorem 5 and Corollary 1 give sufficient conditions for strategy-proofness, and Proposition 3 shows that the ARP decomposition can violate allocation feasibility. None asserts that a computational problem is in P, NP-hard, or otherwise classifies its complexity.
The closest possible subject for a continuous extension is Theorem 3: take a bidder’s complete valuation function as their type, population mass as the share of buyers with that type, and ask whether PIA still guarantees false-name-proofness when the single-minded decomposition is applied to the population. But that would be a new mechanism-design theorem, not a mirror of a computational result in this paper. It would also need a careful model of individual false-name deviations and how finite goods scale with population mass. I would not present it as the requested prover-ready question.
So there are no eligible anchors, and no honest per-anchor continuous problems to state. That limits the case for a mirror of this paper; it does not speak against the continuization programme more broadly.
There is a plausible high-multiplicity regime for combinatorial auctions: many buyers can share the same valuation type. I would not argue against a mirror on the grounds that auction participants are always individuated. The stronger problem is that this paper has no computational result to mirror. Its results characterize incentive properties of mechanisms: PIA suffices for false-name-proofness, other conditions are necessary or sufficient for strategy-proofness, and ARP can fail after decomposition. None classifies the complexity of a computational problem.
The closest candidate is Theorem 3. One could ask whether a decomposition mechanism remains false-name-proof when bidder types are represented by a distribution. But that changes the central object of the theorem. False-name-proofness compares one person’s utility under truthful participation with their utility after creating finitely many identities. In an atomless population, one person has zero mass, so adding those identities leaves the distribution unchanged. If instead a positive-mass group splits its reports, the question becomes coalition manipulation, not the theorem’s individual incentive property. A hybrid model with a continuum of background buyers and a marked strategic bidder could preserve the deviation, but it would be a new model and a new question.
One could also turn PIA into a computational question by specifying how price rules are represented and asking how hard it is to verify the condition or find a rule satisfying it. The paper supplies no such representation or problem: its price rules are general functions, and the condition ranges over bidder profiles. Choosing a finite encoding would create a new computational project, rather than continuize a result here.
So the proponent is right that there are no eligible computational anchors. The negative case is strong against a continuous mirror of this paper’s results. The universal claim remains harder to defend: a separately formulated algorithmic study of high-multiplicity auctions could be worthwhile. But that possibility does not give this paper a continuous computational question without adding one.
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.