Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Friday, March 22, 2013, 12:15 pm
Duration: 30 minutes
Location: CAB G11
Speaker: Jan Vondrak (IBM Almaden Research Center)
In the online welfare maximization problem, items arriving online should be allocated to n agents, in order to maximize their total happiness (welfare). Variants of the problem arise depending on the valuations functions, i.e. how the agents value different subsets of items. The simplest form of the problem is a bipartite matching problem where each agent would like to receive exactly one 1 item, one of its neighbors in a given bipartite graph. The greedy algorithm gives a 1/2-approximation for bipartite matching, and more generally for online welfare maximization, whenever the valuation functions are monotone submodular. In 1990, Karp, Vazirani & Vazirani showed that a careful randomization of the greedy algorithm gives an improved (1-1/e)-approximation for online bipartite matching. Recently, there has been a lot of work on extensions of this result, motivated by applications in online advertising such as Google Adwords. In this work, we show that no online algorithm (even randomized) gives approximation better than 1/2 for the class of "coverage valuations", a subclass of submodular valuations, hence proving the optimality of the greedy algorithm for both of these classes. We also provide some negative evidence for the class of budget-additive valuations which is of particular interest in applications. Joint work with Michael Kapralov and Ian Post.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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