{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:29:03Z","timestamp":1772724543747,"version":"3.50.1"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"}],"funder":[{"name":"Koret Foundation Grant for Smart Cities and Digital Living"},{"name":"NSF GRFP"},{"name":"Alcatel-Lucent Stanford Graduate Fellowship"},{"name":"ISF","award":["1644\/18"],"award-info":[{"award-number":["1644\/18"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/jsait.2021.3073065","type":"journal-article","created":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T22:56:34Z","timestamp":1618440994000},"page":"584-598","source":"Crossref","is-referenced-by-count":9,"title":["One for All and All for One: Distributed Learning of Fair Allocations With Multi-Player Bandits"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4120-8292","authenticated-orcid":false,"given":"Ilai","family":"Bistritz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8924-0243","authenticated-orcid":false,"given":"Tavor Z.","family":"Baharav","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2265-7463","authenticated-orcid":false,"given":"Amir","family":"Leshem","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9250-4553","authenticated-orcid":false,"given":"Nicholas","family":"Bambos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1038\/sj.jors.2600523"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/90.879343"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2934003"},{"key":"ref32","first-page":"930","article-title":"My fair bandit: Distributed learning of max-min fairness with multi-player bandits","author":"bistritz","year":"2020","journal-title":"Proc 37th Int Conf Mach Learn"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/080723491"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2262278"},{"key":"ref37","article-title":"Group retention when using machine learning in sequential decision making: The interplay between user dynamics and fairness","author":"zhang","year":"2019","journal-title":"Proc NeurIPS"},{"key":"ref36","first-page":"325","article-title":"Fairness in learning: Classic and contextual bandits","author":"joseph","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","first-page":"1617","article-title":"Fairness in reinforcement learning","volume":"70","author":"jabbari","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref34","first-page":"3110","article-title":"Individual regret in cooperative nonstochastic multi-armed bandits","author":"bar-on","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3366701"},{"key":"ref40","first-page":"127","article-title":"Asymptotically optimal allocation of treatments in sequential experiments","author":"lai","year":"1984","journal-title":"Design of Experiments Ranking and Selection"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2017.0-139"},{"key":"ref12","first-page":"6369","article-title":"Learning with bandit feedback in potential games","author":"cohen","year":"2017","journal-title":"Proc 31th Int Conf Neural Inf Process Syst"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524557"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF44664.2019.9048964"},{"key":"ref15","article-title":"Cooperative multi-player bandit optimization","volume":"33","author":"bistritz","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref17","author":"hanawal","year":"2018","journal-title":"Multi-player bandits A trekking approach"},{"key":"ref18","first-page":"56","article-title":"Multi-player bandits revisited","author":"besson","year":"2018","journal-title":"Proc Algorithmic Learn Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737653"},{"key":"ref28","author":"bubeck","year":"2019","journal-title":"Non-stochastic multi-player multi-armed bandits Optimal rate with collision information sublinear without"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074370"},{"key":"ref27","author":"alatur","year":"2019","journal-title":"Multi-player bandits The adversarial case"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2013.2263494"},{"key":"ref6","author":"liu","year":"2019","journal-title":"Competing bandits in matching markets"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.896231"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110406"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2230215"},{"key":"ref7","author":"magesh","year":"2019","journal-title":"Multi-player multi-armed bandits with non-zero rewards on collisions for uncoordinated spectrum access"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2403288"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44848-9_5"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2062509"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2430837"},{"key":"ref20","first-page":"7222","article-title":"Distributed multi-player bandits-a game of thrones approach","author":"bistritz","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707118"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2302471"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2020.1051"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref24","first-page":"12048","article-title":"SIC-MMAB: Synchronisation involves communication in multiplayer multi-armed bandits","author":"boursier","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","first-page":"1781","article-title":"The true sample complexity of identifying good arms","author":"katz-samuels","year":"2020","journal-title":"Proc Int Conf Artif Intell Stat"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2635380"},{"key":"ref44","author":"gafni","year":"2021","journal-title":"Distributed learning over markovian fading channels for stable spectrum access"},{"key":"ref26","first-page":"155","article-title":"Multi-player bandits–A musical chairs approach","author":"rosenski","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref25","author":"boursier","year":"2019","journal-title":"A practical algorithm for multiplayer bandits when arm means vary among players"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/9459757\/9404291-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9459757\/09404291.pdf?arnumber=9404291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T22:36:42Z","timestamp":1636411002000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9404291\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":46,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3073065","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}