d4-conf-sigecom-2008-0010

· ? (d4-conf-sigecom-2008-0010)

mirror foundnew result: NP-hard → NP-hard — proved & adversarially reviewed →
paperd4-conf-sigecom-2008-0010
authors—
venue?
filed underunclassified
judged bygpt-6-luna / xhigh (triple__luna__xhigh__c6r1)
judge confidencemedium
authors would recognise ityes

The new result

NP-hard→NP-hard discrete result → its continuous mirror

Answer: \(\#\mathrm{P}\)-hard, hence \(\mathrm{NP}\)-hard, under polynomial-time Turing reductions for each specified output representation. · discrete side: hardness · adjudication: proved

full proof & adversarial review →

The anchor — hardness

Theorem 1

Every anchor argued

The continuous mirror question

Given \(n\) candidates, a finite support of trader portfolio types with rational masses \(\mu_t\) summing to one, and per-capita holdings \(h_t(i,j)\) for each candidate-position security, set \(Q_{ij}=\sum_t\mu_t h_t(i,j)\). For a designated security \(\langle i\mid j\rangle\), compute its exact LMSR quote and normalizer \(Z=\sum_{\sigma\in S_n}\exp\!\left(\frac{1}{b}\sum_i Q_{i,\sigma(i)}\right)\), hence the cost \(b\log Z\).

The model it lives in

A unit-mass population of trader types, each with a complete per-capita portfolio over permitted securities; aggregate those portfolios into the LMSR state \(Q\), then compute the exact quote, normalizer, or cost for the specified subset-betting market.

The objection that survived

The paper takes total outstanding shares \(Q\) directly, while the proposed society uses a unit-mass weighted portfolio; the case does not spell out the per-capita scaling that identifies these with the same LMSR state.

fatal: False

What the mirror covers

The selected mirror covers Theorem 1’s subset-betting price and cost hardness and its transaction-payment corollary. Theorem 3 and Theorem 5 admit parallel trader-mass mirrors; the selected anchor does not cover the PermELearn approximation and loss-bound results in Sections 7.3–7.4.

Open questions for a prover

The case FOR (proponent)

A credible, narrow mirror is to make the traders the continuous population. In a large prediction market, many small traders can follow a modest number \(\tau\) of standardized strategies: the market might have millions of participants but only dozens of distinct order profiles. A type is a complete per-capita portfolio over the securities the market permits, including the relevant belief and trading parameters. Its mass \(\mu_t\) is its fraction of the population. The LMSR market state is then the mass aggregate \(Q_e=\sum_{t=1}^{\tau}\mu_t h_t(e)\), where \(h_t(e)\) is type \(t\)’s position in security \(e\).

For outcome \(\omega\), let \(w_\omega=\exp\!\left(\frac{1}{b}\sum_{e:\,\omega\models e}Q_e\right)\), and let \(Z=\sum_{\omega\in\Omega}w_\omega\). The mirror asks for the exact LMSR quote \(p_S=\sum_{\omega\in S}w_\omega/Z\) for a permitted security \(S\), and the exact cost \(C=b\log Z\). Use exact log-weight inputs, as in the paper’s reductions, and return exact prices and normalizers. A transaction-payment version takes two such societies and returns \(b\log Z(Q')-b\log Z(Q)\).

The lead is Mass-Subset LMSR Pricing. Its instance gives \(n\) candidates, a finite rational-mass society of trader portfolio types, and a designated security \(\langle i\mid j\rangle\), paying when candidate \(i\) finishes in position \(j\). Outcomes are rankings \(\sigma\in S_n\), with \(w_\sigma=\exp\!\left(\frac{1}{b}\sum_i Q_{i,\sigma(i)}\right)\). The question is to compute that security’s quote and the market normalizer \(Z\), hence the cost. Theorem 1 says that exact instantaneous prices and the cost function are each \(\#P\)-hard for LMSR subset betting. The authors prove this here by reducing from the permanent of a \(0\)-\(1\) matrix; the permanent’s hardness is prior work. ([Chen et al., Theorem 1](https://ai.stanford.edu/~nlambert/papers/Chen_et_al_%28EC_2008%29.pdf))

Mass-Pair LMSR Pricing uses the same society input, but types submit positions on pair securities \(\langle i>j\rangle\). Its outcomes are again rankings, with \(w_\sigma=\exp\!\left(\frac{1}{b}\sum_{i,j:\,\sigma(i)<\sigma(j)}Q_{i,j}\right)\). Given a pair query, compute its exact quote and \(Z\). Theorem 3 proves here that exact prices and cost are \(\#P\)-hard, by a reduction from counting the linear extensions of a partial order. The counting problem’s hardness is cited from prior work. ([Chen et al., Theorem 3](https://ai.stanford.edu/~nlambert/papers/Chen_et_al_%28EC_2008%29.pdf))

Mass-2-Clause Boolean LMSR Pricing gives types portfolios over securities for disjunctions of two literals, such as \(X_i\lor X_j\), where literals may be events or their negations. Its outcomes are assignments \(x\in\{0,1\}^N\), with \(w_x=\exp\!\left(\frac{1}{b}\sum_{e:\,x\models e}Q_e\right)\). Given a permitted clause query, compute its exact quote and \(Z\). Theorem 5 proves here that exact prices and cost are \(\#P\)-hard, by reducing from counting satisfying assignments to a \(2\)-CNF formula. ([Chen et al., Theorem 5](https://ai.stanford.edu/~nlambert/papers/Chen_et_al_%28EC_2008%29.pdf))

All three mirrors have the same honest classification: Class B, hardness transfers. Any paper instance with aggregate position vector \(Q\) embeds as a society with one type of mass one and portfolio \(Q\). Thus the hardness persists even at support size \(\tau=1\); it comes from the combinatorics of rankings or Boolean outcomes, not from the number of distinct trader types. The quoted theorems are proved in this paper, while the source counting problems’ hardness is cited. Each mirror also raises a useful next question: which structure in the aggregate position matrix, pair interactions, or clause–event incidence allows exact or approximate pricing despite the general hardness? The paper’s transaction-payment corollaries can be mirrored by the two-society cost-difference query above.

The authors should recognize these as their problems: the outcome spaces, allowed securities, market states, and LMSR pricing rule stay intact; the mass distribution specifies where the aggregate holdings come from. The weakest point is that the paper already represents the market by aggregate outstanding shares \(Q\), so the type distribution adds a population interpretation rather than changing the pricing computation. That makes this a narrow high-multiplicity lift, not a claim that continuization resolves the hardness or that the population itself creates it.

The case AGAINST (opponent, writing after the proponent)

The three anchors are genuine computational results: the subset betting theorem, the pair betting theorem, and the two-literal Boolean theorem all prove \(\#P\)-hardness. The difficulty for a continuous mirror is that none takes a trader population as input. Each takes the aggregate outstanding shares \(Q\) as the market state and computes a function of \(Q\).

For a proposed society of trader types, let \(h_t(e)\) be type \(t\)’s per-capita holdings in security \(e\), so \(Q_e=\sum_t\mu_t h_t(e)\). In every case, the quote has the form \(Z_S(Q)/Z(Q)\), and the cost is \(b\log Z(Q)\). For subset betting, for example,
\[ Z(Q)=\sum_{\sigma\in S_n}\exp\!\left(\frac{1}{b}\sum_i Q_{i,\sigma(i)}\right). \]
Pair betting and Boolean betting change the outcomes and securities in this sum, but not its dependence on the input: it is still only \(Q\). A transaction payment depends only on the two aggregate states \(Q\) and \(Q'\).

That defeats each anchor on the same ground. The permanent reduction in the subset theorem specifies entries of \(Q\); the linear-extension reduction in the pair theorem specifies pair-security entries; and the \(\#2\mathrm{SAT}\) reduction specifies clause-security entries. Each constructed state can be represented by one type of mass \(1\) whose portfolio is \(Q\). Conversely, a listed type distribution can be aggregated into \(Q\) directly. The paper has already discarded trader identity before the pricing computation begins. Unlike a high-multiplicity election, there is no list of discrete agents or integral population count here for masses to relax: LMSR share quantities are already divisible.

A large market with millions of traders using a small library of order templates is a plausible setting. But its type masses merely provide another way to construct the same aggregate \(Q\); aggregating them is straightforward, and the quoted theorems still concern pricing from that aggregate. Adding beliefs, budgets, or strategic responses could make population composition consequential, but then the question becomes how traders choose orders or how the market evolves. Those are new problems without anchors in this paper’s results. A continuous stream of small trades likewise makes time or the trading process central, while the approximation section’s guarantee depends on the aggregate trade sequence, not trader multiplicity.

So I would reject all three as continuous-population mirrors: they are exact restatements of the pricing problem under a redundant population encoding, not a high-multiplicity relaxation. The universal claim remains the weak point. One could build a worthwhile population game around LMSR, but it would not mirror a computational result in this paper.

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.