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: Tuesday, May 23, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Roger Wattenhofer

Online Matching

Consider an online gaming platform supporting two-player games such as Chess or Street Fighter 4. The platform tries to find a suitable opponent for each player, where all players arrive online. We want to minimize two criteria: (i) we want to match "similar" players, so that the game is challenging for both players; and (ii) the waiting time until a player is matched and can start playing should be as short as possible. It turns out that these two minimization criteria are often conflicting. To cope with this challenge, we must allow the platform to delay decisions.

This talk is based on the STOC 2016 paper "Haste Makes Waste", in collaboration with Yuval Emek and Shay Kutten. However, some technical parts are from a simplified analysis published at SODA 2017. Also: This is my second talk in the Mittagsseminar; my first talk was in 1997!

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