{"id":184433,"date":"2004-07-21T00:00:00","date_gmt":"2009-10-31T13:44:57","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/msr-research-item\/online-auctions-strategyproofness-and-random-valuations\/"},"modified":"2018-07-19T09:01:51","modified_gmt":"2018-07-19T16:01:51","slug":"online-auctions-strategyproofness-and-random-valuations","status":"publish","type":"msr-video","link":"https:\/\/www.microsoft.com\/en-us\/research\/video\/online-auctions-strategyproofness-and-random-valuations\/","title":{"rendered":"Online Auctions, Strategyproofness and Random Valuations"},"content":{"rendered":"<div class=\"asset-content\">\n<p>We discuss the limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically, from a theoretical point of view and show how Economics, Scheduling theory, Probability theory and finally Graph theory have a nice intersection in this area. First we present a background on recent work in this area. Then we consider the notion of value- and time-strategyproofness (truthfulness) and show for the k=1 problem we have a strategyproof variant on the classic Secretary&#8217;s problem. Next, we consider the case in which we have re-usable goods and present the relation to finding a maximum weight matching in bipartite graphs or more generally scheduling theory. During the talk we present several algorithms which are constant competitive for revenue and\/or efficiency (we define these simple terms in the talk).<\/p>\n<p>This talk is from two papers joint work with Mohammad Mahdian, Robert Kleinberg and David Parkes.<\/p>\n<\/div>\n<p><!-- .asset-content --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>We discuss the limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically, from a theoretical point of view and show how Economics, Scheduling theory, Probability theory and finally Graph theory have a nice intersection in this area. First we present a background on recent work [&hellip;]<\/p>\n","protected":false},"featured_media":289916,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"footnotes":""},"research-area":[13558],"msr-video-type":[],"msr-locale":[268875],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-184433","msr-video","type-msr-video","status-publish","has-post-thumbnail","hentry","msr-research-area-security-privacy-cryptography","msr-locale-en_us"],"msr_download_urls":"","msr_external_url":"https:\/\/youtu.be\/k6hjRat97HE","msr_secondary_video_url":"","msr_video_file":"","_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/184433"}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-video"}],"version-history":[{"count":1,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/184433\/revisions"}],"predecessor-version":[{"id":496199,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/184433\/revisions\/496199"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/289916"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=184433"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=184433"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=184433"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=184433"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=184433"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=184433"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}