| paper | d4-conf-ijcai-2016-0156 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 2 is an extremal rank-performance characterization, while Theorem 1 is axiomatic; neither asserts an algorithm, hardness, or a computable formulation. The unnumbered claim about CSAMs' low computational complexity supplies no eligible anchor, so the computational-result requirement fails.
fails bit a — no named computational result to mirror
No result is covered: continuing Theorem 2 would require replacing its turn-by-turn individual choices with cohort decisions. Theorem 1 and Propositions 1–7 characterize mechanisms or rank performance, and Section 7 reports simulations.
The best setting for a population mirror is large course allocation: many students, relatively few complete rankings over course-and-time bundles, and the same optimistic or pessimistic choice rule within each type. Type \(t\) has mass \(\mu_t\), and each category’s item supply scales with enrollment and is normalized to mass \(1\). An aggregate allocation can then be a measure assigning each type’s mass to bundles, while every student still receives an integral bundle. That is a sensible continuous-population allocation model, with the supply scaling as part of the mirror.
But I cannot attach that model to an eligible anchor in this paper. Its named results characterize mechanisms axiomatically or analyze their rank efficiency; none asserts that a computational problem is in P, NP-hard, or has another complexity classification. The nearest result is Theorem 2, proved here: for any CSAM and any mix of optimistic and pessimistic agents, there is a profile where every optimistic agent \(j\) gets rank \(n^p+1-\prod_{l=K_j}^{p} k_{j,\omega_j(l)}\), every pessimistic agent \(j\) gets rank \(n^p-\sum_{l=1}^{p}(k_{j,\omega_j(l)}-1)\), and some allocation gives at least \(n-1\) agents their top-ranked bundles while the remaining agent gets a top- or second-ranked bundle. This is a worst-case performance characterization, not a stated complexity result. The paper’s claim that CSAMs have low computational complexity is not a numbered result.
The obstacle to turning Theorem 2 into a convincing continuous problem is central to its model: agents take turns in an order over individual agent-category pairs. In a continuum, each agent has zero mass, so an individual choice does not deplete aggregate supply; replacing the turns with type-level mass choices would change the mechanism. Encoding priority into types would create many distinct types and undermine the proposed high-multiplicity regime. A static continuous allocation problem could be defined, but it would not preserve the result’s sequential mechanism.
So the positive case is limited: a plausible high-multiplicity regime exists for categorized allocation, and the paper’s per-capita supplies can be continued naturally. Yet there is no named computational result here to anchor the required mirror question to. That is the weakest point, and it prevents me from offering a precise continuous problem as a mirror of one of the paper’s eligible results.
The strongest case against a mirror is that this paper has no named computational result to mirror. Theorem 1 is an axiomatic characterization. Theorem 2 and Propositions 1–7 characterize rank performance; Section 7 reports simulations. The paper says CSAMs have low computational complexity, but gives no numbered complexity result or defined computational problem behind that claim. A continuous rank theorem might be interesting, but it would not supply the computational question this programme is meant to chart.
Theorem 2 is the closest candidate, and its best continuous version would try to preserve the priority order while replacing students and item supplies with masses. But priority is central to the mechanism: its bounds use each agent’s position in the order and the integer number \(k_{j,i}\) of items still available at that turn. If priority becomes a coordinate of a student’s type, students at different positions are no longer indistinguishable for the mechanism; representing those positions can make the type support grow with the population. If instead identical-preference students are grouped and act as a mass block, their fractional choices define a new allocation process. That may be a sensible model, but it is not the process whose rank guarantee Theorem 2 proves. And even a faithful new rank guarantee would be an extremal-performance result, not a computational classification.
Theorem 1 offers no better anchor. In an atomless population, an individual has zero mass, so individual strategyproofness can become vacuous if one person cannot affect the allocation. Treating a positive-mass cohort as the strategic unit avoids that, but changes the question to group manipulation. More fundamentally, the theorem is axiomatic, a kind of continuization the programme explicitly excludes.
There is a plausible large-course-allocation setting here: repeated preference types, supplies scaled with enrollment, and fractional aggregate assignments that still give each student an integral bundle. That makes a continuous model conceivable. A priority-quantile version of the mechanism might even be worth studying. But it would require a new computational problem and new results, rather than a continuous mirror of one in this paper. That is where the negative case is strongest. It is weaker as a universal claim: the scenario is plausible, and a block-based or priority-based extension could be worthwhile. The evidence supports “poor anchor for this programme” much more firmly than “no worthwhile continuous model exists.”
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.