A team of people are organizing who should do what. — A team of people organizing who should do which tasks. Image generated by DALL-E, and edited by me.

Applications/How it relates to EA

This article’s main application would be to help you decide whether you should:

Ask for help with a project you’re working on.
Ask someone else to do the project for you.
Allocate tasks across a team of people, whether it be for a school project, a new startup, or anything else.
Other things that I haven’t thought of. (If you do think of anything, please mention it in the comments.)

This ties to EA since many people in EA collaborate with and distribute work across co-workers, and since a key part of EA is trying to maximize good done, and one of the ways to do this is to choose the best person to do a given task.

Disclaimer

Although I do have a lot of experience in math, this article has not yet been thoroughly peer-reviewed yet (if you think you should peer-review it, please do.), and is subject to change. Do not take the things I say in this article at face value unless the stakes aren’t that high.

How Much More Valuable is Your Time, Compared to Others?

TL;DR

This article is about how to decide who does what. (e.g. Should you send an email to your co-worker, who works faster than you, but is much busier?)

To figure out who should do what, with the objective of increasing the amount of good done, we look at:

the expected amount of good done by person 1^[1] if person 1 does the task (a),

the expected amount of good done by person 2 if person 1 does the task (b),

the expected amount of good done by person 1 if person 2 does the task (c), and

the expected amount of good done by person 2 if person 2 does the task (d). (we only look at the amount of time where person 1 and 2 are affected by who does said task.)

Since the amount of good done (in the allotted time slot) if person 1 does the task is equal to $a + b$ , and the amount of good done (in the allotted time slot) if person 2 does the task is $c + d$ ,

person 1 does the task if:

$a + b > c + d .$

person 2 does the task if:

$a + b < c + d .$

It doesn’t matter who does the task if:

$a + b = c + d .$

Example and Details (Feel Free to Skip This Section)

Prerequisites

This article assumes that you know that $E [s o m e c o n s t a n t \cdot X]$ = $s o m e c o n s t a n t \cdot E [X]$ ^[2]

If you don’t know this, a simple proof is as follows:

for some random variable X, E(X) is what you’d expect X to be. ^[2]

Now, for some constant C, we just need to show that $E [c \cdot X] = c \cdot E [X]$ .

This can be shown by imagining that we randomly generate some value for X, which we’ll call ${^X}_{1}$ . Now, let’s multiply ${^X}_{1}$ by c. We’ll call this new variable ${˙ X}_{1}$ . Then, we’ll generate another value for X, which we’ll call ${^X}_{2}$ . Now, let’s multiply ${^X}_{2}$ by c. We’ll call this new variable ${˙ X}_{2}$ . We repeat this process a bunch of times.

We can then take the arithmetic mean of all the $˙ X$ ’s, resulting in $\frac{{˙ X}_{1} + {˙ X}_{2} + {˙ X}_{3} + . . . + {˙ X}_{n}}{n}$ , as $n$ trends towards infinity. By definition, this is $E [˙ X]$ .

Since we can rewrite each ${˙ X}_{i}$ as $c \cdot {^X}_{i}$ , we can rewrite $\frac{{˙ X}_{1} + {˙ X}_{2} + {˙ X}_{3} + . . . + {˙ X}_{n}}{n}$ as $\frac{c \cdot {^X}_{1} + c \cdot {^X}_{2} + c \cdot {^X}_{3} + . . . + c \cdot {^X}_{n}}{n}$ , and, since $a b + a c = a (b + c)$ , and $\frac{a \cdot b}{c} = a \cdot \frac{b}{c}$ , $\frac{c \cdot {^X}_{1} + c \cdot {^X}_{2} + c \cdot {^X}_{3} + . . . + c \cdot {^X}_{n}}{n} = \frac{c \cdot ({^X}_{1} + {^X}_{2} + {^X}_{3} + . . . + {^X}_{n})}{n} = c \cdot \frac{({^X}_{1} + {^X}_{2} + {^X}_{3} + . . . + {^X}_{n})}{n}$ .

and, since, if $a = b$ and $b = c$ , then $a = c$ , $\frac{{˙ X}_{1} + {˙ X}_{2} + {˙ X}_{3} + . . . + {˙ X}_{n}}{n} = c \cdot \frac{({^X}_{1} + {^X}_{2} + {^X}_{3} + . . . + {^X}_{n})}{n} .$

And, since, by definition, $\frac{{˙ X}_{1} + {˙ X}_{2} + {˙ X}_{3} + . . . + {˙ X}_{n}}{n} = E [˙ X] = E [c \cdot X]$ , and $\frac{({^X}_{1} + {^X}_{2} + {^X}_{3} + . . . + {^X}_{n})}{n} = E [X]$ .

And, since, if $a = b$ and $b = c$ , then $a = c$ , then:

$E [c \cdot X] = c \cdot E [X]$ .

Example/premise

For the sake of this example, let’s say you and your friend are running an ice cream stand. (Bare with me!)

Details:

It takes you:
1. ~~🍫1 seconds to make chocolate ice cream~~ you can’t make chocolate ice cream. (Which I’ll be referring to as 🍫 from now on) .
2. $🍦_{1}$ seconds to make vanilla ice cream (Which I’ll be referring to as 🍦 from now on),
3. and $🍓_{1}$ seconds to make strawberry ice cream (Which I’ll be referring to as 🍓 from now on).
It takes your friend:
1. $🍫_{2}$ seconds to make 🍫,
2. ~~🍦2 seconds to make 🍦~~ your friend can’t make 🍦.
3. and $🍓_{2}$ seconds to make 🍓.
The price of each flavor X can be expressed as 💵(X). (e.g., the price of 🍫 is 💵(🍫).)
When there’s a choice between serving someone who wants 🍓 and serving someone who wants 🍫OR^[3]🍦, for whatever reason^[4], they must choose 🍓.
All you and your friend care about is money.

Currently, you’re handling a large line of people who want 🍦, and your friend is handling a large line of people who want 🍫.

A group of $n$ people come in, saying they want 🍓.

The question is: should you serve the 🍓-ordering customers, or should your friend?

(From now on, I will write “serving the 🍓to the people who ordered 🍓” as “🟥”.

Your friend quickly puts together a table, showing the pros and cons of each option.

You serve 🍓(🟥)	Your freind serves 🍓^[5](🟥)
$n$ people get served 🍓in $🍓_{1}$ seconds, with a gain of $n \cdot E [💵 (🍓) \| 1]$ ^[6]^[7].	$n$ people get served 🍓in $🍓_{2}$ seconds, with a gain of $n \cdot E [💵 (🍓) \| 2]$ .
$n \cdot E [\frac{🍓_{1}}{🍦_{1}} \| 1]$ ^[2]^[8] customers who ordered 🍦 don’t get served^[9], leading to a loss of $n \cdot E [\frac{🍓_{1}}{🍦_{1}} \cdot 💵 (🍦) \| 1]$ .	$n \cdot E [\frac{🍓_{2}}{🍫_{2}} \| n]$ customers who ordered 🍫 don’t get served, leading to a loss of $n \cdot E [\frac{🍓_{2}}{🍫_{2}} \cdot 💵 (🍫) \| 2]$ .
Since you might make🍦more efficiently or less efficiently if you serve 🍓 or if your friend serves 🍓, I point out that you serve 🍦at an updated rate, $(🍦_{1} \| 1)$ . Therefore^[9], you can serve $E [(t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \| 1) \cdot (🍦_{1} \| 1)]$ ^[10]^[11], as supposed to $E [(t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \| 2) \cdot (🍦_{1} \| 2)]$ , if your friend serves 🍓. We can now express these two values in terms of 💵 by the following formulas: $E [(💵 (🍦) \| 1) \cdot (t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \| 1) \cdot (🍦_{1} \| 1)]$ , and $E [(💵 (🍦) \| 2) \cdot (t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \| 2) \cdot (🍦_{1} \| 2)]$ . Then, since $E [(A \| B)] = E [A \| B]$ , we can simplify these to $E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} \| 1]$ and $E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} \| 2]$ . We can then write the difference as $E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} \| 1]$ $- E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} \| 2]$ .	Similarly, for 🍫, we get: $E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} \| 2]$ $- E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} \| 2] .$
Total (Using BIDMAS^[12])
$n \cdot E [💵 (🍓) \| 1]$ $- n \cdot E [\frac{🍓_{1}}{🍦_{1}} \cdot 💵 (🍦) \| 1] +$ $E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} \| 1]$ $- E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} \| 2]$ .	$n \cdot E [💵 (🍓) \| 2] -$ $n \cdot E [\frac{🍓_{2}}{🍫_{2}} \cdot 💵 (🍫) \| 2]$ $+ E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} \| 2]$ $- E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} \| 2] .$

Now, we’ll simplify both of these formulas. Feel free to skip this part.

Simplifying

$n \cdot E [💵 (🍓) | 1]$ $- n \cdot E [\frac{🍓_{1}}{🍦_{1}} \cdot 💵 (🍦) | 1] +$ $E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} | 1]$ $- E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} | 2]$

$= n \cdot (E [💵 (🍓) | 1] - E [\frac{🍓_{1}}{🍦_{1}} \cdot 💵 (🍦) | 1]) +$ $E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} | 1]$ $- E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} | 2]$ .

$n \cdot E [💵 (🍓) | 2] -$ $n \cdot E [\frac{🍓_{2}}{🍫_{2}} \cdot 💵 (🍫) | 2]$ $+ E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} | 2]$

$- E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} | 2]$

$= n \cdot (E [💵 (🍓) | 2] - E [\frac{🍓_{2}}{🍫_{2}} \cdot 💵 (🍫) | 2])$ $+ E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} | 2]$

$- E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} | 2] .$

Final formula

You should 🟥 if

$n \cdot (E [💵 (🍓) | 1] - E [\frac{🍓_{1}}{🍦_{1}} \cdot 💵 (🍦) | 1]) +$ $E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} | 1]$ $- E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} | 2]$

^[13]>

$n \cdot (E [💵 (🍓) | 2] - E [\frac{🍓_{2}}{🍫_{2}} \cdot 💵 (🍫) | 2])$ $+ E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} | 2]$

$- E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} | 2] .$

Your friend should 🟥 if

$- E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} | 2] .$

It doesn’t matter who 🟥 if

$- E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} | 2] .$

Real-life interpretation

🍦= what you do on a day-to-day basis.

$🍦_{1}$ =the rate at which you complete tasks.

💵(🍦) = the amount of good done per task you complete.

🍫= what [the person who could do🍓instead of you] (2) does on a day-to-day basis.

$🍫_{2}$ = the rate at which (2) completes tasks.

💵(🍫) = the amount of good done per task (2) completes.

Serving🍓= 🟥= some task that you could do, but you’re considering having (2) do it instead.

$🍓_{1}$ =the rate at which you would do 🍓.

$🍓_{2}$ =the rate at which (2) would do 🍓.

(💵(🍓)|1) = the amount of good done if you do 🍓.

(💵(🍓)|2) = the amount of good done if (2) does 🍓.

$n$ = the amount of 🍓tasks (assuming each 🍓task is the same)

$t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦$ = time (in seconds) you spend working on 🍦AND^[14] being affected by who does🟥.

sidenotes

I just realized that the table doesn’t say anything about how person (2) doing 🟥 affects $🍦_{1}$ or 💵(🍦), but, since the formulas used all have a “|1” or “|2″, the formulas still account for this automatically. oops but not oops!
Similarly, there’s no mention of the negative side effects of 🟥, but (💵(🍓)|1) and (💵(🍓)|2) both account for this anyways.
If you’re deciding between who should do what with more than 2 people, just do Whoever is better (whoever is better (person 1, person 2), person 3), or whoever is better (Whoever is better (whoever is better (person 1, person 2)), person 3), person 4), and so on.

Closing statement

If you have any questions, comments, suggestions, corrections, or feedback, please feel free to put them in the comments!

Also, please don’t strong-downvote without telling me what I did wrong so I can fix it.

^
This includes the expected amount of good generated by them being happy or sad or productive or whatever you value.
^

(This is only true for the discrete case. In the continuous case, the formula is $\int_{- \infty}^{\infty} x \cdot P_{X} (x) d x$ But that’s a different topic.)
^
In this context, $a O R b$ is:
True if $a$ is True.
True if $b$ is True.
False if $a$ and $b$ is False.
^
Some reasons might be:
1. If they have to meet a daily quota for people who ordered 🍓 served.
2. If the price of 🍓 is bigger than the price of 🍫and 🍦.
^
The reason behind the claims on the right is the same as the reasons stated in the footnotes of the cell to the left. (i.e.,
Has reasoning behind its claims in the footnotes You are here
)
^
In this context, (B|A) = B, given A, and, more specifically, in this scenario, $E [💵 (🍓) | 1] = E [💵 (🍓)],$ given that $n$ people ordered 🍓, and you (1) do 🟥.
^
The reason we include a “|1” is because, in real life, instead of dealing with 💵(🍓), we often deal with things that vary depending on the number of beneficiaries
(such as how [QALYs of (placing malaria nets in a village) per malaria net] changes depending on what % of the village has malaria nets. (e.g., if there’s enough malaria nets to surround the outer parts of the village, (I think) less mosquitos will settle into the village than in a village whose nets only partly surround the village.)), and things that are dependent on who does them.
(such as how a statistician would be better at promoting EA than a worm.)
^
The reason for the number $n \cdot E [\frac{🍓_{1}}{🍦_{1}} | 1]$ is that it takes $n \cdot E [\frac{🍓_{1}}{t h e a m o u n t o f t i m e i n a s e c o n d, i n s e c o n d s} | 1]$ seconds for you to serve $n$ people who are ordering 🍓(i.e., [Time lost doing 🟥]), and if we change the unit of time from seconds to {the counterfactual number of people who are served 🍦}, (i.e., $🍦_{1}$ ), we get
{the counterfactual number of people who are served 🍦} = $E [n \cdot \frac{🍓_{1}}{🍦_{1}} | 1]$ , and, in this case, since $n$ is a known, non-random variable, $E [n \cdot \frac{🍓_{1}}{🍦_{1}} | 1] = n \cdot E [\frac{🍓_{1}}{🍦_{1}} | 1] .$
^
Here, we’re assuming that this is true to properly reflect how, in real life, if you don’t do some task (in this case, serving people who order 🍦) during some time slot (Time you spend serving people who order 🍦), you can never do said task.
Another reason we’re assuming this to be true is that, if we didn’t, there would be no consequences to serving people who ordered 🍓 first, regardless of whether you serve them or if your friend serves them. (since, in both cases, the same amount of money would be made ( $n \cdot 💵 (🍓) +$ the amount of money that comes from the large lines of people).)
^
By “Time, in seconds, you spend serving 🍦”, I mean “Time, in seconds, you spend serving 🍦and are affected by who does 🟥”. (the reason for this is because, if there’s some time you spend not affected by who does 🟥, then it doesn’t need to be accounted for.)
^
(Time, in seconds, you spend serving 🍦|1) = [Time, in seconds, you spend affected by who does 🟥] - [Time lost doing 🟥], and [Time lost doing 🟥] is established to be^[8] $E [n \cdot \frac{🍓_{1}}{🍦_{1}} | 1]$ ,
and (Time, in seconds, you spend serving 🍦|2) = Time, in seconds, you spend serving🍦and are affected by who does 🟥.
^
BEDMAS is an order of operations, and it stands for:
1. Brackets $(B)$
2. Expontentials $^{E}$
3. Multiplication and Division $\frac{D M}{M}$
4. Addition and Subtraction $A + - S = A - S$
Synonyms include:
BODMAS, PEDMAS, PEMDAS, BIDMAS, POMDAS, and PODMAS, as well as others.
I left a link to an explanation of what it means here.
^
Just to clarify, in real life, when there are multiple “🍓”s
(tasks that you’re considering having person 2 do),
(A|🍓) would be (A|the🍓task that this equation refers to, AND some combination of the allocation of different 🍓s.), and is not to be confused with (A|the🍓task that this equation refers to, all else being equal).
^
In this context, $a A N D b$ is:
True if $a$ is True at the same time as $b$ is True.
False otherwise.
^
Since, if $a b > a c$ , and a is a negative real number, $b < c$ ,
if $a > b$ , then $b < a$ , and
since we’re assuming $n$ is a positive real number (which is a valid assumption, since only a non-negative real integer amount of people can order 🍓, and $n$ isn’t equal to $0$ since, if it was, that would defeat the point of this example), $- n$ should be a negative number, so:
if $- n b > - n c$ , then $b < c$ , and
if $- n b < - n c$ , then $b > c$ .

You serve 🍓(🟥)	Your freind serves 🍓^[5](🟥)
$n$ people get served 🍓in $🍓_{1}$ seconds, with a gain of $n \cdot E [💵 (🍓) \| 1]$ ^[6]^[7].	$n$ people get served 🍓in $🍓_{2}$ seconds, with a gain of $n \cdot E [💵 (🍓) \| 2]$ .
$n \cdot E [\frac{🍓_{1}}{🍦_{1}} \| 1]$ ^[2]^[8] customers who ordered 🍦 don’t get served^[9], leading to a loss of $n \cdot E [\frac{🍓_{1}}{🍦_{1}} \cdot 💵 (🍦) \| 1]$ .	$n \cdot E [\frac{🍓_{2}}{🍫_{2}} \| n]$ customers who ordered 🍫 don’t get served, leading to a loss of $n \cdot E [\frac{🍓_{2}}{🍫_{2}} \cdot 💵 (🍫) \| 2]$ .
Since you might make🍦more efficiently or less efficiently if you serve 🍓 or if your friend serves 🍓, I point out that you serve 🍦at an updated rate, $(🍦_{1} \| 1)$ . Therefore^[9], you can serve $E [(t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \| 1) \cdot (🍦_{1} \| 1)]$ ^[10]^[11], as supposed to $E [(t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \| 2) \cdot (🍦_{1} \| 2)]$ , if your friend serves 🍓. We can now express these two values in terms of 💵 by the following formulas: $E [(💵 (🍦) \| 1) \cdot (t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \| 1) \cdot (🍦_{1} \| 1)]$ , and $E [(💵 (🍦) \| 2) \cdot (t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \| 2) \cdot (🍦_{1} \| 2)]$ . Then, since $E [(A \| B)] = E [A \| B]$ , we can simplify these to $E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} \| 1]$ and $E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} \| 2]$ . We can then write the difference as $E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} \| 1]$ $- E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} \| 2]$ .	Similarly, for 🍫, we get: $E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} \| 2]$ $- E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} \| 2] .$
Total (Using BIDMAS^[12])
$n \cdot E [💵 (🍓) \| 1]$ $- n \cdot E [\frac{🍓_{1}}{🍦_{1}} \cdot 💵 (🍦) \| 1] +$ $E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} \| 1]$ $- E [(💵 (🍦) \cdot t i m e (i n s e c o n d s) y o u s p e n d s e r v i n g 🍦 \cdot 🍦_{1} \| 2]$ .	$n \cdot E [💵 (🍓) \| 2] -$ $n \cdot E [\frac{🍓_{2}}{🍫_{2}} \cdot 💵 (🍫) \| 2]$ $+ E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} \| 2]$ $- E [(💵 (🍫) \cdot t i m e (i n s e c o n d s) y o u r f r i e n d s p e n d s s e r v i n g 🍫 \cdot 🍫_{2} \| 2] .$

Sorry, I’m Busy: The Math Behind Who Should Do What.

Applications/​How it relates to EA

Disclaimer

How Much More Valuable is Your Time, Compared to Others?

TL;DR

Example and Details (Feel Free to Skip This Section)

Prerequisites

Example/​premise

Simplifying

Final formula

Real-life interpretation

sidenotes

Closing statement

Applications/How it relates to EA

Example/premise