{"repository":{"description":"Implementing a polynomial-time algorithm for the Mooov Around problem with general preference. A program that takes as input the student preferences and determines whether there exists an allocation that is individually rational and strictly Pareto-e\u000Efficient","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":152,"owner":"garciafran","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Java","created_at":"2013-03-19T11:24:03-07:00","pushed_at":"2013-03-19T11:35:06-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Francisco Garcia","blog":"","location":"Austin, Texas","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/garciafran/Mooov-Around/compare/e583f9c720...0398a57c33"}