| paper | d4-conf-wine-2016-0031 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Theorem 5.2 proves existence without a construction or complexity claim, and Theorem 5.3 gives a structural characterization rather than a computational result. A type-mass market is plausible, but the paper does not anchor a computational question for it.
fails bit a — no named computational result to mirror
The proposed type-mass model resembles Theorem 5.2's fractional equilibrium and Theorem 5.3's characterization, but neither result establishes computational complexity or an algorithm.
I don’t see a qualifying computational anchor in this paper, so I can’t make a positive case that meets your stated standard.
The closest results are Theorem 5.2, proved here, which says a fractional Walrasian equilibrium exists under the stated monotonicity and continuity assumptions, and Theorem 5.3, also proved here, which characterizes an integral equilibrium using an equilibrium price vector and an integral optimum of the induced configuration LP. Neither gives a complexity classification or an algorithm. Theorem 5.3 uses an LP as a structural characterization, but the paper does not compute with it in the sense required for a formulation anchor.
There is a plausible population-continuous model nearby: buyer types could be complete utility functions over bundles, their masses could be population shares, and item supplies could scale per capita. A solution would give prices and, for each type, a distribution over integral bundles such that each bundle is demanded, aggregate demand respects supply, and positively priced goods clear. That resembles Theorem 5.2’s fractional equilibrium. But it is an existence question about equilibria, not a computational question anchored in a named computational result of this paper. Presenting it as the requested mirror would overstate the fit.
The decisive problem is that this paper gives no named computational result to mirror. Theorem 5.2 proves existence of a fractional Walrasian equilibrium; Theorem 5.3 characterizes an integral equilibrium through a price vector and an optimum of an induced configuration LP. Neither classifies complexity or gives an algorithm. The LP is structural machinery in the characterization, not a computational result.
The proposed type model is plausible: many buyers could share a complete utility type, with goods supplied per capita. But its type-level distributions over bundles are exactly the aggregate object in Theorem 5.2. In a continuum, those distributions can be realized by assigning different bundles to different members of a type. That gives a natural continuous restatement of the paper’s fractional-equilibrium existence result, not a new computational claim. Theorem 5.3 does not supply one either: its LP condition says when an equilibrium exists, but the paper does not analyze how to find the relevant prices or solve the condition efficiently.
One could make a computational project by asking how to compute equilibria for a finite list of utility types. The paper allows arbitrary continuous utility functions, though, and supplies no finite encoding or access model for them. Choosing, for example, rational piecewise-linear utilities would define a new problem whose complexity might be worth studying; it would not mirror a computational result here. I grant that a high-multiplicity market is sensible. The case against this paper as a ChoCo anchor is strong; the broader claim that no nearby project could be worthwhile goes beyond what the paper establishes.
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.