{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:50:45Z","timestamp":1773377445304,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849556","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2549-2553","source":"Crossref","is-referenced-by-count":5,"title":["Interactions Between Learning and Broadcasting in Wireless Recommendation Systems"],"prefix":"10.1109","author":[{"given":"Linqi","family":"Song","sequence":"first","affiliation":[{"name":"City University of Hong Kong"}]},{"given":"Christina","family":"Fragouli","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles"}]},{"given":"Devavrat","family":"Shah","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492488"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref12","first-page":"127","article-title":"Thompson sampling for contextual bandits with linear payoffs","author":"agrawal","year":"2013","journal-title":"ICML"},{"key":"ref13","first-page":"679","article-title":"Contextual bandits with similarity information","author":"slivkins","year":"2011","journal-title":"COLT"},{"key":"ref14","first-page":"817","article-title":"The epoch-greedy algorithm for multi-armed bandits with side information","author":"langford","year":"2008","journal-title":"NIPS"},{"key":"ref15","first-page":"2116","article-title":"Combinatorial bandits revisited","author":"combes","year":"2015","journal-title":"NIPS"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2181864"},{"key":"ref17","first-page":"1113","article-title":"Efficient learning in large-scale combinatorial semi-bandits","author":"wen","year":"2015","journal-title":"ICML"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/100811969"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"2300","DOI":"10.1109\/18.720540","article-title":"Statistical inference under multiterminal data compression","volume":"44","author":"amari","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835918"},{"key":"ref28","article-title":"Regret vs. bandwidth trade-off for recommendation systems","author":"song","year":"2018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3727\/109830511X12978702284390"},{"key":"ref27","article-title":"Mémoire sur les élections au scrutin","author":"de borda","year":"1781"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2012.06.041"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2853548"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2013.04.006"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2006.09.033"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7637-6_6"},{"key":"ref20","article-title":"Federated learning: Strategies for improving communication efficiency","author":"kone?n?","year":"2016"},{"key":"ref22","first-page":"26","article-title":"Distributed learning, communication complexity and privacy","author":"balcan","year":"2012","journal-title":"COLT"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.28945\/1355"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2013.2263494"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613423"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1795"},{"key":"ref25","first-page":"485","article-title":"Contextual multi-armed bandits","author":"lu","year":"2010","journal-title":"AISTATS"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849556.pdf?arnumber=8849556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:41Z","timestamp":1773347621000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849556\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849556","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}