atlas

Research map / Bandits and online learning / Online convex optimization and games

Competitive Analysis for Two-Level Ski-Rental Problem

AAAI 2021 · Bandits and online learning › Online convex optimization and games · approach: Online allocation with constraints · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use two fixed purchase thresholds, λ∗s = Cs and λ∗c = (Cs − 1)/Cs Cc + 1DTSR · TLSR, adversarial input sequencescompetitive ratio: 3−1/CsHelped
Randomize the purchase thresholds using the designed PMFsRTSR · TLSR, adversarial input sequencescompetitive ratio: eσ/(eσ − 1)Helped
Use randomized rather than fixed thresholdsTLSR algorithms in stochastic simulations · Uniform sequencescumulative normalized costHelped
Use randomized rather than fixed thresholdsTLSR algorithms in stochastic simulations · Mixed sequencescumulative normalized costHelped
Use fixed thresholds instead of randomized thresholdsDTSR · Uniform stochastic sequencescumulative normalized costHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy