| paper | d4-conf-ecai-2020-0203 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The numbered results prove properties of a fixed reward scheme, but assert no complexity bound, hardness, or other computational claim. The proposed role-mass synthesis changes the question into a new mechanism-design search problem, without specifying the mechanism class or the information available to its rules. Neither anchor supports a ChoCo computational mirror.
fails bit a — no named computational result to mirror
No result is covered by a surviving computational mirror; the proposed synthesis targets the incentive and budget guarantees in Theorems 2 and 3, while leaving the starter mechanism and Proposition 4's timing guarantee outside.
The strongest honest case is weak: this paper has no named computational-complexity result to anchor a continuous mirror on. Theorems 1–3 and Propositions 1–4 concern properties of reward mechanisms. For example, Theorem 2, proved in the paper, says that the budget distribution scheme using its distribution algorithm is individually rational, budget balanced, and strongly propagation incentive compatible, assuming each layer has more than one agent. Theorem 3, also proved here, extends those properties to the special algorithm for single-agent layers. Neither theorem establishes that a computational problem is in P, hard, or in another complexity class; the paper gives no running-time analysis. The reward algorithms are constructive, but that alone does not make their correctness the kind of computational anchor your criteria require.
The closest possible continuous question would concern large referral campaigns with many participants in a small number of shared network roles. A type would specify a participant’s role, possible audience-role channels, and all other mechanism-relevant attributes; \(\mu_t\) would be the fraction of the population in role \(t\). Given a finite acyclic graph of roles, rational masses, and a budget per unit of population, ask for a finite-description reward rule that assigns nonnegative per-person rewards from an individual’s propagation action and the population’s action distribution. The rule must spend the budget exactly and make full propagation strictly dominant for every role. A solution would be the rule and a proof of those properties.
That is a concrete population-level mechanism question, and a cohort-based viral campaign is a plausible regime for it. But it mirrors Theorems 2 and 3’s incentive and budget guarantees, not a named complexity result. In this role-based version I would expect construction to be relatively tractable; the harder follow-up would be to preserve the paper’s individual-neighbor choices and reachability structure while scaling the population.
The weak point is substantial: the paper’s participants act on specific outgoing edges in a particular DAG. Grouping them by role and audience classes may discard precisely the network detail its mechanism uses. More fundamentally, the paper studies whether a mechanism satisfies incentive and budget properties, rather than the complexity of computing or optimizing over mechanisms. So I can describe a plausible continuous extension, but I cannot honestly present it as an anchor-backed ChoCo mirror under the stated standard.
The proposed mirror has no computational result to continue. Theorems 2 and 3 establish that a specified reward scheme has incentive and budget properties; they give no complexity bound, hardness result, or computational task. Asking for a finite-description rule over role masses turns this into mechanism synthesis, but the paper defines no search space of rules or objective for choosing among them. If the task is simply to evaluate the paper’s scheme, it is already an explicit calculation. Adding an optimization goal would create a new problem rather than mirror these theorems.
The role-based campaign is plausible, but preserving what the theorems actually assert requires more than role masses. Strong PIC compares an individual’s reward before and after removing any subset of their outgoing edges. The scheme also uses shortest-path layers, counts of other agents’ propagation, ancestors who can fund transfers, and the order in which children are processed. A small role description generally loses those network details. Encoding enough of the graph to recover them can make types nearly as numerous as agents, leaving little population compression.
Exact repeated cohorts could avoid that problem. In that restricted setting, though, the rule’s layer-by-layer transfers reduce to finite-dimensional calculations, and scaling the budget with cohort size preserves the same incentive inequalities. That may be a sensible continuous model, but it does not expose a computational landscape for the paper’s results. A richer typed network or graph-flow model could pose a new question about designing mechanisms under population scaling; its main challenge would come from the newly specified network and mechanism class.
The paper’s time-efficiency result offers no stronger computational anchor: it orders individual propagation events by arrival time and proves a property of the same fixed scheme. Continuizing arrival time alone leaves the population finite, while combining time with role masses again requires a new model.
So I would not prioritize a continuous mirror of this article for ChoCo. The universal claim is the weakest part of that verdict: repeated-cohort referral networks are conceivable, and I cannot rule out a worthwhile future synthesis problem built around them. The stronger, better-supported conclusion is that the proposed cohort question does not mirror a computational result in 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.