Randomized calibrated expert aggregation that Blackwell-refines a target is polynomial-time solvable; deterministic aggregation is NP-hard and has no multiplicative PTAS for proper losses.
Proceedings of the 24th ACM Conference on Economics and Computation , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Algorithmic Expert Aggregation
Randomized calibrated expert aggregation that Blackwell-refines a target is polynomial-time solvable; deterministic aggregation is NP-hard and has no multiplicative PTAS for proper losses.