Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, May 05, 2011, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Adarsh Amirtham
The study of fair division problems is concerned with finding ways to divide an object among several parties according to some notion of fairness. In this talk, we follow a paper by Francis E. Su on envy-free division. Sperner's lemma is used to prove that, under certain assumptions, any cake can be divided among $n$ people such that each person believes their piece to be at least as big as any other piece. A constructive proof of Sperner's lemma gives an algorithm to find an approximate solution.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login