{"108011":{"#nid":"108011","#data":{"type":"event","title":"ARC Colloquium: Sebastian Lahaie, Yahoo! Research","body":[{"value":"\u003Cp\u003ETitle: A Kernel-Based Combinatorial Auction\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003EAbstract: \u003C\/strong\u003EIn this \u0026nbsp;talk \u0026nbsp;I present an iterative combinatorial auction that \u0026nbsp;offers modularity in the \u0026nbsp;choice of \u0026nbsp;price \u0026nbsp;structure, \u0026nbsp;drawing on \u0026nbsp;ideas \u0026nbsp;from kernel \u0026nbsp;methods and \u0026nbsp;the primal-dual paradigm of \u0026nbsp;auction design. \u0026nbsp;The \u0026nbsp;auction is able \u0026nbsp;to \u0026nbsp;automatically detect, \u0026nbsp;as\u0026nbsp; \u0026nbsp;the\u0026nbsp; \u0026nbsp;rounds \u0026nbsp;progress,\u0026nbsp; \u0026nbsp;whether \u0026nbsp;price\u0026nbsp;\u0026nbsp; \u0026nbsp;expressiveness\u0026nbsp; \u0026nbsp;must\u0026nbsp;\u0026nbsp; \u0026nbsp;be increased to \u0026nbsp;clear \u0026nbsp;the \u0026nbsp;market, and \u0026nbsp;converges to \u0026nbsp;a \u0026nbsp;sparse \u0026nbsp;representation of nonlinear clearing prices. \u0026nbsp;I show \u0026nbsp;that \u0026nbsp;by \u0026nbsp;introducing regularization the auction is able to compute approximate truth-inducing payments in just a single \u0026nbsp;run, in contrast to VCG payments which require as many \u0026nbsp;runs as there \u0026nbsp;are bidders. An empirical evaluation demonstrates the performance gains\u0026nbsp; that \u0026nbsp;can be obtained in \u0026nbsp;allocative efficiency, \u0026nbsp;revenue, \u0026nbsp;and \u0026nbsp;rounds to \u0026nbsp;convergence through various configurations of \u0026nbsp;the \u0026nbsp;auction design against \u0026nbsp;established linear-\u0026nbsp; \u0026nbsp;and \u0026nbsp;bundle- price \u0026nbsp;auctions.\u003C\/p\u003E\u003Cp\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/sebastien_lahaie_4_16_12_ga_2.pdf\u0022\u003EPoster [PDF]\u003C\/a\u003E\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"A Kernel-Based Combinatorial Auction"}],"uid":"27263","created_gmt":"2012-02-09 10:50:06","changed_gmt":"2016-10-08 01:58:00","author":"Elizabeth Ndongi","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2012-04-16T14:00:00-04:00","event_time_end":"2012-04-16T14:00:00-04:00","event_time_end_last":"2012-04-16T14:00:00-04:00","gmt_time_start":"2012-04-16 18:00:00","gmt_time_end":"2012-04-16 18:00:00","gmt_time_end_last":"2012-04-16 18:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"47223","name":"College of Computing"},{"id":"50875","name":"School of Computer Science"},{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003E\u003Ca href=\u0022mailto:ndongi@cc.gatech.edu\u0022\u003Endongi@cc.gatech.edu\u003C\/a\u003E\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}