| paper | d4-journals-jet-2014-0075 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
Theorem 1 is an existence result, and the paper says its proof is nonconstructive; Section 4.4 discusses approximation algorithms as a possible next step. Typed Rental Harmony is a concrete, plausible computational extension, but it cannot supply the required computational result of this paper.
fails bit a — no named computational result to mirror
The proposed question concerns only the rental-harmony problem behind Theorem 1; it leaves the cake and chore division and exchange-economy applications aside.
There is no named computational result in this paper to anchor a continuization claim. Theorem 1 is proved here, but it establishes existence, not a complexity bound. Proposition 1 and Proposition 2 are also existence results; Theorem 2 is a cited KKMS result, and Theorem 3 is a cited matching result. Section 4.4 says one could construct approximations, but presents no numbered computational result. So, under your anchor rule, the paper has no eligible anchors.
The strongest positive case is a new computational question about the problem behind Theorem 1. The theorem says that for finitely many agents and rooms with positive integer capacities summing to the number of agents, if each agent’s nonempty set of favorite rooms depends on the full price vector, has a closed graph, and includes every free room, then there is a normalized price vector and a capacity-respecting assignment giving every agent a favorite room. It is proved in this paper.
A natural population scenario is a large housing allocation with many applicants but relatively few behavioral types: applicants of the same type have the same favorite-room correspondence at every possible vector of room prices. A type is therefore a complete description of the price-responsive behavior the problem uses. If type \(t\) has mass \(\mu_t\), and room \(r\) has per-capita supply \(q_r\), the population can be represented with \(\tau\) masses even when the number of applicants is enormous. The supplies scale with the population, and the mass of a type may be divided among rooms while each individual receives one room.
I would call the resulting question Typed Rental Harmony. An instance consists of a finite room set \(R\); rational type masses \(\mu_t>0\) summing to \(1\); rational room supplies \(q_r>0\) summing to \(1\); and, for every type \(t\) and room \(r\), an explicit rational polyhedral set \(P_{t,r}\) of normalized price vectors at which type \(t\) likes room \(r\). The input is promised to satisfy the paper’s nonempty-choice and free-room conditions. The question is to find a price vector \(p\in\Delta(R)\) and nonnegative flows \(x_{t,r}\) such that
\[
\sum_{r\in R}x_{t,r}=\mu_t,\qquad
\sum_t x_{t,r}=q_r,\qquad
x_{t,r}>0\ \Longrightarrow\ p\in P_{t,r}.
\]
There is no optimization objective: a solution is a market-clearing price vector and a mass assignment that gives each type only rooms it likes at those prices. The polyhedral input makes the computational question finite and precise while retaining the paper’s dependence on the *entire* price vector.
This seems recognizable to the authors as a population analogue of their rental-harmony problem: it keeps price-responsive choice and market clearing, and replaces counts by masses. Its strongest case is that fractional flows are exactly what a nonatomic population permits. For a fixed number of rooms, I expect the explicit polyhedral version to be tractable: partition price space into cells where the liked-room graph is fixed, then test each graph by a flow computation. With the number of rooms variable, the cell search may become the difficult part; I would leave the overall complexity open rather than claim a class without evidence. The question also leads to exact versus approximate prices, parameterized complexity in \(m\) and \(\tau\), and the discrete-to-continuous relationship when the masses come from normalized voter or applicant counts.
The mirror covers only the rental-harmony existence problem behind Theorem 1. The paper’s cake/chore and exchange-economy applications could motivate separate mirrors, but they are not needed for this case. The weakest point is substantial: the paper studies continuity in prices, not in the population, and its arbitrary closed-graph preference correspondences have no finite computational representation. Typed Rental Harmony is a plausible new question only after choosing a representation such as the polyhedral one above; it is not a computational result of this paper.
The anchor fails the programme’s stated entry test. Theorem 1 proves existence; Propositions 1 and 2 also prove existence; and Theorems 2 and 3 supply mathematical tools. None asserts the complexity of a computational problem. Section 4.4 even flags approximation algorithms as a possible next step. “Find a continuous algorithm for the problem behind Theorem 1” is therefore a new computational question, not a mirror of a computational result in this paper.
Typed Rental Harmony is a coherent way to pose that new question, but its computational content depends on an extra input choice. The paper allows arbitrary closed-graph preference correspondences, with no finite representation. Encoding each one as rational polyhedral regions makes the problem finite, but the search then turns on the geometry of those regions: at any fixed price, checking whether type masses can fill room supplies is just a flow problem. The population masses enter as flow totals; the hard part, if there is one, is finding a price vector with a suitable liked-room graph. Different encodings of the correspondences could give substantially different computational problems. That weakens the claim that this is a complexity question naturally supplied by the paper’s model.
The proposed housing scenario itself is credible. A large applicant pool with repeated behavioral types is a sensible high-multiplicity regime, and fractional type-to-room flows are a natural population model. I would not argue that multiplicity or mass is meaningless here. Nor can I dismiss the computational extension as unrecognizable to the authors: their discussion of approximation algorithms in Section 4.4 gives it some support. Those points make a categorical claim that *no* worthwhile mirror exists hard to defend.
So the strongest negative case is narrower: this paper supplies no eligible computational-result anchor, and the proposed polyhedral search problem requires a representation choice that the paper does not make. That is enough to reject this case as establishing a continuous mirror of a computational result in the paper. It is not enough to show that the resulting research question is unworthy, or that no scenario could make it worthwhile; on that universal claim, the honest negative case is weak.
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.