Commit | Line | Data |
---|---|---|
8c5ee850 | 1 | module PMDefaults where |
05a6f0ed | 2 | import PMInstance |
bc14b3b3 | 3 | import PMConfig |
8c5ee850 MM |
4 | |
5 | import qualified NaiveMinCostFlow | |
6 | import qualified CS2MinCostFlow | |
7 | ||
8 | pmDefaults = PMConfig { | |
fd0d2377 | 9 | |
93082682 | 10 | -- === Choose a min-cost flow implementation (timings on mattlaptop2) === |
fd0d2377 MM |
11 | |
12 | -- A naive implementation that is slow for all but the smallest instances | |
13 | -- (30s on a 20x50 example). | |
8c5ee850 | 14 | minCostFlow = NaiveMinCostFlow.minCostFlow, |
fd0d2377 MM |
15 | |
16 | -- Uses CS2 (http://www.igsystems.com/cs2/), which requires a license for | |
17 | -- non-research use but is faster (<1s on a 20x50 example, 64s on a 60x500 | |
59fcd59d MM |
18 | -- example). Configure the path to cs2.exe in CS2MinCostFlow.hs. Remember to |
19 | -- compile CS2 with -DPRINT_ANS, or this won't work! | |
8c5ee850 | 20 | --minCostFlow = CS2MinCostFlow.minCostFlow, |
d7d9561e | 21 | |
93082682 | 22 | -- The number of reviews each proposal should get. |
8c5ee850 | 23 | reviewsEachProposal = 3, |
2e7d5426 | 24 | |
93082682 MM |
25 | -- === Interpretation of the preference values === |
26 | ||
8c5ee850 MM |
27 | prefIsExpert = \p -> p <= 10, |
28 | prefIsKnowledgeable = \p -> p <= 20, | |
2e7d5426 | 29 | |
8c5ee850 MM |
30 | prefIsBoring = \p -> p > 15, |
31 | prefIsVeryBoring = \p -> p > 25, | |
2e7d5426 | 32 | |
8c5ee850 | 33 | prefIsConflict = \p -> p >= 40, |
d7d9561e | 34 | |
93082682 MM |
35 | -- === Tuning parameters for the matcher === |
36 | ||
37 | -- The number of reviews by which a reviewer's load may exceed his/her target | |
38 | -- load of (relativeLoad * ceiling(numProps * reviewsEachProposal / | |
39 | -- totalRelativeLoad)). For now this is an additive constant; perhaps it should | |
40 | -- be proportional to the target load. | |
8c5ee850 | 41 | loadTolerance = 1, |
d7d9561e | 42 | |
2e7d5426 MM |
43 | -- Cost to overload by one review. |
44 | -- tx = 0 at target load, 1 at end of tolerance. | |
8c5ee850 | 45 | marginalLoadCost = \tx -> 1000 + tx*1000, |
2e7d5426 MM |
46 | |
47 | -- Cost to review a boring (or very boring) proposal. | |
48 | -- lx = 0 at no load, 1 at target load. | |
8c5ee850 | 49 | marginalBoringCost = \lx -> 1000 + lx*1000, |
2e7d5426 | 50 | -- Additional cost to review a very boring proposal. |
8c5ee850 | 51 | marginalVeryBoringCost = \lx -> 1000 + lx*1000, |
2e7d5426 | 52 | |
93082682 | 53 | -- Cost to make a review. Used by the evaluator too. |
d7d9561e | 54 | -- I'm using quadratic cost functions as a first attempt. |
8c5ee850 | 55 | assignmentCost = \pref -> (numAsWt 10 + pref) ^ 2, |
2e7d5426 MM |
56 | |
57 | -- Bonus for a first knowledgeable or expert review. | |
8c5ee850 | 58 | knowledgeableBonus = 1000, |
2e7d5426 MM |
59 | |
60 | -- Bonus for an additional expert review. | |
8c5ee850 MM |
61 | expertBonus = 1000 |
62 | ||
63 | } |