<node id="623388">
  <nid>623388</nid>
  <type>event</type>
  <uid>
    <user id="27544"><![CDATA[27544]]></user>
  </uid>
  <created>1563217749</created>
  <changed>1569450193</changed>
  <title><![CDATA[ARC/ACO Alumni Colloquium: Nikhil Devanur (Amazon)]]></title>
  <body><![CDATA[<p align = "center"><strong>ARC/ACO Alumni Colloquium</strong></p>

<p align = "center"><strong>Nikhil Devanur (Amazon)</strong></p>

<p align = "center"><strong>Monday, September 30, 2019</strong></p>

<p align = "center"><strong>Klaus 1116 East- 11:00 am</strong></p>

<p>&nbsp;</p>

<p><strong>Title:&nbsp; </strong>Lagrangian Duality in Mechanism Design</p>

<p><strong>Abstract:&nbsp; </strong>This talk surveys the usage of Lagrangian Duality in the design and analysis of auctions.&nbsp;Designing optimal (revenue maximizing) auctions in multi-parameter settings has been among the most active areas in algorithmic mechanism design in the last few years. We have discovered that Lagrangian duality is a very useful and versatile tool for this purpose. It has been used to do all of the following.</p>

<p>1. Derive that the optimal auction is a virtual welfare maximizer.</p>

<p>2. Obtain a fast algorithm for approximating the optimal auction.</p>

<p>3. Show how simple auctions are approximately optimal.</p>

<p>4. Characterize optimal auctions for structured environments.</p>

<p>5. Get bounds on the menu-size complexity of optimal auctions.</p>

<p>I will survey these applications and dive deeper into a subset of these.</p>

<p>----------------------------------</p>

<p><a href="https://www.nikhildevanur.com/">Speaker&#39;s Webpage</a></p>

<p><em>Videos of recent talks are available at: </em><a href="https://smartech.gatech.edu/handle/1853/46836"><em>https://smartech.gatech.edu/handle/1853/46836</em></a></p>

<p><a href="https://mailman.cc.gatech.edu/mailman/listinfo/arc-colloq"><em>Click here to subscribe to the seminar email list: arc-colloq@Klauscc.gatech.edu </em></a></p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Lagrangian Duality in Mechanism Design - Klaus 1116 East at 11am]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2019-09-30T12:00:00-04:00]]></value>
      <value2><![CDATA[2019-09-30T13:00:00-04:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Faculty/Staff]]></value>
      </item>
          <item>
        <value><![CDATA[Postdoc]]></value>
      </item>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
          <item>
        <value><![CDATA[Graduate students]]></value>
      </item>
          <item>
        <value><![CDATA[Undergraduate students]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>70263</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[ARC]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1795</tid>
        <value><![CDATA[Seminar/Lecture/Colloquium]]></value>
      </item>
      </field_categories>
  <field_keywords>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
