[theory students] Slightly delayed: Theory Seminar at noon in CS 4310: Algorithms for fair division


Date: Wed, 23 Jan 2019 11:42:25 -0600
From: Shuchi Chawla <shuchi@xxxxxxxxxxx>
Subject: [theory students] Slightly delayed: Theory Seminar at noon in CS 4310: Algorithms for fair division
FYI, this seminar is slightly delayed. It will start at 12:15 and end at 1:15 today. The speaker is on a bus from Chicago that was scheduled to arrive early in the morning but got delayed due to the inclement weather. I will send out another announcement in case of further delays, but as of now I am quite certain that we will be able to start around 12:15.

Shuchi

On Wed, Jan 23, 2019 at 9:40 AM Shuchi Chawla <shuchi@xxxxxxxxxxx> wrote:
Just a reminder that this seminar is happening today at noon in CS 4310. Come and hear about how to fairly divide your rent among roommates!

(Please feel free to bring your lunch -- sadly there will be no cookies/coffee because of a scheduling error.)

Shuchi

On Tue, Jan 22, 2019 at 2:08 PM Shuchi Chawla <shuchi@xxxxxxxxxxx> wrote:
Hi all,

We will kick off the theory seminar this semester with a talk on fair division tomorrow. The speaker, Nidhi Rathi, is a Ph.D. student at IISc, Bangalore working with Siddharth Barman, whom some of you might remember as an alum who graduated from our department in 2012. The details of the seminar are below. See you all there.

Shuchi

Title:ÂFully Polynomial-Time Approximation Schemes for ÂFair Rent Division

Speaker: Nidhi Rathi, IISc, Bangalore, India

Location/time: CS 4310, January 23 12-1 pmÂ

Abstract:
We study the problem of fair rent division that entails splitting the rent and allocating the roomsÂof an apartment among roommates (agents) in a fair manner. In this setup, a distribution of the rentÂand an accompanying allocation is said to be fair if it is envy free, i.e., under the imposed rents, noÂagent has a strictly stronger preference for any other agentâs room. The cardinal preferences of theÂagents are expressed via functions which specify the utilities of the agents for the rooms for everyÂpossible room rent/price. While envy-free solutions are guaranteed to exist under reasonably generalÂutility functions, efficient algorithms for finding them were known only for quasilinear utilities. ThisÂwork addresses this notable gap and develops approximation algorithms for fair rent division withÂminimal assumptions on the utility functions. This is joint work with Eshwar Arunachaleswaran and Siddharth Barman, and appeared in SODA'19.



--


--
[← Prev in Thread] Current Thread [Next in Thread→]