| paper | d4-conf-ijcai-2017-0344 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 1 and Propositions 1 and 2 characterize and normalize WEU representations; they do not assert a computational result. The paper's elicitation procedure, LPs, and experiments are not stated as a numbered computational result with a guarantee, so there is no qualifying anchor to mirror. A customer population with identical preferences adds nothing to the single-DM task, while heterogeneous preferences require a new collective objective.
fails bit a — no named computational result to mirror
No result is covered: Theorem 1 and Propositions 1 and 2 concern WEU representation, while the elicitation procedure and experiments lack a numbered computational guarantee.
I can’t make a positive case that meets your anchor requirement: the paper has no named computational result asserting a complexity classification or giving a computational formulation as a numbered result.
The closest numbered results do not qualify. Theorem 1, cited from Fishburn (1983), characterizes equivalent WEU representations; Propositions 1 and 2 normalize those representations and relate hypothesis \(h_2\) to monotonicity. The paper’s LPs for elicitation appear in its method, and its efficiency claims are experimental, but neither is stated as a numbered computational result.
There is a possible population story—many customers grouped by complete WEU preference type, with mass denoting each type’s share—but choosing a common lottery for them would turn the paper’s single-DM recommendation problem into a collective decision problem. The paper’s continuous lotteries are outcome-space continuity, not population continuity. Without a qualifying anchor, I don’t think that story supports the requested mirror.
The strongest case against a mirror is that this paper has no named computational result to continuize. Theorem 1 characterizes equivalent WEU representations; Propositions 1 and 2 normalize those representations and connect an assumption to monotonicity. None classifies an algorithmic problem. The paper does give an elicitation procedure, LP formulations, and experiments, but no complexity theorem or proved query or approximation guarantee. So there is no computational result here for a continuous mirror to preserve or transform.
The tempting population version is a society of customers with different WEU preferences, from which one wants to choose a lottery. But the paper asks for the best lottery for one DM. If everyone in a cohort has the same complete preference type, one representative’s answers suffice and the cohort’s mass adds nothing to that task. If types differ, the problem needs a social objective—majority preference, aggregate welfare, or robustness across types—that the paper does not provide. The WEU representation is not a shared cardinal scale: equivalent representations can change the numerical intensities between lotteries. A majority rule could avoid that issue, but it would introduce a collective choice problem, rather than mirror this paper’s elicitation result.
The other analyst’s customer-population suggestion therefore identifies a plausible adjacent project, not an anchor from this paper. I can’t honestly rule out that such a project would be worthwhile. The negative case is strongest when scoped to the requested mirror: none of the paper’s named results supplies a computational target, and adding a population forces the central question to change.
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.