| 1 | module PMDefaults where |
| 2 | import PMInstance |
| 3 | import ProposalMatcher |
| 4 | |
| 5 | import qualified NaiveMinCostFlow |
| 6 | import qualified CS2MinCostFlow |
| 7 | |
| 8 | pmDefaults = PMConfig { |
| 9 | |
| 10 | -- Choose a min-cost flow implementation (timings on mattlaptop2): |
| 11 | |
| 12 | -- A naive implementation that is slow for all but the smallest instances |
| 13 | -- (30s on a 20x50 example). |
| 14 | minCostFlow = NaiveMinCostFlow.minCostFlow, |
| 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 |
| 18 | -- example). Configure the path to cs2.exe in CS2MinCostFlow.hs. |
| 19 | --minCostFlow = CS2MinCostFlow.minCostFlow, |
| 20 | |
| 21 | reviewsEachProposal = 3, |
| 22 | |
| 23 | prefIsExpert = \p -> p <= 10, |
| 24 | prefIsKnowledgeable = \p -> p <= 20, |
| 25 | |
| 26 | prefIsBoring = \p -> p > 15, |
| 27 | prefIsVeryBoring = \p -> p > 25, |
| 28 | |
| 29 | prefIsConflict = \p -> p >= 40, |
| 30 | |
| 31 | -- For now this is absolute. Later it might be proportional to a reviewer's |
| 32 | -- target load. |
| 33 | loadTolerance = 1, |
| 34 | |
| 35 | -- Cost to overload by one review. |
| 36 | -- tx = 0 at target load, 1 at end of tolerance. |
| 37 | marginalLoadCost = \tx -> 1000 + tx*1000, |
| 38 | |
| 39 | -- Cost to review a boring (or very boring) proposal. |
| 40 | -- lx = 0 at no load, 1 at target load. |
| 41 | marginalBoringCost = \lx -> 1000 + lx*1000, |
| 42 | -- Additional cost to review a very boring proposal. |
| 43 | marginalVeryBoringCost = \lx -> 1000 + lx*1000, |
| 44 | |
| 45 | -- Cost to make a review. |
| 46 | -- I'm using quadratic cost functions as a first attempt. |
| 47 | assignmentCost = \pref -> (numAsWt 10 + pref) ^ 2, |
| 48 | |
| 49 | -- Bonus for a first knowledgeable or expert review. |
| 50 | knowledgeableBonus = 1000, |
| 51 | |
| 52 | -- Bonus for an additional expert review. |
| 53 | expertBonus = 1000 |
| 54 | |
| 55 | } |