Probabilistic Serial

Last modification on

no description

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). [1]

See: demo

Reference

  1. Wikipedia contributors. Simultaneous eating algorithm. In: Wikipedia: The Free Encyclopedia [Internet]. FL: Wikimedia Foundation, Inc. [revised 2025 Jun 30, 04:17 UTC; cited 2025 Sep 04]. Available from: https://en.wikipedia.org/w/index.php?title=Simultaneous_eating_algorithm&oldid=1298039532