AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Randomized Mechanisms for Selling Reserved Instances in Cloud

Jia Zhang, Weidong Ma, Tao Qin, Xiaoming Sun, Tie-Yan Liu

AAAI 2017 · Learning theory and algorithms › Submodular and game algorithms · approach: Learned auction design · 8 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
Use randomized threshold-price filtration before greedy schedulingRandom-Pricing · Online reserved-instance allocation, k=T=2social welfare competitive ratio: \frac{1}{42}Improved
Use randomized threshold-price filtration before greedy schedulingRandom-Pricing · Online reserved-instance allocation, k=T=2revenue competitive ratio: \frac{1}{42}Improved
Bound each request's resource use by αC and use greedy acceptance with price ρ_min c_j t_jGreedy · Online reserved-instance allocation, k=T=2, c_j/C≤α≤0.5social welfare competitive ratio: \frac{1-\alpha}{11-\alpha}Improved
Bound each request's resource use by αC and use greedy acceptance with price ρ_min c_j t_jGreedy · Online reserved-instance allocation, k=T=2, c_j/C≤α≤0.5revenue competitive ratio: \frac{1-\alpha}{11-\alpha}Improved
Randomly select value-density and request-length bins and filter using the resulting threshold priceBinary-Filter · Online reserved-instance allocation, general k and Tsocial welfare competitive ratio: \frac{1}{42\ceil{\log k}\ceil{\log T}}Improved
Randomly select value-density and request-length bins and filter using the resulting threshold priceBinary-Filter · Online reserved-instance allocation, general k and Trevenue competitive ratio: \frac{1}{42\ceil{\log k}\ceil{\log T}}Improved
Remove the random resource-size choice under the bounded-request-size constraintBinary-Filter · Online reserved-instance allocation, general k and T, c_j/C≤α≤1/2social welfare competitive ratio: \frac{1-\alpha}{(11-\alpha)\ceil{\log k}\ceil{\log T}}Improved
Remove the random resource-size choice under the bounded-request-size constraintBinary-Filter · Online reserved-instance allocation, general k and T, c_j/C≤α≤1/2revenue competitive ratio: \frac{1-\alpha}{(11-\alpha)\ceil{\log k}\ceil{\log T}}Improved
Omit the threshold-price filtrationRandom-Pricing · Online reserved-instance allocationsocial welfareHurt

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