| paper | d4-journals-jet-2015-0046 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Theorem 1, Proposition 6, and Theorem 7 give representation or characterization results, with no algorithm, complexity claim, hardness result, or computationally used formulation. The committee analogy may inspire a population-level project, but it does not make a result of this paper computational.
fails bit a — no named computational result to mirror
No computational result is covered; Theorem 1, Proposition 6, and Theorem 7 are representation or characterization results, and Section 3 proposes decision rules.
The paper contains no named computational result of the kind required for an anchor. Theorem 1, proved here, characterizes graded preferences through a utility function, a set of priors, and a capacity measure. Proposition 6 characterizes its complete-preference special case, and Theorem 7 characterizes comparative decisiveness. These are representation results, not complexity or algorithmic results; the paper does not compute with a formulation in a way that supplies a computational anchor.
There is a plausible population setting in the paper’s own interpretation: a large committee whose members share a finite set of prior types, with each type’s mass representing its share of the committee. Given two acts, members’ expected-utility comparisons could determine an aggregate grade of support. The authors explicitly describe priors as committee members’ opinions. But the paper’s \(\pi\) is a capacity, not necessarily an additive population share, and the paper proves no computational result about evaluating or optimizing such a committee’s decisions.
So that setting suggests a possible continuous-population research question, but it cannot honestly support the requested anchor-by-anchor case. The positive case stops there: the paper offers a recognizable committee interpretation, not a named computational result to mirror.
The strongest negative is that the paper has no computational result to continuize. Theorem 1 characterizes when a graded preference has a representation; Proposition 6 identifies the complete-preference special case; Theorem 7 characterizes when one decision maker is more decisive than another. None asks for an algorithm or analyzes complexity. Theorem 1’s inputs are also abstract: \(\Omega\) may be arbitrary, \(M\) is a set of finitely additive priors, and \(\pi\) is a capacity on \(B(M)\). The paper gives no finite encoding for these objects. A computational problem would first need choices about how to encode them and what task to perform.
The committee analogy is the best rescue, and it does suggest a sensible high-multiplicity setting: members with the same prior and utility could be grouped, with mass representing their share. With additive \(\pi\), the grade can be read as the share of committee members whose priors rank one act above another. But that interpretation does not supply a computational question from the paper. To study a committee winner, robustness, or interventions on members’ opinions, one must add an agenda, an aggregation or winner rule, and—especially for bribery or control—a model of permitted changes and their costs. Those might motivate a worthwhile project, but they are new ingredients; the paper neither formulates nor analyzes the resulting problem. Its general \(\pi\) is a capacity aggregating a single decision maker’s plausible priors, not necessarily a population measure.
Proposition 6 does not provide a separate route: completeness reduces that decision maker’s representation to one prior \(q\). A population of people with different \(q\)’s could be constructed, but aggregating them is again a new collective-choice problem. Theorem 7 compares two decision makers’ decisiveness; turning it into a population-level question requires defining what aggregate decisiveness means and what computational task uses it. Neither theorem anchors such a task.
So the paper can inspire a continuous committee-choice or control study, and it would be wrong to rule that out just because high-multiplicity committees are possible. But the proponent has identified a population interpretation, not a computational mirror of a result in this paper. The negative case is strongest on that boundary; it cannot honestly establish that no adjacent project could be worthwhile.
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.