Banach-Knaster Last-Diminisher

N Players Discrete $O(n^2)$ RW Queries

Overview

The Banach-Knaster procedure guarantees each of n participants receives at least 1/n of a divisible good according to their own valuation, operating through rounds where players can trim a proposed piece to their desired share, with the last person to make a trim receiving that piece.

Read more →

Algorithm Flowchart

Fairness Properties

Banach and Knaster's procedure satisfies one fairness property:

Proportionality

Both players receive at least 50% of their subjective valuation of the resource.