{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:50:09Z","timestamp":1743119409924,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030457778"},{"type":"electronic","value":"9783030457785"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45778-5_7","type":"book-chapter","created":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T17:02:34Z","timestamp":1587315754000},"page":"85-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Achieving Proportional Fairness in WiFi Networks via Bandit Convex Optimization"],"prefix":"10.1007","author":[{"given":"Golshan","family":"Famitafreshi","sequence":"first","affiliation":[]},{"given":"Cristina","family":"Cano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"7_CR1","unstructured":"Wireless LAN medium access control (MAC) and physical layer (PHY) specifications. Amendment 4: enhancements for very high throughput for operation in bands below 6 GHz. ANSI\/IEEE Standard 802.11ac (2013)"},{"key":"7_CR2","unstructured":"Flaxman, A.D., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: gradient descent without a gradient. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 385\u2013394. Society for Industrial and Applied Mathematics, Philadelphia (2005). http:\/\/dl.acm.org\/citation.cfm?id=1070432.1070486"},{"key":"7_CR3","unstructured":"Agarwal, A., Dekel, O., Xiao, L.: Optimal algorithms for online convex optimization with multi-point bandit feedback. In: COLT, pp. 28\u201340. Citeseer (2010)"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Cano, C., Neu, G.: Wireless optimisation via convex bandits: unlicensed LTE\/WiFi coexistence. In: Proceedings of the 2018 Workshop on Network Meets AI & ML, NetAI 2018, pp. 41\u201347. ACM, New York (2018). https:\/\/doi.org\/10.1145\/3229543.3229551","DOI":"10.1145\/3229543.3229551"},{"issue":"8","key":"7_CR5","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1109\/LCOMM.2011.060811.110502","volume":"15","author":"A Checco","year":"2011","unstructured":"Checco, A., Leith, D.J.: Proportional fairness in 802.11 wireless LANs. IEEE Commun. Lett. 15(8), 807\u2013809 (2011). https:\/\/doi.org\/10.1109\/LCOMM.2011.060811.110502","journal-title":"IEEE Commun. Lett."},{"issue":"3\u20134","key":"7_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1561\/2400000013","volume":"2","author":"E Hazan","year":"2016","unstructured":"Hazan, E., et al.: Introduction to online convex optimization. Found. Trends\u00ae Optim. 2(3\u20134), 157\u2013325 (2016)","journal-title":"Found. Trends\u00ae Optim."},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Jiang, L.B., Liew, S.C.: Proportional fairness in wireless LANs and ad hoc networks. In: 2005 IEEE Wireless Communications and Networking Conference, vol. 3, pp. 1551\u20131556, March 2005. https:\/\/doi.org\/10.1109\/WCNC.2005.1424745","DOI":"10.1109\/WCNC.2005.1424745"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.adhoc.2015.06.002","volume":"36","author":"P Patras","year":"2016","unstructured":"Patras, P., Garcia-Saavedra, A., Malone, D., Leith, D.J.: Rigorous and practical proportional-fair allocation for multi-rate Wi-Fi. Ad Hoc Netw. 36, 21\u201334 (2016). https:\/\/doi.org\/10.1016\/j.adhoc.2015.06.002. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1570870515001262","journal-title":"Ad Hoc Netw."},{"key":"7_CR9","unstructured":"Saha, A., Tewari, A.: Improved regret guarantees for online smooth convex optimization with bandit feedback. In: Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, pp. 636\u2013642 (2011)"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Siris, V.A., Stamatakis, G.: Optimal CWmin selection for achieving proportional fairness in multi-rate 802.11e WLANs: test-bed implementation and evaluation. In: Proceedings of the 1st International Workshop on Wireless Network Testbeds, Experimental Evaluation & Characterization, WiNTECH 2006, pp. 41\u201348. ACM, New York (2006). https:\/\/doi.org\/10.1145\/1160987.1160996","DOI":"10.1145\/1160987.1160996"},{"key":"7_CR11","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the 20th International Conference on Machine Learning (ICML-2003), pp. 928\u2013936 (2003)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning for Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45778-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T01:03:13Z","timestamp":1709427793000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45778-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457778","9783030457785"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45778-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MLN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning for Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mln2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.adda-association.org\/mln\/Home.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}