{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T15:24:05Z","timestamp":1782314645004,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,26]],"date-time":"2018-06-26T00:00:00Z","timestamp":1529971200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,26]]},"DOI":"10.1145\/3209582.3209586","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"31-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Learning Algorithms for Scheduling in Wireless Networks with Unknown Channel Statistics"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Stahlbuhk","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brooke","family":"Shrader","sequence":"additional","affiliation":[{"name":"MIT, Lincoln Laboratory, Lexington, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eytan","family":"Modiano","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Sample Mean Based Index Policies with O(log n) Regret for the Multi-Armed Bandit Problem. Advances in Applied Probability 27, 4","author":"Agrawal R.","year":"1995","unstructured":"R. Agrawal . 1995. Sample Mean Based Index Policies with O(log n) Regret for the Multi-Armed Bandit Problem. Advances in Applied Probability 27, 4 ( 1995 ). R. Agrawal. 1995. Sample Mean Based Index Policies with O(log n) Regret for the Multi-Armed Bandit Problem. Advances in Applied Probability 27, 4 (1995)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110406"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2157831"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2203294"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2292604"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.142"},{"key":"e_1_3_2_1_9_1","unstructured":"W. Chen Y. Wang and Y. Yuan. 2013. Combinatorial Multi-Armed Bandit: General Framework and Applications. ICML (2013) 151--159.   W. Chen Y. Wang and Y. Yuan. 2013. Combinatorial Multi-Armed Bandit: General Framework and Applications. ICML (2013) 151--159."},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. Neural Information Processing Systems","author":"Combes R.","year":"2015","unstructured":"R. Combes 2015 . Combinatorial Bandits Revisited . In Proc. Neural Information Processing Systems (2015), 2116--2124. R. Combes et al. 2015. Combinatorial Bandits Revisited. In Proc. Neural Information Processing Systems (2015), 2116--2124."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Y. Gai B. Krishnamachari and R. Jain. 2010. Learning Multiuser Channel Allocations in Cognitive Radio Networks: A Combinatorial Multi-Armed Bandit Formulation. IEEE New Frontiers in Dynamic Spectrum (2010).  Y. Gai B. Krishnamachari and R. Jain. 2010. Learning Multiuser Channel Allocations in Cognitive Radio Networks: A Combinatorial Multi-Armed Bandit Formulation. IEEE New Frontiers in Dynamic Spectrum (2010).","DOI":"10.1109\/DYSPAN.2010.5457857"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2181864"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.21215"},{"key":"e_1_3_2_1_14_1","volume-title":"Simple Distributed Weighted Matchings. eprint cs.DC\/0410047","author":"Hoepman J.H.","year":"2004","unstructured":"J.H. Hoepman . 2004. Simple Distributed Weighted Matchings. eprint cs.DC\/0410047 ( 2004 ). J.H. Hoepman. 2004. Simple Distributed Weighted Matchings. eprint cs.DC\/0410047 (2004)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2011.601934"},{"key":"e_1_3_2_1_16_1","article-title":"Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model","volume":"54","author":"Joo C.","year":"2009","unstructured":"C. Joo , X. Lin , and N. B. Shroff . 2009 . Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model . IEEE Trans. on Automatic Control 54 , 12 (2009). C. Joo, X. Lin, and N. B. Shroff. 2009. Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model. IEEE Trans. on Automatic Control 54, 12 (2009).","journal-title":"IEEE Trans. on Automatic Control"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2302471"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/938985.938991"},{"key":"e_1_3_2_1_19_1","volume-title":"Matroid Bandits: Fast Combinatorial Optimization with Learning. Uncertainty in Artificial Intelligence (UAI)","author":"Kveton B.","year":"2014","unstructured":"B. Kveton 2014 . Matroid Bandits: Fast Combinatorial Optimization with Learning. Uncertainty in Artificial Intelligence (UAI) (2014). B. Kveton et al. 2014. Matroid Bandits: Fast Combinatorial Optimization with Learning. Uncertainty in Artificial Intelligence (UAI) (2014)."},{"key":"e_1_3_2_1_20_1","unstructured":"B. Kveton etal 2015. Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits. AISTATS (2015) 535--543.  B. Kveton et al. 2015. Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits. AISTATS (2015) 535--543."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"e_1_3_2_1_22_1","volume-title":"Spectrum Bandit Optimization. Information Theory Workshop","author":"Lelarge M.","year":"2013","unstructured":"M. Lelarge , A. Proutiere , and M. Sadegh Talebi . 2013 . Spectrum Bandit Optimization. Information Theory Workshop ( 2013 ). M. Lelarge, A. Proutiere, and M. Sadegh Talebi. 2013. Spectrum Bandit Optimization. Information Theory Workshop (2013)."},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. Neural Information Processing Systems","author":"Lin T.","year":"2015","unstructured":"T. Lin , J. Li , and W. Chen . 2015. Stochastic Online Greedy Learning with Semibandit Feedbacks . In Proc. Neural Information Processing Systems ( 2015 ). T. Lin, J. Li, and W. Chen. 2015. Stochastic Online Greedy Learning with Semibandit Feedbacks. In Proc. Neural Information Processing Systems (2015)."},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. IEEE INFOCOM (2005)","author":"Lin X.","unstructured":"X. Lin and N.B. Shroff . 2005. The impact of imperfect scheduling on cross-layer rate control in wireless networks . In Proc. IEEE INFOCOM (2005) , 1804--1814. X. Lin and N.B. Shroff. 2005. The impact of imperfect scheduling on cross-layer rate control in wireless networks. In Proc. IEEE INFOCOM (2005), 1804--1814."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2062509"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140283"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"M. J. Neely. 2010. Stochastic Network Optimization with Application to Communication and Queueing Systems. Morgan & Claypool.   M. J. Neely. 2010. Stochastic Network Optimization with Application to Communication and Queueing Systems. Morgan & Claypool.","DOI":"10.1007\/978-3-031-79995-2"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764924"},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. Allerton Conf.","author":"Sharma G.","year":"2006","unstructured":"G. Sharma , C. Joo , and N. B. Shroff . 2006. Distributed Scheduling Schemes for Throughput Guarantees inWireless Networks . In Proc. Allerton Conf. ( 2006 ). G. Sharma, C. Joo, and N. B. Shroff. 2006. Distributed Scheduling Schemes for Throughput Guarantees inWireless Networks. In Proc. Allerton Conf. (2006)."},{"key":"e_1_3_2_1_31_1","volume-title":"Proc. ACM AAMAS","author":"Talebi M. S.","year":"2016","unstructured":"M. S. Talebi and A. Proutiere . 2016. An Optimal Algorithm for Stochastic Matroid Bandit Optimization . In Proc. ACM AAMAS ( 2016 ), 548--556. M. S. Talebi and A. Proutiere. 2016. An Optimal Algorithm for Stochastic Matroid Bandit Optimization. In Proc. ACM AAMAS (2016), 548--556."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2569093"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2014.54"}],"event":{"name":"Mobihoc '18: The Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","location":"Los Angeles CA USA","acronym":"Mobihoc '18","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"]},"container-title":["Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209582.3209586","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209582.3209586","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:02:49Z","timestamp":1750215769000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209582.3209586"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,26]]},"references-count":33,"alternative-id":["10.1145\/3209582.3209586","10.1145\/3209582"],"URL":"https:\/\/doi.org\/10.1145\/3209582.3209586","relation":{},"subject":[],"published":{"date-parts":[[2018,6,26]]},"assertion":[{"value":"2018-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}