[AI Seminar] ai-seminar-announce Digest, Vol 70, Issue 3

[Adams Wei Yu]

This is a reminder that the talk will be noon TODAY, Jan 24.

On Sat, Jan 21, 2017 at 12:00 PM, <ai-seminar-announce-request at cs.cmu.edu>
wrote:

> Send ai-seminar-announce mailing list submissions to
>         ai-seminar-announce at cs.cmu.edu
>
> To subscribe or unsubscribe via the World Wide Web, visit
>         https://mailman.srv.cs.cmu.edu/mailman/listinfo/ai-
> seminar-announce
> or, via email, send a message with subject or body 'help' to
>         ai-seminar-announce-request at cs.cmu.edu
>
> You can reach the person managing the list at
>         ai-seminar-announce-owner at cs.cmu.edu
>
> When replying, please edit your Subject line so it is more specific
> than "Re: Contents of ai-seminar-announce digest..."
>
>
> Today's Topics:
>
>    1.  AI Lunch -- Hoda Heidari -- January 24 (Adams Wei Yu)
>
>
> ----------------------------------------------------------------------
>
> Message: 1
> Date: Fri, 20 Jan 2017 15:27:56 -0500
> From: Adams Wei Yu <weiyu at cs.cmu.edu>
> To: ai-seminar-announce at cs.cmu.edu
> Subject: [AI Seminar] AI Lunch -- Hoda Heidari -- January 24
> Message-ID:
>         <CABzq7epF2kMt9QhhDxL7=ucen2oXb7fab-ee74=n4pAROjb1PQ@
> mail.gmail.com>
> Content-Type: text/plain; charset="utf-8"
>
> Dear faculty and students,
>
> We look forward to seeing you Next Tuesday, January 24, at noon in NSH 3305
> for AI lunch. To learn more about the seminar and lunch, please visit
> the AI Lunch webpage <http://www.cs.cmu.edu/~aiseminar/>.
>
> On Tuesday, Hoda Heidari <http://www.seas.upenn.edu/~hoda/> from
>  University of Pennsylvania will give a talk titled ?Pricing a Low-regret
> Seller?.
>
> *Abstract:* As the number of ad exchanges has grown, publishers have turned
> to low regret learning algorithms to decide which exchange offers the best
> price for their inventory. This in turn opens the following question for
> the exchange: how to set prices to attract as many sellers as possible in
> order to maximize revenue. In this work, we formulate this precisely as a
> learning problem, and present algorithms showing that simply knowing the
> counterparty is using a low regret algorithm is enough for the exchange to
> have its own low regret learning algorithm for the optimal price.
>
> (Joint work with Mohammad Mahdian, Umar Syed, Sergei Vassilvistkii, and
> Sadra Yazdanbod. Appeared in ICML'16)
> -------------- next part --------------
> An HTML attachment was scrubbed...
> URL: <http://mailman.srv.cs.cmu.edu/pipermail/ai-seminar-
> announce/attachments/20170120/c4b09bcf/attachment-0001.html>
>
> ------------------------------
>
> Subject: Digest Footer
>
> _______________________________________________
> ai-seminar-announce mailing list
> ai-seminar-announce at cs.cmu.edu
> https://mailman.srv.cs.cmu.edu/mailman/listinfo/ai-seminar-announce
>
> ------------------------------
>
> End of ai-seminar-announce Digest, Vol 70, Issue 3
> **************************************************
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.srv.cs.cmu.edu/pipermail/ai-seminar-announce/attachments/20170124/686b8add/attachment.html>