Abstract
Current storage offerings provide a small number of options in the form of fixed prices with volume discounting. This leaves storage operators to guess how much data customers will add over time. Instead, we propose that the operator elicits basic information about future usage. Such information can be used to operate the system more efficiently. In particular, we show how prices can be calculated that encourage customers to accurately report the range of their future usage while ensuring that the operator covers his costs.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference9 articles.
1. Pricing and queueing
2. Mechanism design
3. D. Fotakis P. Krysta and C. Ventre. Combinatorial auctions without money. CoRR abs/1310.0177 2013. D. Fotakis P. Krysta and C. Ventre. Combinatorial auctions without money. CoRR abs/1310.0177 2013.
4. Strictly Proper Scoring Rules, Prediction, and Estimation
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献