atlas

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

Nearly Optimal Competitive Ratio for Online Allocation Problems with Two-sided Resource Constraints and Finite Requests

ICML 2023 · 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 price vector initialized from an estimate and dynamically updated at each step (Algorithm 4, known ξ*)Two-sided constrained online allocation · Stochastic i.i.d. requests with lower and upper resource boundscompetitive ratio (1 − O(ε/(ξ*−ε))) of W0 w.h.p.Helped
Estimate unknown feasibility measure ξ* from an initial stage of requests (Algorithm 6) instead of assuming it knownTwo-sided constrained online allocation · Stochastic i.i.d. requests, ξ* unknowncompetitive ratio orderMixed
Lower-bound deviation: enlarging lower bounds by τT ā_k (Algorithm with known distribution) to ensure feasibility (ablation)Algorithm P̃ (known distribution) · Stochastic i.i.d. requestsobjective value and constraint satisfaction w.p. 1−εHelped

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