Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, November 23, 2023, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Patrick Schnider

Cutting cookies: bisections with similar copies

Imagine you have a dough consisting of three ingredients. You want to distribute this fairly with your friend, meaning that both of you should get exactly half of each ingredient. The dough is flexible in the sense that you can scale, rotate and flip it, but the only cutting device you have at hand is a cookie cutter. Can you always find a scaling of the dough such that you can divide it fairly using the cookie cutter? Previously, it was known that the answer is yes if the cookie cutter has the shape of the circle. In this talk I will show that you can do this for a much larger class of cookie cutter shapes. This talk is based on joint work with Pablo Soberon.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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