Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
Haoran Xu, Owen Shen, Peter Glynn +2
We study nonstationary Online Linear Programming (OLP), where orders arrive sequentially with reward-resource consumption pairs that form a sequence of independent, but not nec…
cs.DS2023
Secretary Problems with Random Number of Candidates: How Prior Distributional Information Helps
Junhui Zhang, Patrick Jaillet
We study variants of the secretary problem, where , the number of candidates, is a random variable, and the decision maker wants to maximize the probability of success -- pickin…