{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T04:15:31Z","timestamp":1749096931013,"version":"3.41.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3574286","type":"journal-article","created":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T18:06:24Z","timestamp":1748455584000},"page":"94570-94584","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Approach of Majority Voting With Agents\u2019 Inclusiveness for Facility Resource Matching"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2012-7052","authenticated-orcid":false,"given":"Peash Ranjan","family":"Saha","sequence":"first","affiliation":[{"name":"School of Computing, Queen’s University, Kingston, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3187-112X","authenticated-orcid":false,"given":"Salimur","family":"Choudhury","sequence":"additional","affiliation":[{"name":"School of Computing, Queen’s University, Kingston, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4582-7477","authenticated-orcid":false,"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[{"name":"School of Computing, Queen’s University, Kingston, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.4169\/amer.math.monthly.120.05.386"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1108\/IJICC-08-2024-0374"},{"issue":"3","key":"ref3","article-title":"Popular matchings","volume":"105","author":"Cseh","year":"2017","journal-title":"Trends Comput. Social Choice, AI Access"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/bs.3830200304"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/06067328x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3638764"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1257\/000282803322157061"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.1999.2553"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s13235-022-00446-y"},{"key":"ref10","article-title":"Trade-offs in school choice: Comparing deferred acceptance, the naive and the classic Boston mechanism","author":"Mennle","year":"2014","journal-title":"arXiv:1406.3327"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.03.028"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.11.008"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_62"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2995223"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2017.8254516"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3344462"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2024.01.015"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2020.103105"},{"key":"ref19","first-page":"1","article-title":"Min-cost popular matchings","volume-title":"Proc. 40th IARCS Annu. Conf. Found. Softw. Technol. Theor. Comput. Sci.","author":"Kavitha"},{"key":"ref20","article-title":"Popular matching with lower quotas","author":"Nasre","year":"2017","journal-title":"arXiv:1704.07546"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/16M1076162"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9287-9"},{"key":"ref23","article-title":"Two-sided popular matchings in bipartite graphs with forbidden\/forced elements and weights","author":"Faenza","year":"2018","journal-title":"arXiv:1803.01478"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.173"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00791-7"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3442354"},{"key":"ref27","article-title":"Max-size popular matchings and extensions","author":"Kavitha","year":"2018","journal-title":"arXiv:1802.07440"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26176-4_16"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58747-9_22"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI52147.2023.10372017"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.10.012"},{"issue":"1","key":"ref32","article-title":"A quantitative measure of fairness and discrimination","volume":"21","author":"Jain","year":"1984"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11016712.pdf?arnumber=11016712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T17:57:40Z","timestamp":1749059860000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11016712\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3574286","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}