{"id":713476,"date":"2020-12-18T13:17:44","date_gmt":"2020-12-18T21:17:44","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-event&p=713476"},"modified":"2025-08-06T11:52:07","modified_gmt":"2025-08-06T18:52:07","slug":"soda-2021","status":"publish","type":"msr-event","link":"https:\/\/www.microsoft.com\/en-us\/research\/event\/soda-2021\/","title":{"rendered":"Microsoft at SODA 2021"},"content":{"rendered":"\n\n

Website:<\/strong> SODA 21 (opens in new tab)<\/span><\/a>Opens in a new tab<\/span><\/p>\n

Microsoft is proud to be a sponsor of the ACM-SIAM Symposium on Discrete Algorithms (SODA 21) (opens in new tab)<\/span><\/a>. See more details on our contributions below.<\/p>\n

All times are displayed in Eastern Time (UTC-05:00)<\/em><\/p>\n

Monday, January 11<\/h2>\n

2:30 PM \u2013 3:30 PM | Session 5B
\nBeating Greedy for Approximating Reserve Prices in Multi-Unit VCG Auctions<\/strong>
\nMahsa Derakhshan, Alex Slivkins<\/a>, David Pennock<\/p>\n

Tuesday, January 12<\/h2>\n

4:00 PM \u2013 5:00 PM | Session 9A
\nOnline Multiserver Convex Chasing and Optimization<\/strong>
\nMark Sellke, S\u00e9bastien Bubeck<\/a>, Yuval Rabani<\/p>\n

Wednesday, January 13<\/h2>\n

4:00 PM \u2013 5:00 PM | Session 12C
\nScheduling with Communication Delays via Lp Hierarchies and Clustering Ii: Weighted Completion Times on Related Machines<\/strong>
\nSami Davies, Janardhan Kulkarni<\/a>, Thomas Rothvoss, Jakub Tarnawski<\/a>, Yihao ZhangOpens in a new tab<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

Microsoft is proud to be a sponsor of the ACM-SIAM Symposium on Discrete Algorithms (SODA 21).<\/p>\n","protected":false},"featured_media":0,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr_startdate":"2021-01-10","msr_enddate":"2021-01-13","msr_location":"Virtual","msr_expirationdate":"","msr_event_recording_link":"","msr_event_link":"","msr_event_link_redirect":false,"msr_event_time":"","msr_hide_region":false,"msr_private_event":false,"msr_hide_image_in_river":0,"footnotes":""},"research-area":[13561,13546],"msr-region":[256048],"msr-event-type":[197941],"msr-video-type":[],"msr-locale":[268875],"msr-program-audience":[],"msr-post-option":[],"msr-impact-theme":[],"class_list":["post-713476","msr-event","type-msr-event","status-publish","hentry","msr-research-area-algorithms","msr-research-area-computational-sciences-mathematics","msr-region-global","msr-event-type-conferences","msr-locale-en_us"],"msr_about":"\n\n

Website:<\/strong> SODA 21 (opens in new tab)<\/span><\/a>Opens in a new tab<\/span><\/p>\n

Microsoft is proud to be a sponsor of the ACM-SIAM Symposium on Discrete Algorithms (SODA 21)<\/a>. See more details on our contributions below.<\/p>\n

All times are displayed in Eastern Time (UTC-05:00)<\/em><\/p>\n

Monday, January 11<\/h2>\n

2:30 PM \u2013 3:30 PM | Session 5B
\nBeating Greedy for Approximating Reserve Prices in Multi-Unit VCG Auctions<\/strong>
\nMahsa Derakhshan, Alex Slivkins<\/a>, David Pennock<\/p>\n

Tuesday, January 12<\/h2>\n

4:00 PM \u2013 5:00 PM | Session 9A
\nOnline Multiserver Convex Chasing and Optimization<\/strong>
\nMark Sellke, S\u00e9bastien Bubeck<\/a>, Yuval Rabani<\/p>\n

Wednesday, January 13<\/h2>\n

4:00 PM \u2013 5:00 PM | Session 12C
\nScheduling with Communication Delays via Lp Hierarchies and Clustering Ii: Weighted Completion Times on Related Machines<\/strong>
\nSami Davies, Janardhan Kulkarni<\/a>, Thomas Rothvoss, Jakub Tarnawski<\/a>, Yihao ZhangOpens in a new tab<\/span><\/p>\n","tab-content":[{"id":0,"name":"About","content":"Microsoft is proud to be a sponsor of the ACM-SIAM Symposium on Discrete Algorithms (SODA 21)<\/a>. See more details on our contributions below.\r\n\r\nAll times are displayed in Eastern Time (UTC-05:00)<\/em>\r\n

Monday, January 11<\/h2>\r\n2:30 PM \u2013 3:30 PM | Session 5B\r\nBeating Greedy for Approximating Reserve Prices in Multi-Unit VCG Auctions<\/strong>\r\nMahsa Derakhshan, Alex Slivkins<\/a>, David Pennock\r\n

Tuesday, January 12<\/h2>\r\n4:00 PM \u2013 5:00 PM | Session 9A\r\nOnline Multiserver Convex Chasing and Optimization<\/strong>\r\nMark Sellke, S\u00e9bastien Bubeck<\/a>, Yuval Rabani\r\n

Wednesday, January 13<\/h2>\r\n4:00 PM \u2013 5:00 PM | Session 12C\r\nScheduling with Communication Delays via Lp Hierarchies and Clustering Ii: Weighted Completion Times on Related Machines<\/strong>\r\nSami Davies, Janardhan Kulkarni<\/a>, Thomas Rothvoss, Jakub Tarnawski<\/a>, Yihao Zhang"}],"msr_startdate":"2021-01-10","msr_enddate":"2021-01-13","msr_event_time":"","msr_location":"Virtual","msr_event_link":"","msr_event_recording_link":"","msr_startdate_formatted":"January 10, 2021","msr_register_text":"Watch now","msr_cta_link":"","msr_cta_text":"","msr_cta_bi_name":"","featured_image_thumbnail":null,"event_excerpt":"Microsoft is proud to be a sponsor of the ACM-SIAM Symposium on Discrete Algorithms (SODA 21).","msr_research_lab":[],"related-researchers":[],"msr_impact_theme":[],"related-academic-programs":[],"related-groups":[],"related-projects":[],"related-opportunities":[],"related-publications":[],"related-videos":[],"related-posts":[],"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/713476","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-event"}],"version-history":[{"count":3,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/713476\/revisions"}],"predecessor-version":[{"id":1146911,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/713476\/revisions\/1146911"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=713476"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=713476"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=713476"},{"taxonomy":"msr-event-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event-type?post=713476"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=713476"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=713476"},{"taxonomy":"msr-program-audience","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-program-audience?post=713476"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=713476"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=713476"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}