Derives first lower bound on γ_t for mean-based algorithms in unknown-horizon bandit settings, proposes two new algorithms, and shows some are also no-regret.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Misspecified estimate-then-optimize pricing converges to supra-competitive prices when initial random explorations occur in similar ranges, reaching monopoly levels under symmetry.
citing papers explorer
-
Mean-based algorithms: A lower bound and regret
Derives first lower bound on γ_t for mean-based algorithms in unknown-horizon bandit settings, proposes two new algorithms, and shows some are also no-regret.
-
Misspecified Estimate-then-Optimize Leads to Supra-Competitive Prices
Misspecified estimate-then-optimize pricing converges to supra-competitive prices when initial random explorations occur in similar ranges, reaching monopoly levels under symmetry.