Title	Disproportionate division
Creator	Narayanan, Bhargav
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-09-04T11:20
Description	A finite number of people want to cut up a piece of cake amongst themselves `fairly'. How efficiently can they do this Almost everything is known in the case where each of the $N$ people want $1/N$ of the cake. On the other hand, the more general problem where each person wants an arbitrary real fraction of the cake is rather poorly understood. In this talk, we shall improve considerably on classical, decades-old arguments from algebraic topology and report on an efficient, combinatorial procedure for the general problem that yields nearly optimal bounds. Joint work with Logan Crew and Sophie Spirkl.
Extent	36.0 minutes
Subject	Mathematics; Combinatorics; Probability theory and stochastic processes
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Rutgers University
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2020-03-03
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0388840
URI	http://hdl.handle.net/2429/73668
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Researcher
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos