| paper | d4-journals-geb-2020-0003 |
| 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 theorems establish lottery implementation and equilibrium existence, but none asserts that an object can be computed or that computing it is hard. With no named computational result to anchor a mirror, the paper fails bit (a).
fails bit a — no named computational result to mirror
No result is covered by a continuous mirror; Theorems 2.4, 2.6, and 3.1 state lottery-implementation and equilibrium-existence results without computational claims.
I can’t make a valid positive case under the programme’s anchor requirement: this paper has no named computational result asserting tractability, hardness, or a related complexity classification. Theorem 2.4 proves existence of a finite mechanism that approximately implements a lottery securely; Theorem 2.6 proves existence of an exact weakly secure mechanism; and Theorem 3.1 proves existence of an undiscounted \(\varepsilon\)-equilibrium under stated action conditions. None analyzes computational complexity.
The apparent continuous ingredients do not supply a population mirror. The lotteries and sunspot are distributions over outcomes or signals, and the two coin devices are not a society of many agents. Recasting the devices as a continuum population would also change the security problem: the paper’s guarantee concerns one device being controlled, while an individual has zero mass in an atomless population.
So there are no eligible anchors here, and I can’t state a continuous problem per anchor without inventing a different question. The closest-looking candidate, Theorem 3.1, is an equilibrium-existence result—not a computational result about a continuous society.
The proponent raised no continuous anchors, so there is none to defeat directly. The strongest reason to reject a mirror is that the paper has no named computational result to mirror. Theorem 2.4 and Theorem 2.6 establish lottery-implementation guarantees; Theorem 3.1 establishes equilibrium existence. None asks about computational complexity. Under ChoCo’s scope, that is decisive: a complexity problem someone could formulate from the paper’s ideas would be a new question, not a continuous mirror of one of its results.
The best candidate for the lottery theorems would make mechanism construction algorithmic: given coin distributions and a target lottery, find a secure mechanism, perhaps minimizing its length. But the coins’ probability distributions are distributions over messages, not populations. Their security guarantee depends on a sequential history and on whether a particular device is faulty. Recasting messages as population types loses that structure. A stronger attempt—many devices grouped by type—still runs into the same issue: in an atomless population, one faulty device has zero mass and its deviation disappears; giving an adversary positive mass changes the threat model. That could motivate a separate distributed-randomness problem, but it would not mirror these theorems.
The best candidate for Theorem 3.1 would scale quitting games to a continuum of player types, perhaps and ask for an algorithm to find an equilibrium. But the theorem concerns finitely many strategic players, each of whom can affect the action profile and potentially end the game. In an atomless model, one player’s deviation generally has no effect on aggregate behavior, so individual incentives can become vacuous. Treating a whole type group as the deviating player preserves influence only by making that group a strategic actor—in effect, returning to a finite-player game. Other ways to preserve pivotal quitting would define a different game.
So the paper’s lottery distributions and sunspot signal do not supply a continuous population, and the natural population reinterpretations either erase the paper’s strategic structure or change the problem. I cannot establish that no worthwhile research question could grow out of these ideas. The narrower, stronger conclusion is that the plausible descendants are new mechanism-synthesis or population-game projects, not computational mirrors of this paper’s results.
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.