Skip to content

Commit

Permalink
more styling adjustents
Browse files Browse the repository at this point in the history
  • Loading branch information
jwarren-scottlogic committed Oct 29, 2024
1 parent 341e938 commit 8dd4ed7
Showing 1 changed file with 4 additions and 3 deletions.
7 changes: 4 additions & 3 deletions _posts/2024-10-21-building-an-assignment-algorithm-2.markdown
Original file line number Diff line number Diff line change
Expand Up @@ -156,10 +156,11 @@ Finally, we landed on using the Z-score for aggregate compromise. The Z-score is
<details class="no-italic"><summary>Click the 'more' button for to see how we compared compromise and surplus difference exactly, along with the rationale.</summary>
<br>
<br>
The value which we use to score attendees can be calculated as:
The value which we use to sort attendees can be calculated as:
\[
\begin{align}
\text{sorting score} \quad = \quad &\text{standardisedSurplusScore} \\
\text{sorting score} \quad = \quad \;
&\text{standardisedSurplusScore} \\
-\; &\text{standardisedCompromiseScore}
\end{align}
\]
Expand All @@ -171,7 +172,7 @@ The value which we use to score attendees can be calculated as:

\[
\begin{align}
standardisedCompromiseScore \quad = \quad
standardisedCompromiseScore \quad = \quad \;
&\left( \frac{\text{mean surplus difference}}{\text{max surplus}} \right) \\ \\
\times &\left( \frac{\text{attendee Z score}}{2.72} \right)^3
\end{align}
Expand Down

0 comments on commit 8dd4ed7

Please sign in to comment.