1 Proposal matcher implementation
3 By Matt McCutchen <matt@mattmccutchen.net>
4 in collaboration with Samir Khuller <samir@cs.umd.edu>
6 TODO: There is probably more to say here about the program, even after we add
7 the paper about the algorithm/reduction.
18 Interactive experimentation
19 ---------------------------
21 "./run" starts GHCi with all of the important definitions of the proposal
22 matcher in scope. This is good for interactive experimentation.
27 ./match is a front-end that reads an instance from stdin and prints the matching
30 <<< FIXME: Adapt the following for popl2012 branch >>>
31 Input: A tab-separated array with one column per reviewer. The first row gives
32 the relative loads of the reviewers. Thereafter, each row gives the preference
33 values (1 to 39, 40 = conflict of interest) of all reviewers for a single
34 proposal. See the example.in.
36 Reviewers and proposals are numbered from 0 in the order they appear in the
39 Output: A tab-separated array. Each row gives the reviewer number and proposal
40 number of a matched pair.