Derives tight Θ(T^{2/3}) regret independent of outcome count m for adversarial agent types and Õ(√T) regret via explore-then-commit for fixed hidden type in single-dimensional binary-action contract design.
Single-dimensional contract design: Efficient algorithms and learning.arXiv preprint arXiv:2502.11661, 2025
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
-
Regret Minimization in Single-Dimensional Contract-Design with Binary Actions
Derives tight Θ(T^{2/3}) regret independent of outcome count m for adversarial agent types and Õ(√T) regret via explore-then-commit for fixed hidden type in single-dimensional binary-action contract design.