Pages that link to "Item:Q5113899"

The following pages link to Uniformly Bounded Regret in the Multisecretary Problem (Q5113899):

Displaying 7 items.

• A unified approach for solving sequential selection problems (Q2188431) (← links)
• Online Allocation and Pricing: Constant Regret via Bellman Inequalities (Q5003719) (← links)
• Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
• Constant Regret Resolving Heuristics for Price-Based Revenue Management (Q5060522) (← links)
• Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
• Learning in Repeated Auctions (Q5863991) (← links)
• Simple and fast algorithm for binary integer and online linear programming (Q6160284) (← links)