memes

What's funny is that you've actually stumbled onto an entire problem that's studied quite heavily. I remembered a Numberphile video about this. The problem is called "envy-free cake splitting". It's pretty straightforward. A split is envy-free if no one believes someone else got more than them. For three people this was figured out in 1960 and you can read about it here. It has been solved for N participants as well and you can read about the general problem here.

For two people, it's obvious. One splits and one chooses. The first person is incentivized to make it even because they don't know which they'll get.

I was going to give a summary of the process for three people but it's too much to explain succinctly. Just check the article I posted lol.