| paper | d4-conf-atal-2008-0040 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The named theorems establish strategy-proofness and its structural characterization, but assert no computation, running-time bound, hardness, or solver formulation. The proposed mass version is vacuous for nonatomic individual deviations; making blocs strategic changes the agency model, while coalition control would be a new problem rather than a mirror.
fails bit a — no named computational result to mirror
No result is covered by a qualifying continuous mirror. The proposed distribution over argument-capability types attempts to lift Theorem 32, Theorem 33, and Corollary 34, but does not yield a computational result from this paper.
There is no qualifying computational-complexity anchor in this paper. Its named results concern incentives, not whether an algorithmic problem is NP-hard, polynomial-time solvable, FPT, or similar.
The closest result is Theorem 32, proved here: when agents value the number of their own arguments that are accepted, and each agent’s argument set contains no indirect defeats among its arguments, truthful revelation is a dominant strategy in the sceptical direct mechanism. Theorem 33 and Corollary 34, also proved here, give the corresponding necessity and “if and only if” characterization. These are substantive mechanism-design results, but they do not classify computational complexity. So there is no honest way to supply the requested per-anchor complexity mirror or place it in the programme’s A/B/C trichotomy.
A nearby continuous candidate would take types to be argument-capability sets \(t\subseteq A\), with population fractions \(\mu_t\). Let \(x_{t,S}\) be the mass of type \(t\) reporting \(S\subseteq t\), with \(\sum_{S\subseteq t}x_{t,S}=\mu_t\); the outcome is the grounded extension of the union of positively reported sets, and type \(t\)’s utility is \(|E\cap t|\). One could ask whether truthful reporting of all mass of each type is dominant against every reporting allocation by other types. But this treats each type bloc as a strategic actor. With nonatomic individual agents, individual deviations cannot change the outcome, making truthfulness vacuous; with strategic blocs, the model changes the paper’s unit of agency. That is a plausible research question, not an anchored computational result from this paper.
I agree with the proponent’s first point, and it is the strongest case against a mirror: Theorem 32, Theorem 33, and Corollary 34 characterize when truthful revelation is strategy-proof. They do not classify the complexity of a computational problem. A continuous question about those results would therefore need to be turned into a new algorithmic problem before it could fit ChoCo’s central aim.
The proposed distribution over argument-capability sets is the natural first attempt. But with nonatomic individuals, one person’s report has zero mass, so it cannot change the union of reported arguments or the grounded extension. Truthful reporting is then weakly dominant for everyone, regardless of the paper’s topological condition. Treat types as coordinated blocs and incentives become meaningful, but the outcome still depends on which reports have positive mass, not their exact shares. Testing the paper’s condition then depends on the support’s argument sets, while fractional changes in reporting mass usually do nothing until a report disappears altogether.
A stronger rescue would ask for the minimum mass of participants who must coordinate to hide arguments and change the grounded extension. That is a coherent computational question, and population proportions could determine its cost. But it adds a coalition or intervention model, a target outcome, and a cost objective that the paper does not study. It is a possible follow-up, rather than a continuous version of the paper’s truthfulness characterization.
So the negative case is strong on fit to the programme, but not airtight as a universal claim: a well-designed mass-coalition control problem might still be worthwhile. The paper itself, however, supplies no computational-complexity anchor for it, and its direct continuous truthfulness mirror either becomes vacuous for individuals or collapses to support-level combinatorics for blocs.
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.