Speed dating: an algorithmic case study involving matching and scheduling

Authors:
Bastian Katz;Ignaz Rutter;Ben Strasser;Dorothea Wagner
Affiliations:
Faculty of Informatics, Karlsruhe Institute of Technology, Germany;Faculty of Informatics, Karlsruhe Institute of Technology, Germany;Faculty of Informatics, Karlsruhe Institute of Technology, Germany;Faculty of Informatics, Karlsruhe Institute of Technology, Germany
Venue:
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Year:
2011

Citing 4
Cited 0

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Finding minimum-cost circulations by canceling negative cycles

Journal of the ACM (JACM)
A constructive proof of Vizing's Theorem

Information Processing Letters
An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we formalize and solve the speed dating problem. This problem arises in the context of speed dating events, where several people come together to date each other for a short time. For larger events of this type it is not possible to have each possible pair of persons meet. Instead, based on forms filled out by the participants, the organizer of such an event decides in advance, which pairs of people should meet and also schedules the times of their dates.Moreover, since people pay for participating in such events, aside from the overall quality of the dates, it is important to find a fair schedule, where people from the same group (e.g., all women) have a comparable number of dates. We model the organizer's problem for speed dating, study its complexity and design efficient algorithms for solving it. Finally, we present an experimental evaluation and show that our algorithms are indeed able to solve realistic problem instances within a reasonable time frame.