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.
American Economic Review , volume=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
For any prior, a receiver can commit to a randomized action policy that induces truthful signaling from all senders while achieving the receiver's maximum possible payoff.
Public messaging weakly dominates private messaging for implementing collective project decisions and is strictly dominant in linear-payoff settings with two conflicting allies.
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.
-
Multi-Sender Bayesian Persuasion with Imperfect Information
For any prior, a receiver can commit to a randomized action policy that induces truthful signaling from all senders while achieving the receiver's maximum possible payoff.
-
Going Public: Communication in Collective Decisions
Public messaging weakly dominates private messaging for implementing collective project decisions and is strictly dominant in linear-payoff settings with two conflicting allies.