atlas

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

Online Pandora’s Boxes and Bandits

AAAI 2019 · Bandits and online learning › Online convex optimization and games · approach: Online allocation with constraints

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 a threshold-based prophet-inequality policy after reducing costs to zero-cost capped prizesOnline Pandora's box under matching feasibility constraints · General online Pandora's boxapproximation ratio: preserves the approximation factorHelped
Use the single-prize threshold policyOnline Pandora's box · Unconstrained opening, exactly one prize keptapproximation ratio: 1/2Helped
Apply the prophet-inequality reduction for a cardinality constraintOnline k-Pandora's box · At most k prizes keptapproximation ratio: 1-\frac{1}{\sqrt{k+3}}Helped
Apply the prophet-inequality reduction for a knapsack constraintOnline knapsack Pandora's box · Knapsack feasibilityapproximation ratio: 1/5Helped
Apply the prophet-inequality reduction for a matroid constraintOnline matroid Pandora's box · Matroid feasibilityapproximation ratio: 1/2Helped
Use per-type thresholds for prize acceptanceOnline multi-arm Pandora's box · Multi-arm problem with one opening allowed per roundapproximation ratio: 2-approximationHelped

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