| paper | d4-conf-atal-2010-0114 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 8 concerns an agent’s incentives, not computing an object or the complexity of computation. The cohort-purchase proposal adds a coordinated desk, changing the strategic unit and failing to supply a computational mirror of a named result in the paper.
fails bit a — no named computational result to mirror
Independent atomless traders have no individual price impact; pooling them into a shared desk restores that impact by making the desk a coalition, rather than a population of independently strategic agents.
fatal: True
Theorem 8 motivates the proposal but is not mirrored by it; Theorems 1–7, Theorem 9, and the alternative market designs in Section 3.4 are also untouched.
This paper contains no named computational-complexity result of the kind your anchor rule requires. Its theorems concern incentives and market design, not whether a problem is in P, hard, FPT, or similar. The closest substantive hook is Theorem 8, proved in this paper: for every pricing rule, an agent can manipulate the max decision rule by raising the price of a suboptimal action above the price of the best action. That is a strategic impossibility result, not a complexity classification, so I cannot honestly present it as a qualifying anchor.
If a non-complexity result can motivate a new computational mirror, the most plausible one is a population version of that manipulation problem. Consider a large organization’s decision market, with many employees grouped into a small number \(\tau\) of cohorts who share beliefs and per-person trading limits; the cohorts trade through a common desk. Let \(\mu_t\) be cohort \(t\)’s fraction of the population, \(\pi_{t,j}\) its belief that action \(j\) achieves the desired outcome, and \(b_t\) its per-person purchase limit. Let \(\theta_j\) be the actual success probability of action \(j\). For a target action \(j\), suppose its market has an increasing, rational piecewise-linear price curve \(P_j(Q)\), current quantity \(Q_j^0\), and cost function \(C_j(Q)=\int_0^Q P_j(u)\,du\). Other action markets have fixed current prices \(r_i\).
The Continuous Decision-Market Manipulation question is: given binary-rational masses \(\mu_t\), beliefs, limits, price curves, and current prices, find a suboptimal action \(j\) and cohort-level purchases \(x_t\in[0,\mu_t b_t]\) such that, writing \(X=\sum_t x_t\),
\[ \theta_j<\max_i\theta_i,\qquad P_j(Q_j^0+X)>\max_{i\ne j}r_i, \]
and the cohort desk’s expected net gain is positive:
\[ \sum_t \pi_{t,j}x_t- \bigl(C_j(Q_j^0+X)-C_j(Q_j^0)\bigr)>0. \]
A solution is such a purchase vector and action, or a certificate that none exists. This makes the population the continuous object: the mass of each trader type determines how much that cohort can buy. For this restricted one-market version with piecewise-linear price curves, I would expect tractability through convex optimization: once \(j\) is fixed, winning imposes a minimum purchase quantity, while expected gains depend on the aggregate purchase and the type capacities. Extending the question to coordinated trades across several conditional markets could change that classification.
The scenario is plausible only with an institutional detail: cohorts need a shared trading desk or delegated portfolio. A mass of independent, atomless traders would each have negligible price impact, so the individual manipulation in Theorem 8 could disappear in the limit. That is the main weakness. It also means this is an unanchored research question inspired by Theorem 8, not a continuous restatement of a named complexity result. A useful follow-up would be to compare this cohort model with the non-atomic equilibrium where traders act independently and to identify the population-size threshold at which profitable manipulation becomes possible.
The strongest case against begins with a direct mismatch: the paper proves no named computational-complexity result. Its theorems characterize incentive compatibility and manipulation. Theorem 8—the best anchor—is an existence claim about a single last-moving trader: every pricing rule permits a profitable manipulation. That is a meaningful impossibility result, but it does not itself pose an algorithmic problem for a continuous society. Replicating the trader across types does not change the theorem’s incentive argument.
The proposed cohort question adds an algorithmic task, but its trading desk is a coordinated decision-maker. For a fixed target action, the price threshold imposes a lower bound on total purchases \(X=\sum_t x_t\). Given \(X\), the desk maximizes its expected gain by allocating purchases to the highest-belief cohorts first. Thus the population supplies aggregate purchasing capacity to one coalition; it does not reproduce the paper’s population of independently strategic agents. This distinction is about who chooses and benefits from the trades, not about whether budgets or costs may be type-level. The formulation might be useful for studying coordinated corporate trading, but that is a new coalition-control model, not a high-multiplicity version of Theorem 8.
A closer population model would give each trader type a mass \(\mu_t\), with shared beliefs and per-person trading limits, while traders act independently. With bounded per-person capacity, an individual in an atomless population has no price impact, so the manipulation mechanism in Theorem 8 disappears. If instead each type can move the market using its entire mass, the type acts as a coordinated bloc; that restores price impact by changing the strategic unit. A nonatomic market equilibrium could be a worthwhile question, but it requires a new game and equilibrium concept. It is not a continuous restatement of the paper’s last-mover result. The other theorems do not supply a computational anchor either: they concern single-agent truthfulness, scoring rules, pricing guarantees, or no-trade, rather than algorithmic complexity.
That knocks out the proposed anchor as a direct ChoCo mirror, but I cannot honestly make the universal negative airtight. The paper’s discussion of an infinite stream of traders gives a plausible starting point for a computational study of nonatomic decision-market equilibria. Such a study could be recognized by the authors as their problem, even though it changes the strategic model and moves toward equilibrium computation. So the case against is strongest as a claim about the paper’s existing results: none supplies the programme’s kind of computational question. The claim that no worthwhile continuous mirror exists in any scenario is much weaker.
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.