Probabilistic Serial

A simultaneous eating algorithm (SE) is an algorithm for allocating divisible objects among agents with ordinal preferences. If all agents are given the same eating speed, then the SE allocation satisfies SD-envy-freeness. This particular variant of SE is called the Probabilistic Serial rule (PS).

How to use:

1. Set the number of agents
2. Click "Shuffle" to randomize preferences
3. Click "Calculate" to compute the fair allocation
4. Use "Randomize" to explore different seed assignments

What it does: This algorithm fairly divides resources among people with different preferences. Each agent "eats" their preferred items simultaneously at the same rate. The result is a provably envy-free allocation where no one would prefer anyone else's bundle.

Used in school choice, course allocation, and other matching markets where fairness is critical.