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: Monday, June 15, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Annamalai Chidambaram (EPF Lausanne)

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

We study the basic allocation problem of assigning resources to players so as to maximize fairness. In this problem each resource has a value and can be assigned only to an item-dependent subset of players. The goal is to obtain an allocation that maximizes the minimum value a player receives where player valuations are additive. We design a constant factor approximation algorithm for this problem. Our approach develops a local search technique introduced by Haxell for hypergraph matchings, and later used in this context by Asadpour, Feige, and Saberi. Besides the improved approximation guarantee, the highlight of our approach is that it is purely combinatorial.

This is joint work with Christos Kalaitzis and Ola Svensson.

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