Real-time Pricing-based Resource Allocation in Open Market Environments
Article No.: 1, Pages 1 - 22
Abstract
Open market environments consist of a set of participants (vendors and consumers) that dynamically leave or join the market. As a result, the arising dynamism leads to uncertainties in supply and demand of the resources in these open markets. In specific, in such uncertain markets, vendors attempt to maximise their revenue by dynamically changing their selling prices according to the market demand. In this regard, an optimal resource allocation approach becomes immensely needed to optimise the selling prices based on the supply and demand of the resources in the open market. Therefore, optimal selling prices should maximise the revenue of vendors while protecting the utility of buyers. In this context, we propose a real-time pricing approach for resource allocation in open market environments. The proposed approach introduces a priority-based fairness mechanism to allocate the available resources in a reverse-auction paradigm. Finally, we compare the proposed approach with two state-of-the-art resource allocation approaches. The experimental results show that the proposed approach outperforms the other two resource allocation approaches in its ability to maximise the vendors’ revenue.
References
[1]
Alireza Afshari, Majid Mojahed, and Rosnah Mohd Yusuff. 2010. Simple additive weighting approach to personnel selection problem. Int. J. Innov., Manag. Technol. 1, 5 (2010), 511.
[2]
Bo An, Victor Lesser, and Kwang Mong Sim. 2011. Strategic agents for multi-resource negotiation. Auton. Agents Multi-Agent Syst. 23, 1 (2011), 114–153.
[3]
Danilo Ardagna, Barbara Panicucci, and Mauro Passacantando. 2011. A game theoretic formulation of the service provisioning problem in cloud systems. In Proceedings of the 20th International Conference on World Wide Web. 177–186.
[4]
Junjik Bae, Eyal Beigman, Randall A. Berry, Michael L. Honig, and Rakesh Vohra. 2008. Sequential bandwidth and power auctions for distributed spectrum sharing. IEEE J. Select. Areas. Commun. 26, 7 (2008), 1193–1203.
[5]
Gaurav Baranwal, Dinesh Kumar, Zahid Raza, and Deo Prakash Vidyarthi. 2018. A negotiation based dynamic pricing heuristic in cloud computing. Int. J. Grid Util. Comput. 9, 1 (2018), 83–96.
[6]
Gaurav Baranwal and Deo Prakash Vidyarthi. 2015. A fair multi-attribute combinatorial double auction model for resource allocation in cloud computing. J. Syst. Softw. 108 (2015), 60–76.
[7]
Gaurav Baranwal and Deo Prakash Vidyarthi. 2019. A truthful and fair multi-attribute combinatorial reverse auction for resource procurement in cloud computing. IEEE Trans. Serv. Comput. 12, 06 (2019), 851–864.
[8]
Randall Berry, Michael L. Honig, and Rakesh Vohra. 2010. Spectrum markets: Motivation, challenges, and implications. IEEE Commun. Mag. 48, 11 (2010), 146–155.
[9]
Anand Bhalgat, Jon Feldman, and Vahab Mirrokni. 2012. Online allocation of display ads with smooth delivery. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1213–1221.
[10]
Markus Burger, Bernhard Klar, Alfred Müller, and Gero Schindlmayr. 2004. A spot market model for pricing derivatives in electricity markets. Quantit. Finan. 4 (2004), 109–122.
[11]
Han Cai, Kan Ren, Weinan Zhang, Kleanthis Malialis, Jun Wang, Yong Yu, and Defeng Guo. 2017. Real-time bidding by reinforcement learning in display advertising. In Proceedings of the 10th ACM International Conference on Web Search and Data Mining. ACM, 661–670.
[12]
Sivadon Chaisiri, Rakpong Kaewpuang, Bu-Sung Lee, and Dusit Niyato. 2011. Cost minimization for provisioning virtual servers in Amazon elastic compute cloud. In Proceedings of the IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems. IEEE, 85–95.
[13]
Mingxi Cheng, Ji Li, and Shahin Nazarian. 2018. DRL-cloud: Deep reinforcement learning-based resource provisioning and task scheduling for cloud service providers. In Proceedings of the 23rd Asia and South Pacific Design Automation Conference (ASP-DAC’18). IEEE, 129–134.
[14]
Wolfram Conen and Tuomas Sandholm. 2002. Partial-revelation VCG mechanism for combinatorial auctions. In Proceedings of the AAAI Conference on Artificial Intelligence and Innovative Applications of Artificial Intelligence Conference. 367–372.
[15]
Bingqian Du, Chuan Wu, and Zhiyi Huang. 2019. Learning resource allocation and pricing for cloud profit maximization. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33. 7570–7577.
[16]
Paul Dütting, Zhe Feng, Harikrishna Narasimhan, David C. Parkes, and Sai Srivatsa Ravindranath. 2017. Optimal auctions through deep learning. arXiv preprint arXiv:1706.03459 (2017).
[17]
Neda Edalat, Wendong Xiao, Nirmalya Roy, Sajal K. Das, and Mehul Motani. 2011. Combinatorial auction-based task allocation in multi-application wireless sensor networks. In Proceedings of the IFIP 9th International Conference on Embedded and Ubiquitous Computing. IEEE, 174–181.
[18]
Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. 2007. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. Amer. Econ. Rev. 97, 1 (2007), 242–259.
[19]
Ikki Fujiwara, Kento Aida, and Isao Ono. 2010. Applying double-sided combinational auctions to resource allocation in cloud computing. In Proceedings of the 10th IEEE/IPSJ International Symposium on Applications and the Internet. IEEE, 7–14.
[20]
Junling Hu, Michael P. Wellman, et al. 1998. Multiagent reinforcement learning: Theoretical framework and an algorithm. In Proceedings of the International Conference on Machine Learning, Vol. 98. Citeseer, 242–250.
[21]
Congfeng Jiang, Liangcheng Duan, Chunlei Liu, Jian Wan, and Li Zhou. 2013. VRAA: Virtualized resource auction and allocation based on incentive and penalty. Cluster Comput. 16, 4 (2013), 639–650.
[22]
Junqi Jin, Chengru Song, Han Li, Kun Gai, Jun Wang, and Weinan Zhang. 2018. Real-time bidding with multi-agent reinforcement learning in display advertising. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. ACM, 2193–2201.
[23]
Ashkan R. Kian and Jose B. Cruz Jr. 2005. Bidding strategies in dynamic electricity markets. Decis. Supp. Syst. 40, 3–4 (2005), 543–551.
[24]
Yan Kong, Minjie Zhang, and Dayong Ye. 2015. An auction-based approach for group task allocation in an open network environment. Comput. J. 59, 3 (2015), 403–422.
[25]
Dinesh Kumar, Gaurav Baranwal, Zahid Raza, and Deo Prakash Vidyarthi. 2019. Fair mechanisms for combinatorial reverse auction-based cloud market. In Information and Communication Technology for Intelligent Systems. Springer, 267–277.
[26]
Xuejun Li, Ruimiao Ding, Xiao Liu, Xiangjun Liu, Erzhou Zhu, and Yunxiang Zhong. 2016. A dynamic pricing reverse auction-based resource allocation mechanism in cloud workflow systems. Scient. Program. 2016, Article ID 7609460, 13 pages.
[27]
Minghui Liwang, Shijie Dai, Zhibin Gao, Yuliang Tang, and Huaiyu Dai. 2018. A truthful reverse-auction mechanism for computation offloading in cloud-enabled vehicular network. IEEE Internet Things J. 6, 3 (2018), 4214–4227.
[28]
Ryan Lowe, Yi Wu, Aviv Tamar, Jean Harb, Pieter Abbeel, and Igor Mordatch. 2017. Multi-agent actor-critic for mixed cooperative-competitive environments. arXiv preprint arXiv:1706.02275 (2017).
[29]
Mario Macías and Jordi Guitart. 2011. A genetic model for pricing in cloud computing markets. In Proceedings of the ACM Symposium on Applied Computing. 113–118.
[30]
Mohammad Mahdian, Hamid Nazerzadeh, and Amin Saberi. 2007. Allocating online advertisement space with unreliable estimates. In Proceedings of the 8th ACM Conference on Electronic Commerce. 288–294.
[31]
Kleanthis Malialis, Sam Devlin, and Daniel Kudenko. 2019. Resource abstraction for reinforcement learning in multiagent congestion problems. arXiv preprint arXiv:1903.05431 (2019).
[32]
Norm Matloff. 2008. Introduction to discrete-event simulation and the simpy language. Davis, CA. Dept of Computer Science. University of California at Davis. Retrieved on August 2, 2009 (2008), 1–33.
[33]
Pankaj Mishra, Ahmed Moustafa, Takayuki Ito, and Minjie Zhang. 2020. Optimal auction based automated negotiation in realistic decentralised market environments. In Proceedings of the AAAI Conference on Artificial Intelligence. 13726–13727.
[34]
Javier Murillo, Víctor Muñoz, Beatriz López, and Dídac Busquets. 2008. A fair mechanism for recurrent multi-unit auctions. In Proceedings of the German Conference on Multiagent System Technologies. Springer, 147–158.
[35]
Huseyin Mutlu, Murat Alanyali, and David Starobinski. 2009. Spot pricing of secondary spectrum access in wireless cellular networks. IEEE/ACM Trans. Netw. 17, 6 (2009), 1794–1804.
[36]
Roger B. Myerson. 1981. Optimal auction design. Math. Operat. Res. 6, 1 (1981), 58–73.
[37]
Behnaz Pourebrahimi, Koen Bertels, G. M. Kandru, and Stamatis Vassiliadis. 2006. Market-based resource allocation in grids. In Proceedings of the 2nd IEEE International Conference on e-Science and Grid Computing (e-Science’06). IEEE, 80–80.
[38]
G. Vinu Prasad, Abhinandan S. Prasad, and Shrisha Rao. 2016. A combinatorial auction mechanism for multiple resource procurement in cloud computing. IEEE Trans. Cloud Comput. 6, 4 (2016), 904–914.
[39]
Ricardo J. Rabelo, Luis M. Camarinha-Matos, and Hamideh Afsarmanesh. 1998. Multiagent perspectives to agile scheduling. In Proceedings of the International Conference on Information Technology for Balanced Automation Systems. Springer, 51–66.
[40]
Michael H. Rothkopf. 2007. Thirteen reasons why the Vickrey-Clarke-Groves process is not practical. Operat. Res. 55, 2 (2007), 191–197.
[41]
Parnia Samimi, Youness Teimouri, and Muriati Mukhtar. 2016. A combinatorial double auction resource allocation model in cloud computing. Inf. Sci. 357 (2016), 201–216.
[42]
Tuomas W. Sandholm. 1996. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS’96). 299–306.
[43]
Adrian Schoenig and Maurice Pagnucco. 2010. Evaluating sequential single-item auctions for dynamic task allocation. In Proceedings of the Australasian Joint Conference on Artificial Intelligence. Springer, 506–515.
[44]
Michael Schwind, Oleg Gujo, and Tim Stockheim. 2006. Dynamic resource prices in a combinatorial grid system. In Proceedings of the 8th IEEE International Conference on E-Commerce Technology and the 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (CEC/EEE’06). IEEE, 49–49.
[45]
Weiran Shen, Binghui Peng, Hanpeng Liu, Michael Zhang, Ruohan Qian, Yan Hong, Zhi Guo, Zongyao Ding, Pengjun Lu, and Pingzhong Tang. 2017. Reinforcement mechanism design, with applications to dynamic pricing in sponsored search auctions. arXiv preprint arXiv:1711.10279 (2017).
[46]
Gurmeet Singh, Carl Kesselman, and Ewa Deelman. 2006. Application-level resource provisioning on the grid. In Proceedings of the 2nd IEEE International Conference on e-Science and Grid Computing (e-Science’06). IEEE, 83–83.
[47]
Igor Stanojev, Osvaldo Simeone, Umberto Spagnolini, Yeheskel Bar-Ness, and Raymond L. Pickholtz. 2010. Cooperative ARQ via auction-based spectrum leasing. IEEE Trans. Commun. 58, 6 (2010), 1843–1856.
[48]
Richard S. Sutton, Andrew G. Barto, et al. 1998. Introduction to Reinforcement Learning. Vol. 2. MIT Press, Cambridge, MA.
[49]
Zhu Tan and John R. Gurd. 2007. Market-based grid resource allocation using a stable continuous double auction. In Proceedings of the 8th IEEE/ACM International Conference on Grid Computing. IEEE, 283–290.
[50]
Pingzhong Tang. 2017. Reinforcement mechanism design. In Proceedings of the International Joint Conference on Artificial Intelligence. 5146–5150.
[51]
Yong Meng Teo and Marian Mihailescu. 2009. A strategy-proof pricing scheme for multiple resource type allocations. In Proceedings of the International Conference on Parallel Processing. IEEE, 172–179.
[52]
Gerald Tesauro et al. 2005. Online resource allocation using decompositional reinforcement learning. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 5. 886–891.
[53]
Adel Nadjaran Toosi, Kurt Vanmechelen, Farzad Khodadadi, and Rajkumar Buyya. 2016. An auction mechanism for cloud spot markets. ACM Trans. Auton. Adapt. Syst. 11, 1 (2016), 2.
[54]
Hongyi Wang, Qingfeng Jing, Rishan Chen, Bingsheng He, Zhengping Qian, and Lidong Zhou. 2010. Distributed systems meet economics: Pricing in the cloud. In Proceedings of the 2nd USENIX Conference on Hot Topics in Cloud Computing. 6–6.
[55]
Jian Wang, Huimin Miao, and Mingzhu Yu. 2019. Interdependent order allocation in the two-echelon competitive and cooperative supply chain. Int. J. Product. Res. 57, 4 (2019), 1190–1213.
[56]
Guiyi Wei, Athanasios V. Vasilakos, Yao Zheng, and Naixue Xiong. 2010. A game-theoretic method of fair resource allocation for cloud computing services. J. Supercomput. 54, 2 (2010), 252–269.
[57]
John Wilkes. 2011. More Google Cluster Data. Google research blog. Retrieved from: http://googleresearch.blogspot.com/2011/11/more-google-cluster-data.html.
[58]
Di Wu, Xiujun Chen, Xun Yang, Hao Wang, Qing Tan, Xiaoxun Zhang, Jian Xu, and Kun Gai. 2018. Budget constrained bidding by model-free reinforcement learning in display advertising. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. ACM, 1443–1451.
[59]
Bo Yang, Zhiyong Li, Shilong Jiang, and Keqin Li. 2018. Envy-free auction mechanism for VM pricing and allocation in clouds. Fut. Gen. Comput. Syst. 86 (2018), 680–693.
[60]
Samuel Yousefi, Mustafa Jahangoshai Rezaee, and Maghsud Solimanpur. 2021. Supplier selection and order allocation using two-stage hybrid supply chain model and game-based order price. Oper Res Int J 21 (2021), 553–588.
[61]
Shuai Yuan, Jun Wang, and Xiaoxue Zhao. 2013. Real-time bidding for online advertising: Measurement and analysis. In Proceedings of the 7th International Workshop on Data Mining for Online Advertising. 1–8.
[62]
Sharrukh Zaman and Daniel Grosu. 2013. Combinatorial auction-based allocation of virtual machine instances in clouds. J. Parallel Distrib. Comput. 73, 4 (2013), 495–508.
[63]
Liangzhao Zeng, Boualem Benatallah, Anne H. H. Ngu, Marlon Dumas, Jayant Kalagnanam, and Henry Chang. 2004. QoS-aware middleware for web services composition. IEEE Trans. Softw. Eng. 30, 5 (2004), 311–327.
[64]
Jixian Zhang, Xutao Yang, Ning Xie, Xuejie Zhang, Athanasios V. Vasilakos, and Weidong Li. 2020. An online auction mechanism for time-varying multidimensional resource allocation in clouds. Fut. Gen. Comput. Syst. 111 (2020), 27–38.
[65]
Weinan Zhang, Shuai Yuan, and Jun Wang. 2014. Optimal real-time bidding for display advertising. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 1077–1086.
[66]
Yeru Zhao, Zhiwu Huang, Weirong Liu, Jun Peng, and Qianqian Zhang. 2016. A combinatorial double auction based resource allocation mechanism with multiple rounds for geodistributed data centers. In Proceedings of the IEEE International Conference on Communications (ICC’16). IEEE, 1–6.
Index Terms
- Real-time Pricing-based Resource Allocation in Open Market Environments
Recommendations
Reinforcement Learning Based Real-Time Pricing in Open Cloud Markets
Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence PracticesAbstractRecently, with the rise in demand for reliable and economical cloud services, there is a rise in the number of cloud providers competing among each other. In such a competitive open market of multiple cloud providers, providers aim to model the ...
Demand Pricing & Resource Allocation in Market-Based Compute Grids: A Model and Initial Results
ICN '08: Proceedings of the Seventh International Conference on NetworkingMarket-based compute grids encompass service providers offering limited resources to potential users with varying quality of service demands and willingness to pay. Providers face problems of pricing and allocating resources to maximize revenue. ...
Resource Pricing and Equilibrium Allocation Policy in Cloud Computing
CIT '10: Proceedings of the 2010 10th IEEE International Conference on Computer and Information TechnologyCloud computing is a new emerging computing paradigm that advocates supplying users everything as a service. Compared with grid computing, the focus of resource management problem is transformed to resource virtualization and allocation rather than job ...
Comments
Information & Contributors
Information
Published In
February 2023
564 pages
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 05 April 2023
Online AM: 14 March 2023
Accepted: 06 May 2021
Revised: 09 March 2021
Received: 15 July 2020
Published in TOIT Volume 23, Issue 1
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Joint Degree Program (JDP)
- KAKENHI Young Researcher
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 270Total Downloads
- Downloads (Last 12 months)88
- Downloads (Last 6 weeks)7
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderFull Text
View this article in Full Text.
Full TextHTML Format
View this article in HTML Format.
HTML Format