| paper | d4-conf-ijcai-2019-0590 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Theorems 1–4 establish incentive compatibility, individual rationality, and dominance properties for the mechanisms, but state no computational result such as a complexity bound or hardness result. The plausible population extension therefore has no qualifying result in this paper to anchor it.
fails bit a — no named computational result to mirror
No result is covered by a continuous mirror; Theorems 1–4 establish mechanism properties, while the paper leaves fast computation of some graph cuts as future work.
The strongest positive case is a plausible setting, but this paper has no qualifying computational anchor. Theorem 1 proves that CDM is individually rational and incentive-compatible; Theorem 2 proves it dominates the Vickrey auction. Theorem 3 proves the corresponding IR and IC properties for WDM, and Theorem 4 proves WDM’s dominance. These results are proved in the paper, but they are mechanism-property theorems, not results about complexity, algorithms, or a computational formulation. Algorithms 1–3 define mechanisms; the paper gives no named running-time or hardness result for computing them. Its request for fast algorithms appears as future work.
A plausible high-multiplicity setting would be a large online marketplace whose buyers fall into a small number of recurring network roles, with many buyers per role and shared valuations, diffusion options, and edge costs. One could represent the population by rational masses over those types, and ask whether a deterministic diffusion auction over the reported masses can preserve truthfulness and individual rationality while matching the paper’s revenue and welfare guarantees. The authors might recognize the social-network auction as the subject of that extension.
But that is an unanchored follow-up, not a continuous problem per qualifying anchor. There is also a serious modeling obstacle: the paper’s arguments depend on individual paths and cut nodes. Aggregating a large cohort into mass can make any one member’s removal irrelevant, changing the very critical-diffusion structure the mechanisms use. Scaling the supply with population might yield a more meaningful continuum market, but would further change the single-item problem.
So I cannot responsibly name a lead mirror or predict whether it is tractable, transfers hardness, or is continuum-specifically hard. The best positive claim is only that a high-multiplicity extension is conceivable; this paper supplies no named computational result to anchor the ChoCo case.
The strongest negative case is that this paper has no qualifying computational result to mirror. Theorems 1–4 establish individual rationality, incentive compatibility, and revenue or efficiency dominance for CDM and WDM. Algorithms 1–3 describe the mechanisms, but the paper gives no complexity result for computing them; its conclusion even leaves fast algorithms for determining the sets \(\alpha_i\) as future work. A continuous theorem preserving those guarantees would be an axiomatic mechanism-design result, outside ChoCo’s computational remit. A new question about computing or optimizing the mechanisms could be worthwhile, but it would be an unanchored follow-up, not a mirror of a result in this paper.
The best high-multiplicity scenario would repeat a network template across many marketplace cohorts, with recurring buyer roles and valuation distributions. But a histogram of roles does not encode the relationships the mechanisms use. A buyer’s type includes her exact neighbor set \(r_i\), and the theorems depend on named paths, critical diffusion nodes, cuts, and what becomes unreachable when a particular buyer is removed. Put those identities into the types and the support can grow with the graph; quotient buyers by structural role and the type distribution loses the links that determine who is pivotal. Preserving those links requires a relational network limit as an additional part of the model.
There is a further obstacle in the direct atomless limit: the mechanisms’ incentives can turn on one intermediary changing access to downstream buyers, while a single item is allocated to one individual. Mass aggregation can erase that pivotality or leave the allocation as a zero-mass event. A replicated-network or scaled-supply model might repair this, but it would be a new computational model, not an extension anchored in the paper’s stated results.
So I would screen this paper out as a source for a ChoCo mirror. The universal claim that *no* continuous scenario could be worthwhile is too strong to establish: a carefully designed network limit might be interesting. The negative case is strongest—and decisive for this screening task—because any such project would have to supply both the computational question and its anchor from elsewhere.
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.