{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:11Z","timestamp":1750220351564,"version":"3.41.0"},"reference-count":66,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,2,28]],"date-time":"2023-02-28T00:00:00Z","timestamp":1677542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Joint Degree Program"},{"name":"KAKENHI Young Researcher","award":["20K19931"],"award-info":[{"award-number":["20K19931"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2023,2,28]]},"abstract":"<jats:p>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\u2019 revenue.<\/jats:p>","DOI":"10.1145\/3465237","type":"journal-article","created":{"date-parts":[[2023,3,14]],"date-time":"2023-03-14T12:13:36Z","timestamp":1678796016000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Real-time Pricing-based Resource Allocation in Open Market Environments"],"prefix":"10.1145","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9331-1841","authenticated-orcid":false,"given":"Pankaj","family":"Mishra","sequence":"first","affiliation":[{"name":"Nagoya Institute of Technology, Nagoya, Aichi, Japan and University of Wollongong, Wollongong, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3898-3773","authenticated-orcid":false,"given":"Ahmed","family":"Moustafa","sequence":"additional","affiliation":[{"name":"Nagoya Institute of Technology, Nagoya, Aichi, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5093-3886","authenticated-orcid":false,"given":"Takayuki","family":"Ito","sequence":"additional","affiliation":[{"name":"Kyoto University, Kyoto, Japan"}]}],"member":"320","published-online":{"date-parts":[[2023,4,5]]},"reference":[{"issue":"5","key":"e_1_3_2_2_2","first-page":"511","article-title":"Simple additive weighting approach to personnel selection problem","volume":"1","author":"Afshari Alireza","year":"2010","unstructured":"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.","journal-title":"Int. J. Innov., Manag. Technol."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-010-9137-2"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963433"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080916"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJGUC.2018.090230"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2015.06.025"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2016.2632719"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2010.5621982"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339720"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1088\/1469-7688\/4\/1\/010"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018702"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2011.30"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2018.8297294"},{"key":"e_1_3_2_15_2","first-page":"367","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence and Innovative Applications of Artificial Intelligence Conference","author":"Conen Wolfram","year":"2002","unstructured":"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\u2013372."},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017570"},{"key":"e_1_3_2_17_2","article-title":"Optimal auctions through deep learning","author":"D\u00fctting Paul","year":"2017","unstructured":"Paul D\u00fctting, Zhe Feng, Harikrishna Narasimhan, David C. Parkes, and Sai Srivatsa Ravindranath. 2017. Optimal auctions through deep learning. arXiv preprint arXiv:1706.03459 (2017).","journal-title":"arXiv preprint arXiv:1706.03459"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/EUC.2011.22"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1257\/aer.97.1.242"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/SAINT.2010.93"},{"key":"e_1_3_2_21_2","first-page":"242","volume-title":"Proceedings of the International Conference on Machine Learning","volume":"98","author":"Hu Junling","year":"1998","unstructured":"Junling Hu, Michael P. Wellman, et\u00a0al. 1998. Multiagent reinforcement learning: Theoretical framework and an algorithm. In Proceedings of the International Conference on Machine Learning, Vol. 98. Citeseer, 242\u2013250."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-012-0235-6"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3272021"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.5555\/1139191.1700927"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxv061"},{"key":"e_1_3_2_26_2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-981-13-1747-7_26","volume-title":"Information and Communication Technology for Intelligent Systems","author":"Kumar Dinesh","year":"2019","unstructured":"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\u2013277."},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/7609460"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2875507"},{"key":"e_1_3_2_29_2","article-title":"Multi-agent actor-critic for mixed cooperative-competitive environments","author":"Lowe Ryan","year":"2017","unstructured":"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).","journal-title":"arXiv preprint arXiv:1706.02275"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/1982185.1982216"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250952"},{"key":"e_1_3_2_32_2","article-title":"Resource abstraction for reinforcement learning in multiagent congestion problems","author":"Malialis Kleanthis","year":"2019","unstructured":"Kleanthis Malialis, Sam Devlin, and Daniel Kudenko. 2019. Resource abstraction for reinforcement learning in multiagent congestion problems. arXiv preprint arXiv:1903.05431 (2019).","journal-title":"arXiv preprint arXiv:1903.05431"},{"issue":"2009","key":"e_1_3_2_33_2","first-page":"1","article-title":"Introduction to discrete-event simulation and the simpy language","volume":"2","author":"Matloff Norm","year":"2008","unstructured":"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\u201333.","journal-title":"Davis, CA. Dept of Computer Science. University of California at Davis. Retrieved on August"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i10.7135"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87805-6_14"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2019959"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/E-SCIENCE.2006.261164"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2016.2541150"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35390-6_5"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1070.0384"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.02.008"},{"key":"e_1_3_2_43_2","first-page":"299","volume-title":"Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS\u201996)","author":"Sandholm Tuomas W.","year":"1996","unstructured":"Tuomas W. Sandholm. 1996. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS\u201996). 299\u2013306."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17432-2_51"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/CEC-EEE.2006.37"},{"key":"e_1_3_2_46_2","article-title":"Reinforcement mechanism design, with applications to dynamic pricing in sponsored search auctions","author":"Shen Weiran","year":"2017","unstructured":"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).","journal-title":"arXiv preprint arXiv:1711.10279"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/E-SCIENCE.2006.261167"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.06.080575"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.1998.712192"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/GRID.2007.4354144"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/739"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2009.23"},{"key":"e_1_3_2_53_2","first-page":"886","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"5","author":"Tesauro Gerald","year":"2005","unstructured":"Gerald Tesauro et\u00a0al. 2005. Online resource allocation using decompositional reinforcement learning. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 5. 886\u2013891."},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/2843945"},{"key":"e_1_3_2_55_2","first-page":"6","volume-title":"Proceedings of the 2nd USENIX Conference on Hot Topics in Cloud Computing","author":"Wang Hongyi","year":"2010","unstructured":"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\u20136."},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1504171"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0318-1"},{"key":"e_1_3_2_58_2","article-title":"More Google Cluster Data","author":"Wilkes John","year":"2011","unstructured":"John Wilkes. 2011. More Google Cluster Data. Google research blog. Retrieved from: http:\/\/googleresearch.blogspot.com\/2011\/11\/more-google-cluster-data.html.","journal-title":"Google research blog"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271748"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.04.055"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00456-6"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/2501040.2501980"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.12.006"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2004.11"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.04.029"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623633"},{"key":"e_1_3_2_67_2","first-page":"1","volume-title":"Proceedings of the IEEE International Conference on Communications (ICC\u201916)","author":"Zhao Yeru","year":"2016","unstructured":"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\u201916). IEEE, 1\u20136."}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465237","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:11Z","timestamp":1750191431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,28]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2,28]]}},"alternative-id":["10.1145\/3465237"],"URL":"https:\/\/doi.org\/10.1145\/3465237","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"type":"print","value":"1533-5399"},{"type":"electronic","value":"1557-6051"}],"subject":[],"published":{"date-parts":[[2023,2,28]]},"assertion":[{"value":"2020-07-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-06","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-04-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}