Deterministic and randomized query algorithms find or certify the absence of a unanimously acceptable lottery over a finite menu, with lower bounds and learning-augmented variants that exploit accurate predictions.
Truthful aggregation of budget proposals
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Learning Unanimously Acceptable Lotteries via Queries
Deterministic and randomized query algorithms find or certify the absence of a unanimously acceptable lottery over a finite menu, with lower bounds and learning-augmented variants that exploit accurate predictions.