Skip to content

Commit

Permalink
Correcting algorithm blog links
Browse files Browse the repository at this point in the history
  • Loading branch information
jwarren-scottlogic authored and chriswilty committed Nov 4, 2024
1 parent e4d321d commit 27cfb6d
Show file tree
Hide file tree
Showing 2 changed files with 2 additions and 2 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -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!
Original file line number Diff line number Diff line change
Expand Up @@ -68,7 +68,7 @@ author: jwarren
</script>


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.

Expand Down

0 comments on commit 27cfb6d

Please sign in to comment.