{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:31:57Z","timestamp":1752982317035,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T00:00:00Z","timestamp":1635984000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-1651570"],"award-info":[{"award-number":["CNS-1651570"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,10]]},"DOI":"10.1145\/3484266.3487392","type":"proceedings-article","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T22:31:15Z","timestamp":1636065075000},"page":"140-146","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Don't Hate the Player, Hate the Game"],"prefix":"10.1145","author":[{"given":"Pratiksha","family":"Thaker","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Matei","family":"Zaharia","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Tatsunori","family":"Hashimoto","sequence":"additional","affiliation":[{"name":"Stanford University"}]}],"member":"320","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"volume-title":"Google Meet hardware requirements. https:\/\/support.google.com\/meethardware\/answer\/4541234?hl=en#zippy=%2Cminimum-bandwidth-required.","year":"2020","key":"e_1_3_2_1_1_1","unstructured":"2020. Google Meet hardware requirements. https:\/\/support.google.com\/meethardware\/answer\/4541234?hl=en#zippy=%2Cminimum-bandwidth-required. ( 2020 ). 2020. Google Meet hardware requirements. https:\/\/support.google.com\/meethardware\/answer\/4541234?hl=en#zippy=%2Cminimum-bandwidth-required. (2020)."},{"key":"e_1_3_2_1_2_1","unstructured":"2020. How much bandwidth does Skype need? https:\/\/support.skype.com\/en\/faq\/FA1417\/how-much-bandwidth-does-skype-need. (2020).  2020. How much bandwidth does Skype need? https:\/\/support.skype.com\/en\/faq\/FA1417\/how-much-bandwidth-does-skype-need. (2020)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633037"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3232755.3232783"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3422604.3425939"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009824"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2006.320206"},{"key":"e_1_3_2_1_8_1","volume-title":"Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN systems 17, 1","author":"Chiu Dah-Ming","year":"1989","unstructured":"Dah-Ming Chiu and Raj Jain . 1989. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN systems 17, 1 ( 1989 ), 1--14. Dah-Ming Chiu and Raj Jain. 1989. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN systems 17, 1 (1989), 1--14."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0165-4896(94)90001-9"},{"key":"e_1_3_2_1_10_1","first-page":"2","article-title":"PCC: Re-architecting Congestion Control for Consistent High Performance","volume":"1","author":"Dong Mo","year":"2015","unstructured":"Mo Dong , Qingxi Li , Doron Zarchy , Philip Brighten Godfrey , and Michael Schapira . 2015 . PCC: Re-architecting Congestion Control for Consistent High Performance .. In NSDI , Vol. 1. 2 . Mo Dong, Qingxi Li, Doron Zarchy, Philip Brighten Godfrey, and Michael Schapira. 2015. PCC: Re-architecting Congestion Control for Consistent High Performance.. In NSDI, Vol. 1. 2.","journal-title":"NSDI"},{"key":"e_1_3_2_1_11_1","volume-title":"15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18)","author":"Dong Mo","year":"2018","unstructured":"Mo Dong , Tong Meng , Doron Zarchy , Engin Arslan , Yossi Gilad , Brighten Godfrey , and Michael Schapira . 2018 . PCC Vivace: Online-learning congestion control . In 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18) . 343--356. Mo Dong, Tong Meng, Doron Zarchy, Engin Arslan, Yossi Gilad, Brighten Godfrey, and Michael Schapira. 2018. PCC Vivace: Online-learning congestion control. In 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18). 343--356."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536486"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.793002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400097.1400105"},{"key":"e_1_3_2_1_16_1","unstructured":"Rajendra K Jain Dah-Ming W Chiu William R Hawe etal 1984. A quantitative measure of fairness and discrimination. Eastern Research Laboratory Digital Equipment Corporation Hudson MA (1984).  Rajendra K Jain Dah-Ming W Chiu William R Hawe et al. 1984. A quantitative measure of fairness and discrimination. Eastern Research Laboratory Digital Equipment Corporation Hudson MA (1984)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1040.0091"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"F. P. Kelly A. Maulloo and D. Tan. 1998. Rate control for communication networks: shadow prices proportional fairness and stability. Journal of the Operational Research Society (1998) 237--252.  F. P. Kelly A. Maulloo and D. Tan. 1998. Rate control for communication networks: shadow prices proportional fairness and stability. Journal of the Operational Research Society (1998) 237--252.","DOI":"10.1057\/palgrave.jors.2600523"},{"key":"e_1_3_2_1_19_1","volume-title":"Internet Society Conference.","author":"Kurata Kenji","year":"2000","unstructured":"Kenji Kurata , Go Hasegawa , and Masayuki Murata . 2000 . Fairness Comparisons Between TCP Reno and TCP Vegas for Future Deployment of TCP Vegas. https:\/\/web.archive.org\/web\/20160103040648\/http:\/\/www.isoc.org\/inet2000\/cdproceedings\/2d\/2d_2.htm . In Internet Society Conference. Kenji Kurata, Go Hasegawa, and Masayuki Murata. 2000. Fairness Comparisons Between TCP Reno and TCP Vegas for Future Deployment of TCP Vegas. https:\/\/web.archive.org\/web\/20160103040648\/http:\/\/www.isoc.org\/inet2000\/cdproceedings\/2d\/2d_2.htm. In Internet Society Conference."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405891"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752178"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of NOSSDAV\u00e2\u0102Ź99","author":"Padhye Jitendra","year":"1999","unstructured":"Jitendra Padhye , Jim Kurose , Don Towsley , and Rajeev Koodli . 1999 . A model based TCP-friendly rate control protocol . In Proceedings of NOSSDAV\u00e2\u0102Ź99 . Citeseer. Jitendra Padhye, Jim Kurose, Don Towsley, and Rajeev Koodli. 1999. A model based TCP-friendly rate control protocol. In Proceedings of NOSSDAV\u00e2\u0102Ź99. Citeseer."},{"volume-title":"The mathematics of Internet congestion control","author":"Srikant Rayadurgam","key":"e_1_3_2_1_23_1","unstructured":"Rayadurgam Srikant . 2004. The mathematics of Internet congestion control . Springer Science & Business Media . Rayadurgam Srikant. 2004. The mathematics of Internet congestion control. Springer Science & Business Media."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.893885"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3365609.3365855"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355369.3355604"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.923938"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486020"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3152434.3152445"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341617.3326148"}],"event":{"name":"HotNets '21: The 20th ACM Workshop on Hot Topics in Networks","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Virtual Event United Kingdom","acronym":"HotNets '21"},"container-title":["Proceedings of the Twentieth ACM Workshop on Hot Topics in Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3484266.3487392","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3484266.3487392","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3484266.3487392","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3484266.3487392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:41Z","timestamp":1750191101000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3484266.3487392"}},"subtitle":["Safety and Utility in Multi-Agent Congestion Control"],"short-title":[],"issued":{"date-parts":[[2021,11,4]]},"references-count":29,"alternative-id":["10.1145\/3484266.3487392","10.1145\/3484266"],"URL":"https:\/\/doi.org\/10.1145\/3484266.3487392","relation":{},"subject":[],"published":{"date-parts":[[2021,11,4]]},"assertion":[{"value":"2021-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}