Caution

Project paused: We failed to secure funding

Big thanks for helping us with our proof-of-concept! We teamed up with FsWInf @ TU Wien for some awesome events and got amazing feedback on our app.

Making speed dating paperless! 💌 🏃🏻💨

Click on one of the thumbnails below to check out the HackZürich2022 elevator pitch and our Youtube demo. Alternatively, we've also made some sleek UI mockups.

What is speed dating?

Speed dating doesn't happen online!

It is an organized social event in which participants have one-on-one conversations in person, which are typically limited to less than ten minutes, for the purpose of meeting people they would like to date or befriend.

Here's how it works: When you arrive at the event, a host will sign you up and you will receive a card with your name on it.

There will be two rows sitting in front of eachother at tables and one these rows will remain seated while the other one rotates about every 3-4 mins. Think of the dates as mini introductions.

You will use your card to mark down if you are interested in the people you meet.

After the event, each of the participants will give their cards to the host to process. The host will then contact each person individually and send them their matches' contact data.

Enough said. See what it's like to participate in such an event for yourself in this short demo.

How are we improving speed dating?

No more paperwork! With our app:

• the participants can focus on what matters most: making fun experiences and lasting relationships instead of fiddling around with paper. Also they don't have to wait days until their matches get evaluated by the host anymore.

• the event hosts no longer have to print any cards, use a clock to time the dates or spend countless hours after the events determining the matches and contacting the participants.

Evaluating the matches is very time consuming and is the most expensive part of throwing these events.

How expensive? Let's do the math!

Let's assume that we have $n$ participants, split into two groups. For example, 40 participants in total, of which there are 20 in each group. Each participant speed-dates everyone from the other group and fills out their cards as they go along. This gives you $(n)$ 40 cards, each with $(\frac{n}{2})$ 20 reviews.

Now, when going through a single card, the host will check if the participant liked the other one. If yes, time to search for their card, and check if they also liked our participant. Then we need somewhere between 0 and $(\frac{n}{2})$ 20 card comparisons to determine the matches for a single person. And finally, for each match, all the contact information needs to be manually noted down, and sent to our participant.

Repeat this for every single of the $(n)$ 40 participants, and you have at most $(n \cdot \frac{n}{2})$ 800 card comparisons to determine all the matches.

Now assuming that we do this as efficient as possible by iterating through each date that happened at the event once instead of twice from both sides (in the description above we iterated through the people, not the dates) we still have $((\frac{n}{2})^2)$ comparisons - in our example this would mean the host has to do 400 comparisons for just 40 participants which is still very time consuming.

But we also have the option to disable groups altogether which enables all participants to date each other.
In this case the number of comparisons would be a lot higher. If iterating by people we would require $(n \cdot (n-1))$ 1560 comparisons and if iterating by dates we would require a grand total of $({\sum}_{i = 0}^{n-1}i = \frac{n(n+1)}{2} - n)$ 740 comparisons.