Title: One Dollar Each Eliminates EnvySpeaker: Vishnu V. Narayan Affiliation: McGill University Zoom: Contact Sharat Ibrahimpur
We study the fair division of a collection of $m$ indivisible goods amongst a set of $n$ agents. Whilst envy-free allocations typically do not exist in the indivisible goods setting, envy-freeness can be achieved if some amount of a divisible good (money) is introduced.
Title: Halting Time is Predictable for Large Models: A Universality Property and Average-case AnalysisSpeaker: Courtney Paquette Affiliation: University of Waterloo Zoom: Please email Emma Watson
Average-case analysis computes the complexity of an algorithm averaged over all possible inputs. Compared to worst-case analysis, it is more representative of the typical behavior of an algorithm, but remains largely unexplored in optimization. One difficulty is that the analysis can depend on the probability distribution of the inputs to the model.