| paper | d4-journals-mss-2009-0028 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The named results prove structural coincidences and characterizations, but none asserts an algorithm, complexity bound, or computational formulation. The continuous queueing extension would require new solution definitions, so it does not supply a computational mirror of a result in the paper.
fails bit a — no named computational result to mirror
No result has a surviving computational mirror; the paper's main coincidence theorem and its simple-game and queueing characterizations remain structural results.
I can’t make an anchor-based case for a continuous computational mirror: the paper contains no named computational result asserting tractability, hardness, or a related complexity classification.
The nearest candidates do not meet that requirement. Theorem 3.1, proved here, says that every PS game has coincident Shapley value and prenucleolus. Proposition 4.2, proved here, characterizes PS simple games as dictatorial, bi-dictatorial, or joint dictatorships. Proposition 4.3, also proved here, characterizes the generalized queueing games that are PS games as the reasonable queueing games. These are structural game-theoretic results, not complexity results about computing a solution.
A continuous population version of cooperative games might be an interesting separate project, but it would not give this paper a qualifying anchor or a grounded continuous question per anchor. Calling one of these results a computational anchor would overstate what the paper proves.
The case against a ChoCo mirror is strongest at the programme’s entry gate: this paper proves no named computational result. The proponent raised no qualifying anchors, and the obvious candidates do not supply any. Theorem 3.1 proves a coincidence of solution concepts for PS games; Proposition 4.2 classifies the PS simple games; Proposition 4.3 characterizes the reasonable queueing games. They are structural results, not claims about complexity or algorithms. Turning one into an algorithmic question would add a computational problem the paper itself does not pose.
The best rescue is the queueing application. Large cohorts with the same waiting cost are a plausible high-multiplicity regime, and a continuous model could represent them by a distribution of waiting-cost types. That is evidence the regime makes sense, not an objection to it. But the paper’s result concerns equality of two solution concepts on finite coalitional games. In a continuum, adding one agent does not change coalition mass, so ordinary marginal contributions vanish; the finite Shapley formula over player orderings no longer directly applies. A density-based Shapley analogue, and a prenucleolus defined over continuum coalitions, would need new definitions. Studying their coincidence could be worthwhile cooperative game theory, but it would be a new structural question, not a computational mirror of a result here.
The simple-game application faces a related problem. A continuum version of voting power might assign each infinitesimal player zero individual power; rescaling it or using a different power measure would be an additional modelling choice. And a computational task such as recognizing PS structure or computing solution values would depend on an input representation the paper never specifies. With an explicit coalition table, recognition is a direct scan; with a compact game description, the complexity depends on that description. Neither choice turns the paper’s characterizations into a grounded complexity result.
So the negative case is strong for ChoCo’s stated scope, but it cannot establish that no continuous extension of these games is worth studying anywhere. A continuous queueing game may be a sensible research object. The narrower conclusion is that pursuing it would require specifying and studying a new continuum solution theory, rather than charting the computational landscape of a problem this paper already 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.