AI Paper Atlas

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

Learning Resource Allocation and Pricing for Cloud Profit Maximization

Bingqian Du, Chuan Wu, Zhiyi Huang

AAAI 2019 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 63 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
add LSTM history module to DDPG for non-Markovian arrivals (ablation)DDPG · Azure trace validationprofit: 25% more profitImproved
add LSTM history module to DDPG (ablation)DDPG · Azure trace validationaccepted users: 5% moreImproved
use DRL (LAPP) instead of online primal-dual pricing baselines RPD2/TI/TCcloud pricing and placement · Azure trace validationprofit: at least 40%Improved
use DRL (LAPP) instead of RPD2cloud pricing and placement · Azure trace, Pareto budgetsaccepted usersHurt
use LAPP instead of online algorithms in a worst-case request sequencecloud pricing and placement · Worst-case scenarioprofit: about 30%Improved
use LAPP instead of baselines with heterogeneous serverscloud pricing and placement · Heterogeneous serversprofit: at least 25%Improved

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