{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:49:56Z","timestamp":1762508996645,"version":"3.37.3"},"reference-count":35,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202108","62072118"],"award-info":[{"award-number":["62202108","62072118"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Guangdong Natural Science Foundation","doi-asserted-by":"publisher","award":["2023A1515030183","2023A1515011230","2021B1515120010"],"award-info":[{"award-number":["2023A1515030183","2023A1515011230","2021B1515120010"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Huangpu International Sci & Tech Cooperation Fundation","award":["2021GH12"],"award-info":[{"award-number":["2021GH12"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,6,22]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Ridesharing is an effective approach to alleviate traffic congestion. In most existing works, drivers and passengers are assigned prices without considering the constraints of desired benefits. This paper investigates ridesharing by formulating a matching and pricing problem to maximize the total payoff of drivers, with the constraints of desired benefit and quality of experience. An efficient algorithm is proposed to solve the formulated problem based on coalitional double auction. Secondary pricing based strategy and sacrificed minimum bid based strategy are proposed to support the algorithm. This paper also proves that the proposed algorithm can achieve a Nash-stable coalition partition in finite steps, and the proposed two strategies guarantee truthfulness, individually rational and budget balance. Extensive simulation results on the real-world dataset of taxi trajectory in Beijing city show that the proposed algorithm outperforms the existing ones, in terms of average total payoff of drivers while meeting the benefits of passengers.<\/jats:p>","DOI":"10.1093\/comjnl\/bxad092","type":"journal-article","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:17:54Z","timestamp":1695482274000},"page":"1674-1686","source":"Crossref","is-referenced-by-count":1,"title":["Coalitional Double Auction For Ridesharing With Desired Benefit And QoE Constraints"],"prefix":"10.1093","volume":"67","author":[{"given":"Jiale","family":"Huang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Guangdong University of Technology , Guangzhou, 510006 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jigang","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Guangdong University of Technology , Guangzhou, 510006 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Guangdong University of Technology , Guangzhou, 510006 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yalan","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Guangdong University of Technology , Guangzhou, 510006 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yidong","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology, Beijing Jiaotong University , Beijing, 100044 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"key":"2024062312365957400_ref1","first-page":"1","article-title":"Towards minimum fleet for ridesharing-aware mobility-on-demand systems","volume-title":"IEEE Conference on Computer Communications, Vancouver, BC, Canada, 10\u201313 May","author":"Wang","year":"2021"},{"key":"2024062312365957400_ref2","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.trb.2013.08.012","article-title":"Ridesharing: the state-of-the-art and future directions","volume":"57","author":"Furuhata","year":"2013","journal-title":"Transp. Res. B"},{"key":"2024062312365957400_ref3","first-page":"201","article-title":"Assessing the potential of ride-sharing using mobile and social data: A tale of four cities","volume-title":"ACM International Joint Conference on Pervasive and Ubiquitous Computing, Seattle, WA, USA, 13\u201317 September","author":"Cici","year":"2014"},{"key":"2024062312365957400_ref4","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.trd.2008.10.001","article-title":"Fuel saving and ridesharing in the US: motivations, limitations, and opportunities","volume":"14","author":"Jacobson","year":"2009","journal-title":"Transp. Res. D"},{"key":"2024062312365957400_ref5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.trd.2017.07.031","article-title":"Quantifying the environmental impacts of increasing high occupancy vehicle lanes in the United States","volume":"56","author":"Javid","year":"2017","journal-title":"Transp. Res. D"},{"key":"2024062312365957400_ref6","first-page":"1034","article-title":"Auction-based order dispatch and pricing in ridesharing","volume-title":"IEEE International Conference on Data Engineering, Macao, China, 8\u201311 April","author":"Zheng","year":"2019"},{"key":"2024062312365957400_ref7","first-page":"223","article-title":"Measuring policy leakage of Beijing\u2019s car ownership restriction","volume":"148","author":"Zheng","year":"2021","journal-title":"Transp. Res. A"},{"key":"2024062312365957400_ref8","doi-asserted-by":"crossref","first-page":"2017","DOI":"10.14778\/2733085.2733106","article-title":"Large scale real-time ridesharing with service guarantee on road networks","volume":"7","author":"Huang","year":"2014","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2024062312365957400_ref9","first-page":"1197","article-title":"Utility-aware ridesharing on road networks","volume-title":"ACM International Conference on Management of Data, Chicago, IL, USA, 14\u201319 May","author":"Cheng","year":"2017"},{"key":"2024062312365957400_ref10","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.trb.2017.10.006","article-title":"A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system","volume":"106","author":"Masoud","year":"2017","journal-title":"Transp. Res. B"},{"key":"2024062312365957400_ref11","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1109\/TITS.2015.2490800","article-title":"Combinatorial auction-based pricing for multi-tenant autonomous vehicle public transportation system","volume":"17","author":"Lam","year":"2016","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"2024062312365957400_ref12","first-page":"1061","article-title":"Price-and-time-aware dynamic ridesharing","volume-title":"IEEE International Conference on Data Engineering, Paris, France, 16\u201319 April","author":"Chen","year":"2018"},{"key":"2024062312365957400_ref13","first-page":"9","article-title":"URoad: An efficient algorithm for large-scale dynamic ridesharing service","volume-title":"IEEE International Conference on Web Services, San Francisco, CA, USA, 2\u20137 July","author":"Fan","year":"2018"},{"key":"2024062312365957400_ref14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/MSP.2009.000000","article-title":"Coalitional game theory for communication networks","volume":"26","author":"Saad","year":"2009","journal-title":"IEEE Signal Process. Mag."},{"volume-title":"Auction theory","year":"2009","author":"Krishna","key":"2024062312365957400_ref15"},{"key":"2024062312365957400_ref16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trb.2017.01.004","article-title":"A decomposition algorithm to solve the multi-hop peer-to-peer ride-matching problem","volume":"99","author":"Masoud","year":"2017","journal-title":"Transp. Res. B"},{"key":"2024062312365957400_ref17","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TKDE.2017.2760880","article-title":"An efficient ride-sharing framework for maximizing shared route","volume":"30","author":"Ta","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2024062312365957400_ref18","first-page":"3","article-title":"Algorithms for trip-vehicle assignment in ride-sharing","volume-title":"AAAI Conference on Artificial Intelligence, New Orleans, Louisiana, USA, 2\u20137 February","author":"Bei","year":"2018"},{"key":"2024062312365957400_ref19","first-page":"961","article-title":"Mobility-aware dynamic taxi ridesharing","volume-title":"IEEE International Conference on Data Engineering, Dallas, TX, USA, 20\u201324 April","author":"Liu","year":"2020"},{"key":"2024062312365957400_ref20","doi-asserted-by":"crossref","first-page":"2888","DOI":"10.1109\/TKDE.2019.2961341","article-title":"Dynamic ridesharing in peak travel periods","volume":"33","author":"Luo","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2024062312365957400_ref21","doi-asserted-by":"crossref","first-page":"1782","DOI":"10.1109\/TKDE.2014.2334313","article-title":"Real-time city-scale taxi ridesharing","volume":"27","author":"Ma","year":"2015","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2024062312365957400_ref22","doi-asserted-by":"crossref","first-page":"853","DOI":"10.14778\/3204028.3204030","article-title":"Order dispatch in price-aware ridesharing","volume":"11","author":"Zheng","year":"2018","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2024062312365957400_ref23","doi-asserted-by":"crossref","first-page":"9399","DOI":"10.1109\/TVT.2019.2932869","article-title":"Flexi-sharing: a flexible and personalized taxi-sharing system","volume":"68","author":"Lyu","year":"2019","journal-title":"IEEE Trans. Veh. Technol."},{"key":"2024062312365957400_ref24","first-page":"1","article-title":"An on-line truthful and individually rational pricing mechanism for ride-sharing","volume-title":"ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Redondo Beach, CA, USA, 7\u201310 November","author":"Asghari","year":"2017"},{"key":"2024062312365957400_ref25","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TIV.2018.2804161","article-title":"Double auction-based pricing mechanism for autonomous vehicle public transportation system","volume":"3","author":"Yu","year":"2018","journal-title":"IEEE Trans. Intell. Veh."},{"key":"2024062312365957400_ref26","first-page":"266","article-title":"A mechanism for dynamic ride sharing based on parallel auctions","volume-title":"International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, 16\u201322 July","author":"Kleiner","year":"2011"},{"key":"2024062312365957400_ref27","doi-asserted-by":"crossref","first-page":"5648","DOI":"10.1109\/TITS.2020.2988356","article-title":"Assignment and pricing of shared rides in ride-sourcing using combinatorial double auctions","volume":"22","author":"Karamanis","year":"2020","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"2024062312365957400_ref28","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s10489-018-1288-x","article-title":"A solution methodology for carpooling systems based on double auctions and cooperative coevolutionary particle swarms","volume":"49","author":"Hsieh","year":"2019","journal-title":"Appl. Intell."},{"key":"2024062312365957400_ref29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"Kellerer","year":"2004"},{"key":"2024062312365957400_ref30","first-page":"1059","article-title":"Utility-aware batch-processing algorithms for dynamic carpooling based on double auction","volume-title":"IEEE International Conference on Parallel and Distributed Processing with Applications, Xiamen, China, 16\u201318 December","author":"Huang","year":"2019"},{"key":"2024062312365957400_ref31","doi-asserted-by":"crossref","first-page":"2690","DOI":"10.1109\/JSAC.2016.2606818","article-title":"VERACITY: overlapping coalition formation-based double auction for heterogeneous demand and spectrum reusability","volume":"34","author":"Sun","year":"2016","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"2024062312365957400_ref32","doi-asserted-by":"crossref","first-page":"3012","DOI":"10.1109\/TPDS.2013.294","article-title":"TAMES: a truthful double auction for multi-demand heterogeneous spectrums","volume":"25","author":"Chen","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"2024062312365957400_ref33","first-page":"3","article-title":"Unknown combinatorial auction mechanisms for heterogeneous spectrum redistribution","volume-title":"ACM International Symposium on Mobile Ad Hoc Networking and Computing, Philadelphia, PA, USA, 11\u201314 August","author":"Zheng","year":"2014"},{"key":"2024062312365957400_ref34","doi-asserted-by":"crossref","first-page":"5091","DOI":"10.1109\/TITS.2020.3043351","article-title":"UAV enabled content distribution for internet of connected vehicles in 5G heterogeneous networks","volume":"22","author":"Su","year":"2021","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"volume-title":"T-drive trajectory data sample dataset","year":"2011","author":"Zheng","key":"2024062312365957400_ref35"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/5\/1674\/58307980\/bxad092.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/5\/1674\/58307980\/bxad092.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T12:38:02Z","timestamp":1719146282000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/67\/5\/1674\/7280724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,22]]},"references-count":35,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,9,22]]},"published-print":{"date-parts":[[2024,6,22]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxad092","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2024,5]]},"published":{"date-parts":[[2023,9,22]]}}}