| paper | d4-journals-jet-2021-0047 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
The named results the proponent raises are axiomatic characterizations, not computational results. A type-mass assignment problem is a plausible computational follow-on, but it is not a continuous analogue of a computational result in this paper, so bit (a) fails.
fails bit a — no named computational result to mirror
No result in the paper is covered as a computational mirror. The proposed follow-on concerns computing a buyers-optimal stable outcome; it does not mirror the paper’s characterizations of the buyers-optimal, sellers-optimal, or fair-division rules.
The strongest positive case is the assignment problem’s *underlying computation*. But there is an important limit: this paper contains no named computational result asserting that a problem is in P, NP-hard, FPT, or another complexity class. Its numbered results are axiomatic characterizations. So it offers no compliant anchor for a complexity mirror.
The closest semantic foothold is Theorem 3.4, proved in this paper: for fixed buyers \(B\) and sellers \(S\), a stable rule selects the buyers-optimal stable payoff vector at every valuation profile if and only if it satisfies buyer-valuation monotonicity (BVM). In full, BVM says that if one buyer weakly lowers their valuations for every object, and receives the same object before and after, their payoff cannot increase. Theorem 3.2 gives the sellers-optimal counterpart using object-valuation antimonotonicity; Theorem 4.5 characterizes the fair-division payoff among stable rules using weak valuation fairness. These are results about which rules satisfy which axioms, not about the computational complexity of finding their outcomes. Theorem 3.7 is also a characterization, attributed to Pérez-Castrillo and Sotomayor (2017).
An exploratory, unanchored mirror would be the Continuous Buyer-Optimal Stable Assignment Problem. An instance has finitely many buyer types \(I\) and seller/object types \(J\), rational masses \(\alpha_i,\beta_j\), and rational valuations \(a_{ij}\), with optional reservation values. A type records everything relevant to the market; the same type’s buyers have identical valuations across object types, and its sellers own interchangeable objects. A solution gives a flow \(x_{ij}\geq 0\), where \(x_{ij}\) is the mass of type-\(i\) buyers matched to type-\(j\) sellers, plus per-unit payoffs \(u_i,v_j\). The flow respects the type masses, and stability requires \(u_i+v_j\geq a_{ij}\), with equality on pairs carrying positive flow and reservation payoffs for any unmatched mass. The requested payoff vector is the coordinatewise greatest stable buyer-payoff vector, as in the paper’s buyers-optimal rule; any compatible flow is acceptable. The expected classification is tractable: this is a rational transportation problem with dual stability constraints, and selecting the buyer-optimal dual payoffs should be expressible through polynomially many LP computations. Establishing that the continuous model retains the required buyer-optimal structure belongs in the proof.
The regime could be a large labour or procurement market: many applicants with the same complete valuation vector for standardized job types, and many interchangeable positions within each employer type. The total number of people can be large while the numbers of distinct buyer and seller types remain moderate. Aggregating assignments into flows is a natural co-modification of the one-person/one-object constraints: each person still receives at most one object, while a type-level flow can be fractional. The authors would likely recognize the model’s utility and stability conditions, though that does not mean they would regard this computational question as a result of their paper.
This mirror covers the computation of a buyers-optimal stable outcome, not the paper’s characterization theorem itself. It raises follow-on questions about computing seller-optimal and fair-division outcomes, whether the finite and continuous type-level rules coincide, and what happens when the number of types is part of the input.
The weakest point is the gap between the paper and the proposed question: the paper studies axioms for rules over finite, named-agent markets, while the mirror asks for an algorithm over a type distribution. Continuous BVM would also need a careful definition when only part of a type’s mass trades with a given seller type. That gap does not make a continuous assignment model implausible, but it means the positive case is for a natural computational follow-on—not a continuous version of a named complexity result in this paper.
The strongest case against a mirror is that the paper has no named computational result to mirror. Theorem 3.4 characterizes the buyers-optimal rule by buyer-valuation monotonicity; Theorem 3.2 characterizes the sellers-optimal rule by object-valuation antimonotonicity; and Theorem 4.5 characterizes the fair-division rule by weak valuation fairness. Theorem 5.6 adds variable population, but still gives an axiomatic characterization, not an algorithmic result. These are all candidates for axiomatic continuization, which ChoCo puts out of scope.
The best redefinition of those axioms does not fix that mismatch. In a continuous market, changing one person’s valuation has zero mass; changing the valuations of an entire type, or a positive portion of it, could produce meaningful mass-level versions of BVM, OVA, and WVF. But those would be new axioms about a continuous allocation rule, not computational questions drawn from the paper’s results.
The proponent’s strongest proposal—compute a buyer-optimal stable assignment from masses of buyer and seller types—is a sensible high-multiplicity assignment problem. A flow over type pairs is a natural co-modification, and the authors could well recognize the market model. But it is a computational follow-on to the paper’s subject, not a continuous mirror of one of its computational results: the paper contains none. The same applies to computing the sellers-optimal or fair-division outcome. I would not reject these questions because their LP might be easy; that would be an objection to the answer, not to asking the question.
So the negative case is strong if the task is to find a mirror of this paper’s computational contribution: there is no such contribution to anchor. It is weak as a universal claim that no worthwhile continuous computational question exists in any scenario. If ChoCo accepts computational follow-ons to papers whose contributions are axiomatic, the proposed type-level assignment problem is a serious counterexample, and I cannot honestly rule it out.
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.