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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
PTMC is a proposed Monte Carlo estimator that generates market-outcome distributions by simulating continuous double-auction interactions among persona-conditioned neural-policy bots whose heterogeneity is drawn from a learned distribution.
Strategic agents can achieve high-harm outcomes via low-capacity channels by concentrating residual capacity on high-impact predicates of confidential data, so leakage bounds need not bound worst-case harm.
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.
-
Persona-Trained Monte Carlo: Estimating Market-Outcome Distributions via Swarms of Persona-Conditioned Neural Policy Bots in a Limit Order Book
PTMC is a proposed Monte Carlo estimator that generates market-outcome distributions by simulating continuous double-auction interactions among persona-conditioned neural-policy bots whose heterogeneity is drawn from a learned distribution.