Algorithm: LeximinPrimal — a fair allocation algorithm that maximizes the minimum satisfaction across agents.
Based on: "Leximin Allocations in the Real World" by Kurokawa, Procaccia, and Shah (2018).
📄 Read the paper
Programmer: Lior Trachtman
Instructions:
1. Enter the number of agents and define each agent’s capacity.
2. Proceed to facilities and define the number of items (facilities) and their capacities.
3. Enter each agent’s valuation for the available facilities. Make sure no valuation exceeds the agent’s own capacity.
4. Click "▶ Run Algorithm" to execute the LeximinPrimal algorithm and view the allocation distribution.
5. Use "▶ Load Example" to quickly fill in sample input.
6. Use "▶ Generate Random Input" to automatically generate a random instance (agents, facilities, valuations) for quick testing.
7. Use "▶ Run Tests" to verify algorithm correctness against built-in test cases.