From 27cfb6d9d16437bd6831a15f6cec4eb52e05c580 Mon Sep 17 00:00:00 2001 From: jwarren-scottlogic Date: Mon, 4 Nov 2024 14:45:05 +0000 Subject: [PATCH] Correcting algorithm blog links --- _posts/2024-10-24-building-an-assignment-algorithm-1.markdown | 2 +- _posts/2024-11-04-building-an-assignment-algorithm-2.markdown | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/_posts/2024-10-24-building-an-assignment-algorithm-1.markdown b/_posts/2024-10-24-building-an-assignment-algorithm-1.markdown index 98884302e..a076bb4b7 100644 --- a/_posts/2024-10-24-building-an-assignment-algorithm-1.markdown +++ b/_posts/2024-10-24-building-an-assignment-algorithm-1.markdown @@ -180,4 +180,4 @@ The weight gives more emphasis to the surplus difference if a user’s current g ### What's next? -So you may be wondering, how do we define and measure compromise? And how can we do this over the course of multiple slots? These are good questions and will be answered in the next blog in the series. We’ll also get into the nitty gritty of the maths behind it all. Stay tuned! +So you may be wondering, how do we define and measure compromise? And how can we do this over the course of multiple slots? These are good questions and are covered in the [next blog in the series]({{site.baseurl}}/2024/11/04/building-an-assignment-algorithm-2.html). We’ll also get into the nitty gritty of the maths behind it all. Stay tuned! diff --git a/_posts/2024-11-04-building-an-assignment-algorithm-2.markdown b/_posts/2024-11-04-building-an-assignment-algorithm-2.markdown index bd864406a..9b686475e 100644 --- a/_posts/2024-11-04-building-an-assignment-algorithm-2.markdown +++ b/_posts/2024-11-04-building-an-assignment-algorithm-2.markdown @@ -68,7 +68,7 @@ author: jwarren -Last year, we were given the task to create a conference talk-assignment-algorithm, for our company’s internal conferences. In the [first blog]({{site.baseurl}}/2024/08/16/building-an-assignment-algorithm-1.html), we explored how to assign talks in a single time slot, which is really the bedrock of the algorithm. However, looking at the bigger picture, being fair across multiple time slots is also highly important. +Last year, we were given the task to create a conference talk-assignment-algorithm, for our company’s internal conferences. In the [first blog]({{site.baseurl}}/2024/10/24/building-an-assignment-algorithm-1.html), we explored how to assign talks in a single time slot, which is really the bedrock of the algorithm. However, looking at the bigger picture, being fair across multiple time slots is also highly important. We would not want the same attendees to always get their second choice, or worse still their third choice across multiple slots. Therefore, to be able to empirically measure this, we conceptualised the amount by which a single attendee has received different choices in the past as a value called “compromise”. For example, an attendee didn’t get their first choice, so they had to compromise with a second/third choice.