{"553001":{"#nid":"553001","#data":{"type":"event","title":"ARC Colloquium: Brendan Lucier (Microsoft Research)","body":[{"value":"\u003Cp style=\u0022color:maroon;\u0022\u003EVideo of this talk is available at: \u003Ca href=\u0022https:\/\/smartech.gatech.edu\/handle\/1853\/55928\u0022\u003Ehttps:\/\/smartech.gatech.edu\/handle\/1853\/55928\u003C\/a\u003E\u003C\/p\u003E\r\nFull collection of talk videos are available at:  \r\n\u003Ca href=\u0022https:\/\/smartech.gatech.edu\/handle\/1853\/46836\u0022\u003Ehttps:\/\/smartech.gatech.edu\/handle\/1853\/46836\u003C\/a\u003E\r\n\r\n\u003Cbr\u003E\r\n\u003Cbr\u003E\r\n\r\n\r\n\r\n\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003EAlgorithms \u0026amp; Randomness Center (ARC)\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003E\u003Ca href=\u0022http:\/\/research.microsoft.com\/en-us\/um\/people\/brlucier\/\u0022\u003EBrendan Lucier\u003C\/a\u003E \u0026ndash; Microsoft Research\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003EMonday, October 3, 2016\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003EKlaus 1116 East - 11:00 am\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003ETitle:\u003C\/strong\u003E\u003Cbr \/\u003E\r\nPrices, Auctions, and Combinatorial Prophet Inequalities\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EAbstract: \u003C\/strong\u003E\u003Cbr \/\u003E\r\nThe most common way to sell resources, from apples to business licenses to concert tickets, is to post prices. A choice of prices can be viewed as an algorithm for an online stochastic optimization problem, which makes decisions using value thresholds. This connection provides an opportunity to use the famous prophet inequality -- which describes the power of threshold rules -- to study pricing problems, and vice-versa. In this talk I\u0026#39;ll present a general framework for deriving new prophet inequalities using economic insights from pricing, with algorithmic applications. Along the way, I\u0026#39;ll describe an unexpected connection between posted prices and equilibria of non-truthful auctions.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EBased on joint works with Paul Duetting, Michal Feldman, Nick Gravin, and Thomas Kesselheim.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EBio: \u003C\/strong\u003E\u003Cbr \/\u003E\r\nBrendan Lucier is a Researcher at Microsoft Research, New England. Prior to joining Microsoft, he received his Ph.D. in Computer Science from the University of Toronto. His research interests lie in the intersection of theoretical Computer Science and Economics, and include algorithmic market design, algorithmic pricing, and social processes on networks. He is especially interested in the tradeoffs between simplicity, robustness, and optimality in markets for complex goods and services.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Ca href=\u0022http:\/\/research.microsoft.com\/en-us\/um\/people\/brlucier\/\u0022\u003ESpeaker\u0026#39;s webpage\u003C\/a\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Ca href=\u0022http:\/\/www.arc.gatech.edu\/hg\/item\/553001\u0022\u003ESeminar webpage\u003C\/a\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Ca href=\u0022http:\/\/arc.gatech.edu\/node\/114\u0022\u003EFall 2016 ARC Seminar Schedule\u003C\/a\u003E\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Prices, Auctions, and Combinatorial Prophet Inequalities (Klaus 1116 E at 11am)"}],"uid":"27466","created_gmt":"2016-07-15 07:55:08","changed_gmt":"2017-04-13 21:15:23","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2016-10-03T12:00:00-04:00","event_time_end":"2016-10-03T13:00:00-04:00","event_time_end_last":"2016-10-03T13:00:00-04:00","gmt_time_start":"2016-10-03 16:00:00","gmt_time_end":"2016-10-03 17:00:00","gmt_time_end_last":"2016-10-03 17:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"},{"id":"47223","name":"College of Computing"},{"id":"50875","name":"School of Computer Science"}],"categories":[],"keywords":[{"id":"111051","name":"Algorithm and Randomness Center"},{"id":"4265","name":"ARC"},{"id":"115001","name":"Computational Complexity"},{"id":"114991","name":"Computational Learning Theory"},{"id":"109","name":"Georgia Tech"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[{"id":"78761","name":"Faculty\/Staff"},{"id":"78771","name":"Public"},{"id":"78751","name":"Undergraduate students"},{"id":"174045","name":"Graduate students"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"Dani Denton \r\n","format":"plain_text"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}