Pablo Soberon, Baruch College, City University of New York

Abstract

In fair partition results, we aim to distribute resources among several competing players.  One family of problems, known as mass partition problems, studies scenarios where we can guarantee that every player agrees that the value of each part is the same.  Another type of results are envy-free partitions, in which each player agrees that they received the best part according to their subjective preferences.  Envy-free partitions are well studied in dimension 1, and often allow us to satisfy more players than those in mass partition results.  In this talk, we discuss common generalizations to both types of results.  We focus on partitions in R^2 with few lines, and partitions in R^d into convex parts. 

See: https://sites.google.com/view/rutgersdmseminar