pith. sign in

Settling the score: Portioning with cardinal preferences

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

2 Pith papers citing it

fields

cs.GT 2

years

2026 2

clear filters

representative citing papers

Learning Unanimously Acceptable Lotteries via Queries

cs.GT · 2026-04-19 · unverdicted · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Learning Unanimously Acceptable Lotteries via Queries cs.GT · 2026-04-19 · unverdicted · none · ref 18

    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.