{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T02:33:45Z","timestamp":1772159625603,"version":"3.50.1"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100010663","name":"European Research Council AGNOSTIC Project","doi-asserted-by":"publisher","award":["H2020\/ERC2020POC\/957570\/DREAM"],"award-info":[{"award-number":["H2020\/ERC2020POC\/957570\/DREAM"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Open J. Commun. Soc."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/ojcoms.2022.3213213","type":"journal-article","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T15:46:11Z","timestamp":1665589571000},"page":"1867-1886","source":"Crossref","is-referenced-by-count":15,"title":["Task-Oriented Data Compression for Multi-Agent Communications Over Bit-Budgeted Channels"],"prefix":"10.1109","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9183-4411","authenticated-orcid":false,"given":"Arsham","family":"Mostaani","sequence":"first","affiliation":[{"name":"Centre for Security Reliability and Trust, University of Luxembourg, Luxembourg City, Luxembourg"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8374-443X","authenticated-orcid":false,"given":"Thang X.","family":"Vu","sequence":"additional","affiliation":[{"name":"Centre for Security Reliability and Trust, University of Luxembourg, Luxembourg City, Luxembourg"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5122-0001","authenticated-orcid":false,"given":"Symeon","family":"Chatzinotas","sequence":"additional","affiliation":[{"name":"Centre for Security Reliability and Trust, University of Luxembourg, Luxembourg City, Luxembourg"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2298-6774","authenticated-orcid":false,"given":"Bjorn","family":"Ottersten","sequence":"additional","affiliation":[{"name":"Centre for Security Reliability and Trust, University of Luxembourg, Luxembourg City, Luxembourg"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Task-oriented communication system design in cyberphysical systems: A survey on theory and applications","author":"Mostaani","year":"2021","journal-title":"arXiv:2102.07166"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/jsac.2022.3223408"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.107930"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056251"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/00207178808906054"},{"key":"ref6","article-title":"COME TOGETHER: Multi-agent geometric consensus","author":"Barel","year":"2017","journal-title":"arXiv:1902.01455"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3191326"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2020.v20.n2.a3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/GIIS.2018.8635663"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GIIS48668.2019.9044966"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2022.3199901"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(02)00285-6"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/s0363012902402116"},{"key":"ref14","first-page":"535","article-title":"An algorithm for distributed reinforcement learning in cooperative multi-agent systems","volume-title":"Proc. Conf. Mach. Learn.","author":"Lauer"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2912256"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3087248"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054753"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3390\/e23010104"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1024"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2976000"},{"key":"ref21","first-page":"1101","article-title":"Coordinating multi-agent reinforcement learning with limited communication","volume-title":"Proc. Conf. Auton. Agents Multi-Agent Syst.","author":"Zhang"},{"key":"ref22","first-page":"1334","article-title":"Hierarchical reinforcement learning in communication-mediated multiagent coordination","volume-title":"Proc. IEEE Joint Conf. Auton. Agents Multiagent Syst. (AAMAS)","author":"Fischer"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SMCIA.2008.5045926"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.09.008"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2872832"},{"key":"ref26","first-page":"2137","article-title":"Learning to communicate with deep multi-agent reinforcement learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Foerster"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2019.8904190"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9322138"},{"key":"ref29","article-title":"Learning to schedule communication in multi-agent reinforcement learning","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kim"},{"key":"ref30","first-page":"693","article-title":"On the pitfalls of measuring emergent communication","volume-title":"Proc. Int. Conf. Auton. Agents MultiAgent Syst.","author":"Lowe"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/9.24227"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2018.7511249"},{"key":"ref33","first-page":"2915","article-title":"Near optimal behavior via approximate state abstraction","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Abel"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.2307\/3214403"},{"key":"ref35","article-title":"Biased aggregation, Rollout, and enhanced policy improvement for reinforcement learning","author":"Bertsekas","year":"2019","journal-title":"arXiv:1910.02426"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/WINCOM.2018.8629632"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5957"},{"key":"ref38","first-page":"2244","article-title":"Learning multiagent communication with backpropagation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sukhbaatar"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834593"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2447"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.28.1.1"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/375735.376469"},{"key":"ref43","article-title":"DECPoMDPs with delayed communication","volume-title":"Proc. Multi-Agent Sequential Decis.-Making Uncertain Domains","author":"Oliehoek"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809008"},{"key":"ref45","volume-title":"Introduction to Reinforcement Learning","volume":"135","author":"Sutton","year":"2017"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TCDS.2018.2840971"},{"issue":"4","key":"ref47","first-page":"35","article-title":"Multiagent systems: Challenges and opportunities for decision-theoretic planning","volume":"20","author":"Boutilier","year":"1999","journal-title":"AI Mag."},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.21236\/ADA276517"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.cogsys.2015.12.002"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28929-8"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2293414"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094577"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11794"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v19i1.13355"},{"key":"ref56","first-page":"2411","article-title":"Speedy Q-learning","volume-title":"Proc. NIPS","author":"Azar"}],"container-title":["IEEE Open Journal of the Communications Society"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8782661\/9702748\/09916306.pdf?arnumber=9916306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T22:17:34Z","timestamp":1706048254000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9916306\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":56,"URL":"https:\/\/doi.org\/10.1109\/ojcoms.2022.3213213","relation":{"has-preprint":[{"id-type":"doi","id":"10.36227\/techrxiv.20629641","asserted-by":"object"},{"id-type":"doi","id":"10.36227\/techrxiv.20629641.v1","asserted-by":"object"}]},"ISSN":["2644-125X"],"issn-type":[{"value":"2644-125X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}