| paper | d4-conf-wine-2008-0014 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The paper’s named results compare and characterize Groves mechanisms but do not assert an algorithm, hardness, or a computational formulation used to compute. The suggested public-project population would also require a new incentive model because an individual has zero mass in a nonatomic society.
fails bit a — no named computational result to mirror
No result is covered by a continuous computational mirror; the mechanism comparisons and characterizations remain outside the mirror.
I can’t make a valid case under your anchor rule: the paper contains no named computational result. Its numbered theorems are about mechanism comparisons and characterizations. The closest anchors are Theorem 1, which says no feasible Groves mechanism welfare-dominates an OEL mechanism; Theorem 2 and Corollary 1, which characterize the feasible anonymous linear Groves mechanisms that are undominated (equivalently, welfare-undominated) as exactly the OEL mechanisms; and Theorem 3, which says no feasible Groves mechanism welfare-dominates VCG in the equal-participation-cost public-project problem. Theorem 4 rules out a pay-only Groves mechanism dominating VCG in the general public-project problem, while Theorem 5 says that for every \(n\ge3\), some such instance has a BC mechanism that dominates VCG. None asserts tractability, hardness, or a computed formulation of an underlying problem. [The paper](https://users.cs.duke.edu/~conitzer/welfare_undominatedWINE08.pdf)
The strongest *thematic* lead would be a public-project population with many members grouped by valuation and participation cost. A candidate mirror would take a finite-support distribution \(\mu\) over valuation types, scale project cost per capita so the efficient decision remains meaningful, and ask whether a feasible continuum Groves transfer rule can match or improve on continuum VCG’s aggregate transfers for every \(\mu\), strictly improving for some. But this is a new mechanism-design question, not a computational mirror of Theorem 3: the paper does not define continuum Groves mechanisms or settle how individual incentives and pivotal transfers behave when each person has zero mass. Theorem 3 therefore cannot serve as the required computational anchor, and there is no sound Class A/B/C prediction to attach to this proposed extension.
The strongest case against a ChoCo mirror is that none of the proposed anchors is a computational result. Theorem 1 and Theorem 2 with its corollary characterize welfare-undominated Groves mechanisms and the OEL family; Theorem 3 establishes VCG’s welfare-undominance for equal-cost public projects. Theorem 4 and Theorem 5 concern pay-only dominance and an example where BC dominates VCG. These are claims about mechanisms and their properties, not algorithmic problems: the paper specifies no computational input, output, or complexity question for a continuous population to answer.
The OEL auction results have a plausible high-multiplicity setting: many bidders may share valuation types. But replacing bids by a distribution does not turn their results into computational questions. The characterization concerns mechanisms over all finite-\(n\) bid vectors. Taking a distributional or quantile limit could motivate a continuous characterization; asking for an algorithm would require a new task, such as synthesizing a rebate rule from a specified encoding or optimizing expected redistribution under a prior. The latter also changes the paper’s pointwise welfare-dominance criterion into an ex ante one.
A public-project population is plausible too, including with cost shares included in the type and project cost scaled per capita. The deeper obstacle is that the paper’s Groves payments and dominance arguments depend on unilateral deviations: hold everyone else’s reports fixed and change one person’s report. In a nonatomic population, that person has zero mass, so the limit does not retain the same pivotal effect. Keeping finite-agent deviations, scaling pivotal payments, or letting a whole type mass deviate would each define a different incentive model. The equal-cost, general-cost, and BC-dominance results therefore do not themselves supply a computational mirror.
This is not an argument that high-multiplicity mechanism design is senseless, or that no worthwhile computational question could be invented in these domains. It is that such a question would be a new project rather than a continuization of a computational result in this paper. As a ChoCo mirror target, the paper has no computational anchor.
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.