Dating algorithms

That would determine whether they continue their relationship, and in what capacity.In a world where dating apps reign supreme, we’ve become increasingly lenient upon technology to implement algorithms for us to find partners — long-term or otherwise.The dynamic programming approach usually involves breaking the problem into subproblems in order to assess the various combinations of items in the knapsack; the values and weights are stored in a table over time.By the end, there is a matrix of values that will visually show the optimal solution.The stable roommate problem and Irving’s algorithm represent our dating culture.

She is also active in her church and community, being a frequent volunteer at local women’s shelters and soup kitchens.

She also keeps up with the news and is politically active, having previously worked for a local campaign.

She feels that opposites attract, and while she wouldn’t mind dating someone with similar interests, she doesn’t want to essentially date herself.

Below are examples of how these two common “problems” represent social interactions which, in turn, have algorithms we tend to follow as human beings.

In the “stable roommate problem”, a single set of people are attempting to find someone with whom to share a living space.


Leave a Reply