| paper | d4-conf-ecai-2016-0341 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | no |
Theorem 3 gives an explicit construction of funded equilibria for the paper’s finite-agent game. In an atomless population, an agent can reduce a positive contribution while leaving funding unchanged, so the theorem’s pivotality-based equilibrium does not carry over. The resulting nonatomic equilibrium question changes the strategic problem rather than mirroring the anchored result.
fails bit b-changes — the continuum limit changes the question
An atomless contributor can reduce a positive contribution without changing whether the project is funded; the proponent identifies this issue but gives no way to preserve the theorem’s strategic setting.
fatal: True
The proposed mirror concerns Theorem 3’s funded equilibrium claim; it leaves the cited PPR equilibrium result, prediction-market cost-function conditions, and LMSR/QSR comparisons aside.
I can’t make a qualifying anchored case from this paper. Theorem 1 (cited from Zubrickas [27]) characterizes the pure-strategy Nash equilibria of PPR; Theorem 2 (cited from Abernethy et al. [2]) gives a convexity condition for complex prediction markets; and Theorem 3 (proved here) establishes funded subgame-perfect equilibria for PPS under stated conditions. None classifies the complexity of a computational problem or gives an algorithm with a running-time result. Calling Theorem 3 “in P” would add a result the authors did not prove.
There is a plausible *exploratory* mirror of Theorem 3, though it does not meet your anchor requirement. Call it Continuous-PPS Funded-Equilibrium. An instance would specify a provision point \(h_0\), a cost function \(C_0\), and a population described by masses of agents with each valuation \(\theta\), arriving over time. Mass is population fraction; \(h_0\) and contributions are measured per capita. A strategy assigns each arriving agent a contribution based on their valuation and the observed history. The question is whether one can produce a sequentially rational strategy profile whose aggregate contributions reach \(h_0\); a solution is that strategy profile and its resulting contribution and security paths.
A credible regime is a large civic-crowdfunding platform where many residents fall into a small number of valuation classes and arrive through a few channels. The population distribution is natural there, and the authors could recognize the question as a continuum limit of their sequential PPS game. But there is a serious obstacle: in an atomless population, one person’s contribution has no effect on whether the project gets funded. If the project is funded, any agent contributing a positive amount can reduce it infinitesimally, keep the outcome funded, and improve their payoff. That undermines the positive-contribution equilibrium at the heart of Theorem 3. Treating an entire valuation class as a single strategic contributor might preserve pivotality, but would make the class a coordinated bloc rather than a high-multiplicity population of individually acting agents.
So the honest positive case is that PPS has a recognizable population-continuum question, and the limit may expose exactly why its finite-agent equilibrium works. The weakest point is decisive for the requested assignment: that question is only a conjectural mirror of a game-theoretic result, not a continuous computational mirror anchored in a named complexity result of this paper.
There is no computational result in this paper to continuize. Theorem 1, imported from Zubrickas, characterizes equilibria of PPR; Theorem 2 gives a condition on prediction market cost functions; and Theorem 3 proves the existence of funded subgame-perfect equilibria for PPS. None poses a decision or optimization problem, gives an algorithm, or classifies complexity. The fact that the cost function is continuous in market state is continuity of the market, not of the population.
The best population scenario is a large civic platform with many residents in a small number of valuation and arrival-time classes. Let \(\mu\) describe those classes, and scale the provision point and contributions per capita. That makes a plausible society distribution, but it loses the strategic feature Theorem 3 relies on. In an atomless population, one person’s deviation does not change total contributions. If the project is funded and that person contributes \(x>0\), they can reduce \(x\) while leaving funding unchanged; their utility rises from paying less, since PPS securities pay nothing when the project is funded. So the paper’s funded equilibrium does not carry over as an equilibrium of this natural continuum model.
Keeping pivotality by making each positive-mass class act as one decision-maker would make the class a coordinated bloc, not a high-multiplicity group of independent contributors. Keeping individual pivotality requires finite agents or positive-mass atoms. An approximate or mean-field equilibrium could be studied, but that changes the equilibrium concept and turns the project into analytic game theory. It is not a computational question anchored in this paper.
The other named results do not provide an alternate anchor: Theorem 1 concerns a discrete-agent contribution game, while Theorem 2 has no population in its statement. One could invent a computational project about choosing a cost function or optimizing incentives over a valuation distribution, but that would add an objective and input model the paper does not supply. That may be worthwhile research; it would be a new algorithmic-design problem rather than a continuous mirror of a result here. The negative case is therefore strongest on scope: a plausible continuous society exists, but the paper’s results are equilibrium claims, and its main strategic result depends on a form of individual pivotality that the natural atomless limit removes.
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.