| paper | d4-conf-aaai-2005-0185 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | yes |
other→P discrete result → its continuous mirror
Answer: Polynomial-time solvable in \(m\), \(\tau\), and \(L\) under the explicit valuation-table representation. · discrete side: other · adjudication: proved
full proof & adversarial review →
Theorem 4
statement extracted from the paper’s text layer
Given a finite support \(T\) of complete valuation types with positive rational masses \(\mu_t\), and explicit values \(v_t(B)\) for bundles \(B\subseteq M\), compute the limiting item baseline prices and bundle prices when the society is replicated to high multiplicity with fixed scarce supply. For each item \(\ell\), the price is \(p_\ell=\max_{t\in T}\max_{\substack{B\in\mathcal B_t\ \ell\in B}} v_t(B)/|B|\), taking the inner maximum as \(0\) if no such bundle exists; then \(p(B)=|B|\max_{\ell\in B}p_\ell\).
A society is a finite distribution over complete valuation schedules, with each type’s mass representing many identical bidders. Keep the paper’s minimal bundles and fixed-supply price rule; compute the maximum supported type’s average value for each item and derive bundle prices from those item prices.
The theorem gives no bound on the rounds needed for convergence, so it does not establish a finite-time complexity guarantee.
fatal: False
The mirror covers Theorem 4’s baseline-price convergence and the resulting bundle prices; it leaves the allocation, incentive, equilibrium, and experimental results unmirrored.
The strongest honest positive case is narrow: this paper has no named theorem classifying a problem as polynomial-time solvable, NP-hard, or parameterized-hard. The closest named anchor is Theorem 4, proved in the paper. It says that in the proposed open ascending-price auction, with a sufficiently small price increment and straightforward bidding, each item’s baseline price converges to the baseline price in Definition 6: the second-highest average valuation, over minimal bundles containing that item.
I would mirror that price result for a large auction cohort with a small number of complete valuation types. For example, many advertisers might bid on a small menu of standardized campaign packages, with advertisers grouped by their full valuation schedule over packages. The regime is \(N\gg\tau\): many bidders, but relatively few distinct valuation types. Each type’s mass is its population share; type members have the same values for every bundle.
Call the mirror Continuous AM-MB Price Discovery. An instance is a finite support \(T\) of types, rational masses \(\mu_t>0\) summing to one, and each type’s valuation \(v_t(B)\) for every bundle \(B\subseteq M\). Let \(\mathcal B_t\) be its minimal bundles under the paper’s Definition 1, and set
\[
a_t(\ell)=\max_{\substack{B\in\mathcal B_t\\ \ell\in B}}\frac{v_t(B)}{|B|},
\]
with value \(0\) if there is no such bundle. The task is to compute the limiting baseline price \(p_\ell\) for each item and the resulting bundle prices. A solution is the price vector
\[
p_\ell=\max_{t:\mu_t>0}a_t(\ell),
\qquad
p(B)=|B|\max_{\ell\in B}p_\ell.
\]
Equivalently, \(p_\ell\) is the essential supremum of the supported types’ average values for a minimal bundle containing \(\ell\).
This is an exact high-multiplicity connection to Theorem 4’s price benchmark: in any sufficiently large replication of the society, every positive-mass type has at least two bidders. So even when that type supplies the highest average value for an item, another bidder of the same type supplies the second-highest value. The second-highest price in the replicated auction is therefore the maximum over supported types. This mirror asks for the computation of the continuous population’s price benchmark, not for an allocation of positive mass. With fixed, scarce inventory, a finite number of awarded bundles has vanishing population mass in the limit.
I expect this price-discovery problem to be tractable under an explicit bundle-value representation: scan the minimal bundles and take maxima, with rational comparisons polynomial in their bit length. If values are given as a full table, that table may itself have size \(2^m\); this does not establish a bound polynomial in \(m\) for succinct valuation representations. The paper’s theorem supports the price benchmark and its convergence, but it does not give a named complexity classification.
The paper’s strongest connection to this question is precise: its authors would recognize the item-level average values, minimal bundles, and baseline prices as their own objects. The scope is correspondingly limited to Theorem 4’s price result. It does not extend the paper’s allocation or strategic guarantees.
The weak point is that the continuous price depends only on which types have positive mass, not on their mass values. An arbitrarily small positive mass at a high-value type can set the price. That may look like a support simplification more than a useful population model. It is nevertheless the right limit for fixed scarce inventory when each positive-mass type represents many bidders, and it preserves the exact second-highest-price question in Theorem 4. A natural next question is whether scaling inventory with population yields a meaningful mass allocation and a quantile-based AM-MB price rule; that extension would need new results beyond this paper.
The negative case is strongest on the paper’s lack of a computational result to mirror. Its named theorems concern feasibility, truthfulness, price convergence, and equilibrium. The claim that AM-MB has “very low” computational overhead is qualitative: the paper gives no input encoding, running-time bound, or complexity classification. Theorem 4 is the closest anchor, but it proves convergence of an auction’s prices; it does not analyze the complexity of computing them.
The proposed price-discovery mirror turns that convergence benchmark into a new computational task. With explicit valuation data, it asks for maxima over the supported types’ minimal bundles. With succinct valuations, it needs a separate specification of how a type’s valuation is represented and what operations that representation permits. Either way, the paper itself supplies no computational question that fixes those choices. In the succinct case, the hard part would be optimizing over one type’s bundles; the population distribution contributes only whether that type has positive mass. That is a question about valuation representation, not a computational consequence of continuizing the society.
The more ambitious alternative is to scale supply with population and ask for mass allocations, prices, and strategic guarantees. That could be a sensible new auction model, but it changes the one-copy feasibility and price-setting setup on which AM-MB and Theorem 4 rely. It would need its own mechanism and computational questions; this paper does not anchor them.
This is not airtight: a large cohort of bidders with repeated valuation schedules and fixed scarce supply is plausible, and the resulting support-based price benchmark is mathematically coherent. The negative case is that the paper offers no named complexity result for that benchmark, while richer population-scaled versions require a new model. So the case against is about the absence of a worthwhile *computational mirror of this paper*, not the impossibility of studying continuous auction populations.
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.