{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T16:39:18Z","timestamp":1779295158686,"version":"3.51.4"},"reference-count":57,"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.3622165","type":"journal-article","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T17:38:44Z","timestamp":1760636324000},"page":"179604-179621","source":"Crossref","is-referenced-by-count":1,"title":["Beyond Efficiency: Emotion-Aware Competitive Analysis of Online Algorithms"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2689-4412","authenticated-orcid":false,"given":"Christine","family":"Markarian","sequence":"first","affiliation":[{"name":"College of Engineering and Information Technology, University of Dubai, Academic City, Dubai, United Arab Emirates"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"ref2","volume-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"2005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0436-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0029562"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.31"},{"key":"ref6","first-page":"1","article-title":"Greedy algorithms for online survivable network design","volume-title":"Proc. 45th Int. Colloq. Automata","author":"Dehghani"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00122"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00841-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00801-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00844-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2993749.2993766"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.05.029"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.52"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806772"},{"key":"ref16","first-page":"20083","article-title":"The primal-dual method for learning augmented algorithms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bamas"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17294"},{"key":"ref18","first-page":"582","article-title":"Online algorithms with multiple predictions","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Anand"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3447579"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3548774"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.112"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3582689"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055493"},{"key":"ref25","first-page":"46","article-title":"Online and dynamic algorithms for geometric set cover and hitting set","volume-title":"Proc. 39th Int. Symp. Comput. Geometry (SoCG)","author":"Khan"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9915-5"},{"key":"ref27","first-page":"22:1","article-title":"Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets","volume-title":"Proc. 9th Int. Conf. Fun With Algorithms (FUN)","volume":"100","author":"Hamann"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.5220\/0007369500002104"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0420-y"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-018-0305-7"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.5220\/0011958700003467"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.5220\/0008866701210128"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3528087"},{"key":"ref34","first-page":"2115","article-title":"Augmenting online algorithms with \u03b5-accurate predictions","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Gupta"},{"key":"ref35","article-title":"Online algorithms with uncertainty-quantified predictions","author":"Sun","year":"2023","journal-title":"arXiv:2310.11558"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"ref37","first-page":"3323","article-title":"Equality of opportunity in supervised learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Hardt"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21188"},{"key":"ref39","article-title":"Promoting algorithmic fairness in clinical risk prediction","author":"Pfohl","year":"2022","journal-title":"POLICY"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1080\/10447318.2022.2138826"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1057\/s41599-025-05116-z"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.patter.2021.100380"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s41449-024-00434-5"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.3389\/frai.2023.1250725"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1002\/9781119636113.ch42"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3272027"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3471158.3472260"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1093\/pnasnexus\/pgae520"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237991"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3504541"},{"key":"ref55","first-page":"196","article-title":"Online scheduling","volume-title":"Online Algorithms: The State Art","author":"Sgall","year":"2005"},{"key":"ref56","article-title":"Online edge coloring: Sharp thresholds","author":"Blikstad","year":"2025","journal-title":"arXiv:2507.21560"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-60924-4_22"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11205360.pdf?arnumber=11205360","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T04:50:20Z","timestamp":1761281420000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11205360\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3622165","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}