Programmers:
- Daniel Gilkarov
- Benjamin Saldman
For our undergraduate project and as part of the Research Algorithms course we implemented algorithms for finding envy free matchings in graphs in the networkx open source project.
Two versions of the algorithm were implemented:
You can also read the article that contains the algorithms we implemented here
