| paper | d4-journals-geb-2023-0054 |
| 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 establish axiomatic characterizations of allocation rules. The paper gives no algorithm, complexity bound, hardness result, or solver formulation used to compute, so bit (a) fails even if a population-based extension could be designed.
fails bit a — no named computational result to mirror
No computational result is covered; Theorems 3.1, 3.2, and 4.1 are axiomatic characterizations.
I can’t make an anchored positive case: the paper has no named computational result. Its theorems concern axiomatic characterizations of allocation rules, not whether a problem is in P, NP-hard, FPT, or otherwise computationally tractable.
The closest anchor is Theorem 4.1, proved in this paper. It says that, for coalition structures \(P\) and unions \(C_k\) with \(|C_k|\ne2\), an allocation rule satisfies efficiency, symmetry across coalitions, weak coalitional marginality, weak monotonicity, and restricted equal treatment if and only if each player \(i\in C_k\) receives
\[
(1-\alpha_k)Ow_i(v,P)+\alpha_k\frac{Sh_k(v^P)}{|C_k|}
\]
for some \(\alpha_k\in[0,1]\). That is a substantive characterization, but it asserts no complexity result. Theorem 3.2 similarly characterizes the in-group egalitarian division value, and Theorem 3.1 characterizes the total share assigned to each union. Neither supplies a computational anchor.
There is a plausible *research direction*: model a large organization as departments containing many workers in a small number of interchangeable roles, give each department a mass distribution over roles, and ask for the limiting per-role allocation under an extension of the in-group egalitarian Owen value. That continues the population and coalition structure in the paper’s subject matter. But the paper does not define such a continuum game or establish that the finite Owen allocations converge to one. For arbitrary TU games, coalition values can depend on every subset of named players; replacing that with a function of type masses is an additional modeling restriction. The continuum Owen allocation, its scaling, and its computation would all need to be specified.
So there is no defensible continuous problem to state *per qualifying anchor*, and no tractable, transferring-hardness, or continuum-specific-hardness prediction grounded in the paper’s results. The possible large-organization extension is worth noting as a separate idea, but presenting it as a mirror of a computational result here would overstate the case.
The strongest case against a mirror is that the paper gives no computational result to mirror. Theorem 4.1 characterizes allocation rules by axioms; Theorem 3.2 characterizes the in-group egalitarian division value; Theorem 3.1 characterizes the total share each union receives. None defines an algorithmic problem, an input representation, or a complexity claim. Monotonicity axioms and an allocation formula are not, by themselves, computational results.
The proposed large-organization scenario is plausible, but it does not rescue Theorem 4.1 as a computational anchor. In the paper, a game is an arbitrary function \(v:2^N\to\mathbb{R}\), and the axioms refer to players’ marginal contributions across subsets of \(N\). A continuous population of role types does not encode those coalition values. To make a computable continuous version, one would need to choose a restricted game model—perhaps one where worth depends on type counts—along with a representation of that model, a scaling as the population grows, and a notion of the allocation to compute. Those choices define a new problem; the theorem supplies none of them.
The same issue defeats Theorems 3.1 and 3.2. Their conclusions concern, respectively, how a union’s total allocation relates to its intermediate-game Shapley value and when that total is divided equally among its members. One could ask for continuous analogues of either conclusion, but those would be continuizations of axiomatic statements. They do not yield the computational question this programme requires.
A stronger follow-on would be to study algorithms for computing these values on compactly represented, type-based games. That could be worthwhile research. But its computational content would depend on the chosen game representation and restrictions, while its connection to the paper would be the allocation rules it studies—not a computational result established here. Calling it a mirror would overstate the link.
So I would rule out this paper as a continuization candidate under ChoCo’s stated gate. The universal claim that no useful continuous computational project could ever be built from its ideas is weaker: a carefully chosen type-based game might motivate one. The paper itself gives no basis for identifying that project as a mirror of any of its named results.
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.