A Self-Enforcing Protocol to Solve Gerrymandering

In 2009, I wrote:

There are several ways two people can divide a piece of cake in half. One way is to find someone impartial to do it for them. This works, but it requires another person. Another way is for one person to divide the piece, and the other person to complain (to the police, a judge, or his parents) if he doesn’t think it’s fair. This also works, but still requires another person—­at least to resolve disputes. A third way is for one person to do the dividing, and for the other person to choose the half he wants.

The point is that unlike protocols that require a neutral third party to complete (arbitrated), or protocols that require that neutral third party to resolve disputes (adjudicated), self-enforcing protocols just work. Cut-and-choose works because neither side can cheat. And while the math can get really complicated, the idea …

Continue reading A Self-Enforcing Protocol to Solve Gerrymandering

Simulating Snakes and Ladders for Fun, Not Profit

A great many of you will remember the game of Snakes and Ladders from your youth. It’s a simple game, which one grows to realise involves absolutely no skill – it’s purely the luck of the dice. [Alex Laratro] noticed that without player decisions to effect the outcome, the game was thus a prime candidate for simulation. 

[Alex] wanted to dive into the question of “Who is winning a game of Snakes and Ladders?” at any given point in the gameplay. A common approach would be to state “whoever is in front”, but the ladders might have something to say …read more

Continue reading Simulating Snakes and Ladders for Fun, Not Profit