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.
The Annals of Statistics , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Concession and empathetic alignment in online arguments increase the likelihood of belief revision more than logical challenges or attacks.
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.
-
Change My View? The Dynamics of Persuasion and Polarization in Online Discourse
Concession and empathetic alignment in online arguments increase the likelihood of belief revision more than logical challenges or attacks.