Online revenue maximization for server pricing

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Efficient and truthful mechanisms to price time on remote servers/machines have been the subject of much work in recent years due to the importance of the cloud market. This paper considers online revenue maximization for a unit capacity server, when jobs are non preemptive, in the Bayesian setting: at each time step, one job arrives, with parameters drawn from an underlying distribution. We design an efficiently computable truthful posted price mechanism, which maximizes revenue in expectation and in retrospect, up to additive error. The prices are posted prior to learning the agent's type, and the computed pricing scheme is deterministic We also show the pricing mechanism is robust to learning the job distribution from samples, where polynomially many samples suffice to obtain near optimal prices.

Cite

CITATION STYLE

APA

Boodaghians, S., Fusco, F., Leonardi, S., Mansour, Y., & Mehta, R. (2020). Online revenue maximization for server pricing. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2021-January, pp. 4106–4112). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2020/568

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free