| paper | d4-conf-wine-2022-0037 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | yes |
other→other discrete result → its continuous mirror
Answer: Yes. For every pair of distributions specified in the question, \(\mathsf{FB}_\mu\le 3.15\,\mathsf{RandOff}_\mu\). · discrete side: other · adjudication: proved
full proof & adversarial review →
Theorem 1.1
statement extracted from the paper’s text layer
Given finite rational type distributions \(\mu_B\) over buyer values \(v\) and \(\mu_S\) over seller costs \(c\), with unit mass on each side and independent matching so pair \((v,c)\) has mass \(\mu_B(v)\mu_S(c)\), apply the paper’s random-offerer mechanism to each pair using the marginal distributions. Is aggregate first-best \(\mathsf{FB}_\mu=\sum_{v,c}\mu_B(v)\mu_S(c)(v-c)_+\) always at most \(3.15\) times aggregate random-offerer gains from trade?
Two unit-mass populations with finite value and cost supports, described by \(\mu_B\) and \(\mu_S\); independently matched pairs have mass \(\mu_B(v)\mu_S(c)\). A trade-fraction vector \(x(v,c)\) yields aggregate gains \(\sum_{v,c}\mu_B(v)\mu_S(c)(v-c)x(v,c)\), with first-best allocation \(x(v,c)=\mathbf{1}\{v\geq c\}\). Run the stated random-offerer mechanism independently on each pair, with prices optimized against the population marginals.
Covers the aggregate random-offerer bound of Theorem 1.1 and the MHR seller-pricing bound and sharpness of Theorems 1.2 and 3.2; it does not address pooled markets with shared supply or coupled trades.
The strongest honest positive case is a population reinterpretation of the paper’s approximation bounds, but it does not meet ChoCo’s computational-anchor requirement.
A plausible regime is a large market of buyers and sellers with repeated valuation and cost types: buyers have values \(v\in V\) with mass distribution \(\mu_B\), sellers have costs \(c\in C\) with mass distribution \(\mu_S\), and \(N\gg |V|+|C|\). Under independent random matching, mass \(\mu_B(v)\mu_S(c)\) consists of \(v,c\) pairs. A trade-fraction decision \(x(v,c)\) yields aggregate gains from trade \(\sum_{v,c}\mu_B(v)\mu_S(c)(v-c)x(v,c)\). This makes the population masses genuine model inputs, rather than treating \(F\) and \(G\) only as uncertainty about two named agents.
The closest named anchors are Theorem 1.1, proved here as Theorem 2.1: for every pair of value and cost distributions \(F,G\), first-best gains from trade satisfy \(\mathsf{FB}\le 3.15\,\mathsf{RandOff}\). And Theorem 1.2, proved here as Theorem 3.1 and shown sharp by Theorem 3.2: if the buyer-value distribution \(F\) is MHR, then \(\mathsf{FB}\le(e-1)\mathsf{SellerP}\), with \(e-1\) the optimal constant.
Their natural population versions ask whether those same bounds hold for the aggregate first-best gains from trade and aggregate random-offerer or seller-pricing gains in the matched mass population. The paper’s inequalities carry over by reading the type distributions as population masses and aggregating across pairs. That is a coherent, recognizable scenario; the seller-pricing question also retains the MHR restriction on buyer types.
The central weakness is decisive under the programme’s rules: these theorems establish mechanism-quality guarantees, not running-time bounds, complexity classifications, or algorithms for a computational problem. In the paper, \(F\) and \(G\) describe the uncertain values of one buyer and one seller; they are not a population model. In the proposed market, the pairs are independent bilateral trades, so the aggregate theorem is essentially the original expectation written as a population integral. It does not create the computational question ChoCo is meant to chart.
So the population analogue is a plausible extension, but there is no named computational result here to anchor a ChoCo mirror. The paper’s named theorems give approximation ratios, and the eligible continuous questions above merely restate those guarantees under a mass interpretation.
The decisive problem is that neither proposed anchor is a computational result. Theorem 1.1 (also Theorem 2.1) proves an approximation guarantee for a mechanism; Theorems 1.2 and 3.1 prove a guarantee under an MHR restriction, and Theorem 3.2 shows that bound is sharp. None states a complexity classification or analyzes an algorithm for a computational problem. The paper’s questions are about the worst-case quality of mechanisms over distributions, not the cost of finding an intervention in a society.
The proposed mass-market reading does not change that. For independent bilateral trades, assigning mass \(\mu_B(v)\mu_S(c)\) to each buyer–seller type pair turns the paper’s expectations into aggregate integrals. The same bounds then follow by summing or integrating the original guarantees. That is a valid interpretation of the formulas, but it adds no computational question: the population version is the same mechanism comparison scaled across independent trades.
A pooled market with shared supply could raise computational questions, but it would need matching, rationing, and incentive constraints across trades. The paper’s theorems do not address that model, so those questions would be a new research direction rather than mirrors of its results.
The negative case is strongest on scope, not on impossibility: one can imagine worthwhile computational work on larger bilateral markets, but this paper supplies no named computational result for ChoCo to continuize. Its distributions describe uncertainty about two agents’ private values and costs; even when those distributions are continuous, the society in the model remains one buyer and one seller.
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.