| paper | d4-journals-geb-2017-0069 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
The second block proposes a plausible constituency model and a concrete computation, but its anchor, Theorem 3, only characterizes equilibrium payoffs through thresholds η_i. The paper states no algorithm, complexity bound, or computational formulation for finding those payoffs or thresholds.
fails bit a — no named computational result to mirror
The proposed extension concerns Theorem 3's equilibrium-payoff characterization; Theorem 1, Proposition 1, and Theorem 2 establish existence or structural properties and are not computational results.
I don’t see a defensible positive mirror anchored in this paper’s named results. The paper has no named computational result asserting tractability, hardness, or an algorithm for an underlying problem.
The closest results do not meet that bar: Theorem 1 proves equilibrium existence in sincere strategies; Proposition 1 proves that every equilibrium is consensual; Theorem 2 proves that every equilibrium is sincere and Pareto efficient; and Theorem 3 characterizes equilibrium payoffs using the thresholds \(\eta_i\). These are game-theoretic results, not computational claims. The paper gives no algorithm or complexity analysis for finding equilibria or computing those thresholds.
The model also has exactly two strategic players. Its continuity is in the lottery space \(\Delta\), which the programme explicitly treats as outcome-space continuity, not population continuization. One could invent a new model where each bargainer represents a continuum of constituent types, then ask how to compute equilibrium outcomes from their distributions. But that changes the strategic model and introduces a computational question the paper does not study; it cannot serve as a mirror of one of this paper’s computational anchors.
So the positive case is weak to the point of having no qualifying anchor. The paper offers useful background on continuous outcome spaces, but not a computational result whose population-continuous analogue this programme could chart.
Theorem 1, Proposition 1, and Theorem 2 are structural results about existence, consensus, sincerity, and efficiency. They do not supply a computational mirror on their own. Theorem 3 is a stronger candidate: it characterizes the equilibrium payoff set through the thresholds \(\eta_i\), which the paper defines by comparing players’ best consensual and non-consensual responses. Computing that set or its payoff bounds is a concrete computational task, even though the paper does not analyze its complexity.
A natural population version keeps the two strategic players as bargaining blocs. Each bloc represents a large constituency with a distribution \(\mu_i\) over members’ von Neumann–Morgenstern utility types. If its delegate is mandated to maximize average constituent welfare, the bloc’s utility for lottery \(p\) is
\[
\bar u_i(p)=\int u(p)\,d\mu_i(u).
\]
This is a plausible setting for labor or employer federations bargaining over contract terms. Repeated members of the same utility type are interchangeable, and changing their population shares can change \(\bar u_i\), the thresholds, and the equilibrium payoff set. The mass is doing work in the model.
That yields a population-computational question anchored in Theorem 3: given rational type distributions for the two blocs, compute or approximate the equilibrium payoff set, its endpoints, or whether a proposed payoff is attainable, with complexity measured in the number of alternatives, support sizes, and input bit length. The paper’s threshold definitions involve optimization over approval regions and their volume-weighted barycenters, so there is a genuine calculation to study. Whether it turns out to be easy would be an answer to the question, not a reason to discard it.
This mirror does not treat the lottery simplex as the continuous society. The society is the distribution of constituency members; the lotteries remain outcomes. The main weakness is that the extension assumes delegates maximize average normalized utility, and the paper proves no complexity bound for the resulting computation. Still, the paper’s generic two-player model and its equilibrium-payoff characterization give the authors a recognizable starting point. So the claim that no worthwhile population mirror exists in any scenario is too strong.
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.