[AI Seminar] ai-seminar-announce Digest, Vol 71, Issue 1

[Adams Wei Yu]

Just gentle reminder that the talk will be at tomorrow noon.

On Fri, Feb 3, 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 -- David Kurokawa -- February 7 (Adams Wei Yu)
>
>
> ----------------------------------------------------------------------
>
> Message: 1
> Date: Fri, 3 Feb 2017 05:41:29 -0500
> From: Adams Wei Yu <weiyu at cs.cmu.edu>
> To: ai-seminar-announce at cs.cmu.edu
> Subject: [AI Seminar] AI Lunch -- David Kurokawa -- February 7
> Message-ID:
>         <CABzq7eoxKD2DJhTC1vC717dj_5xKeTa02=1bYepnY8pvzaqf2A@
> mail.gmail.com>
> Content-Type: text/plain; charset="utf-8"
>
> Dear faculty and students,
>
> We look forward to seeing you Next Tuesday, February 7, 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, David Kurokawa <http://www.cs.cmu.edu/~dkurokaw/> will give a
> talk titled ?Fairness Notions in the Indivisible Good Setting: Comparisons
> and their Approximations?.
>
> *Abstract:*
>
> Fair division of indivisible goods is the study of allocating a set of
> discrete goods among several interested parties. Often in such settings a
> desired allocation is hoped to satisfy some notion of fairness.  In this
> talk we investigate several such notions studied in the literature: maximin
> share guarantee (MMS), pairwise maximin share guarantee (PMMS), and
> envy-freeness up to any good (EFX).
>
> We begin by first defining MMS and exploring the pros and cons of it as the
> benchmark for fairness in the setting. We then define PMMS and EFX and
> demonstrate their potential as answers to these shortcomings of MMS. We
> further demonstrate a hierarchical nature between these and relevant
> notions from the literature --- namely envy-freeness (EF) and envy-freeness
> up to one good (EF1) as well as give approximation existence results. We
> close by examining the age-old method of drafting (such as in American
> sports leagues) and show that there exist far fairer approaches to this
> problem.
>
> This is joint work with Ariel Procaccia and Junxing Wang.
> -------------- next part --------------
> An HTML attachment was scrubbed...
> URL: <http://mailman.srv.cs.cmu.edu/pipermail/ai-seminar-
> announce/attachments/20170203/86433b97/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 71, Issue 1
> **************************************************
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.srv.cs.cmu.edu/pipermail/ai-seminar-announce/attachments/20170206/bd038cc2/attachment.html>