Pith. sign in

Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=

Tractable agreement protocols , author=

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
browse 2 citing papers

fields

cs.GT 1 cs.LG 1

years

2026 2

verdicts

ACCEPT 1 unreviewed 1

representative citing papers

Algorithmic Expert Aggregation

cs.GT · 2026-07-09 · accept · novelty 7.0

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.

citing papers explorer

Showing 2 of 2 citing papers.

  • Algorithmic Expert Aggregation cs.GT · 2026-07-09 · accept · none · ref 3

    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.

  • Instance-Adaptive Online Multicalibration cs.LG · 2026-05-10 · unreviewed · ref 92 · 2 links