Institute for Logic, Language and Computation

20 February 2009, Computational Social Choice Seminar, Bart de Keijzer

Speaker: Bart de Keijzer
Title: Computational Complexity of Fair Resource Allocation
Date: Friday 20 February 2009
Time: 16:00
Location: Room P.327, Euclides Building, Plantage Muidergracht 24, Amsterdam


There exist a lot of situations where we have to allocate resources to agents in a way that is considered fair. In this talk, we concern ourselves with the complexity of computing such allocations. I will introduce some notions of fairness, and talk about the complexity of finding fair resource allocations under various constraints. In particular, I will discuss some new non-straightforward complexity results that were previously conjectured but had up until now not been found. I have written down their proofs in:

For more information, see or contact Ulle Endriss ().

The websites of the UvA make use of cookiesThis site uses cookies More informationMore info Hide this message XHide X