| paper | d4-conf-atal-2017-0285 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | no |
Neither raised anchor supplies a computational market result with a stated continuous analogue. The paper does give a constructive matching argument in Theorem 3.6, but neither case anchors a continuous question to it; a type-mass version would also need to define blocking and pairwise stability for nonatomic populations. The proposed mass-flow idea therefore does not yield a question the authors would recognize as preserving the paper’s stability problem.
fails bit b-changes — the continuum limit changes the question
No continuous question is anchored to Theorem 3.5 or Theorem 4.5. Theorem 3.6 constructs a stable matching using maximum-weight matching and an LP, but the cases do not propose its mass-based analogue; the welfare-gap and other stability results are also left without a continuous question.
I don’t find a qualifying computational-complexity anchor in this paper. Its numbered results concern stability and welfare: for example, Theorem 3.5, proved here, says every market has a nonempty 2-core; Theorem 4.5, also proved here, says every parameterization on a fixed bipartite graph has a nonempty core if and only if every connected component is a tree or an even cycle. Neither states a complexity result for a named computational problem. Theorem 4.5 yields an easy graph-recognition test, but presenting that derived test as an in-paper “in P” result would overstate the anchor.
A water-right market with many holders sharing a small number of profiles is a plausible high-multiplicity regime. One could describe holders by type, mass by population share, and decisions by trade flows. But making the paper’s bilateral transaction thresholds into thresholds between type groups risks changing the market the authors studied. Without an eligible named result, I can’t honestly state the required anchor-backed continuous problem.
The proponent’s central point holds: this paper supplies no named computational result for a continuous mirror to carry forward. Theorem 3.5 proves that every market has a nonempty 2-core; Theorem 4.5 characterizes when every market on a fixed graph has a nonempty core. The welfare-gap bounds and pairwise-stability results are also structural or game-theoretic guarantees. The paper defines an optimization problem and reports experiments, but gives no complexity classification or algorithmic theorem for computing these outcomes.
The best computational gloss on Theorem 4.5 would be: given a graph, decide whether every market on it has a nonempty core. Its characterization reduces that query to checking whether each component is a tree or an even cycle. That is a straightforward graph-recognition task, not a complexity result about the market problem. A type-level version would keep the same simple graph test when there are finitely many types; a richer version would need new assumptions and new results.
There is a plausible high-multiplicity setting: many sellers and buyers sharing capacities, trading values, and compatibility patterns. But preserving the paper’s transaction thresholds is difficult. Each threshold applies to a particular seller–buyer transaction. At the type level, aggregate flow between two types could combine many sub-threshold trades; imposing one threshold on that aggregate instead models a bulk contract. Keeping thresholds per individual pair in an atomless population requires a model of the trade relationships and their costs. Either choice could motivate new research, but neither gives a direct computational mirror of this paper’s results. In the paper’s water-market data, agents are villages embedded in a particular connectivity network, with instances of 8–50 agents; treating them as repeated interchangeable types would require a different market scenario.
A repeated market with uniform type-pair terms could still be sensible. The negative case is therefore weak as a universal claim that no worthwhile continuous model could exist. Its firmer conclusion is narrower: none of the paper’s named results anchors the computational-complexity programme, and the most promising type-based formulation would pose a new problem rather than continuize a computational result established here.
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.