About

Author

Sapir Dahan
M.Sc. student in Computer Science at Ariel University.

This project was created as part of the course Programming Research Algorithms, taught by Prof. Erel Segal-Halevi at Ariel University.

Arpita Biswas and Siddharth Barman.
"Fair Division Under Cardinality Constraints"
Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), 2018.

Algorithm 1 — EF1 allocation under cardinality constraints. Outer loop over categories: greedy round-robin → envy-cycle elimination → topological sort.
Algorithm 2 — Greedy Round-Robin for a single category. Agents pick in order, each greedily choosing the highest-valued remaining item.

Both algorithms are contributed to fairpyx and used by this web app directly from the library.