| paper | d4-conf-ijcai-2016-0485 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 1 and Corollary 1 analyze equilibrium behavior and information revelation; neither asserts that a computational problem is solved, is hard, or can be computed with a guarantee. A large-population version would also remove the individual outcome-pivotality behind the results, while restoring it through coordinated blocs would add a new strategic model.
fails bit a — no named computational result to mirror
No result supplies a computational mirror; the equilibrium, signal-revelation, best-response, and profit-comparison results remain outside computational scope.
I can’t make a qualifying anchor-based case for this paper. Its numbered results are about equilibrium behavior, not the complexity or running time of a computational problem.
The closest is Theorem 1, proved in this paper. It characterizes a perfect Bayesian equilibrium for the two-player trading-voting game under a symmetric well-behaved market scoring rule. A crossover in Bob’s nonparticipation probability separates two regimes: when Bob is likely to trade, Alice sets a threshold price and the strategic players coordinate their votes; when he is less likely to trade, Alice’s price reflects her posterior expected outcome. Corollary 1 shows that, under stochastic relevance, Alice’s private signal can be recovered from her price in the latter regime. These are substantive analytic results, but none establishes a complexity classification or an algorithmic bound. Lemmas 1 and 2 characterize best responses; Corollary 2 compares collusive profits. They do not supply the required computational anchor either.
A continuous-population research lead is imaginable: model a large cohort of outcome-deciders by masses of types such as private signal and market-participation propensity, then study equilibrium prices and votes. But in the paper each of two players controls half the outcome. In an atomless population, an individual’s vote has negligible effect, so preserving the paper’s manipulation incentives would require an additional modeling choice, such as coordinated cohorts. The resulting question would also be an equilibrium-analysis extension, not a computational result anchored in this paper. I would not present it as a ChoCo continuous mirror.
The strongest case against a ChoCo mirror is that this paper gives no computational result to mirror. Theorem 1 characterizes a perfect Bayesian equilibrium in a two-player game; Corollaries 1 and 2 describe signal revelation and profit sharing. None asks for, or establishes, the complexity of a computational problem. The paper’s central object is strategic equilibrium behavior, rather than an algorithmic problem about a social choice rule.
The strongest continuous proposal would give a large population types such as private signal and participation propensity, then ask how market prices and votes behave at equilibrium. But the paper’s manipulation mechanism depends on Alice and Bob each controlling half the outcome. In an atomless population, an individual’s vote has zero effect on the outcome, so the incentive that drives Theorem 1’s threshold and collusion results disappears. Corollary 1’s price revealing Alice’s signal and Corollary 2’s division of collusive profits depend on those same individually consequential actions; they do not carry over as stated.
One could preserve consequential actions by treating each positive-mass type as a coordinated bloc. That is the strongest rescue, but shared type does not imply collective control: in the continuous-population model, members of a type remain individuals, and one person’s deviation has zero mass. Giving the bloc a joint action therefore adds a coalition or commitment assumption. The resulting weighted-player game could be worth studying, but it is a new strategic model, not a continuous-population version of the paper’s two-player result. Likewise, a continuum of strategic traders could motivate a new equilibrium-computation problem, but that would introduce both the computational question and the population game; neither is supplied by this paper.
So the case against is strong for a *mirror of this paper*: the named results are analytic, and the natural atomless limit removes the pivotality that gives them their substance. The universal claim that no scenario could be worthwhile is weaker. A model with a few pivotal actors embedded in a large population, or genuinely coordinated blocs, might be interesting. But those scenarios preserve atomic decision-makers or add coordination, and do not provide a computational mirror of the results presented here.
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.