Paper: Remove "NOT YET" on URL in preparation for release.

[match/match.git] / program / PMDefaults.hs

diff --git a/program/PMDefaults.hs b/program/PMDefaults.hs
index aa68aac..3504e06 100644 (file)
--- a/program/PMDefaults.hs
+++ b/program/PMDefaults.hs
@@ -5,6 +5,7 @@ import PMConfig
 import qualified NaiveMinCostFlow
 import qualified CS2MinCostFlow
 
+-- A default set of configuration values; see module PMConfig.
 pmDefaults = PMConfig {
 
 -- === Choose a min-cost flow implementation (timings on mattlaptop2) ===
@@ -52,12 +53,28 @@ marginalVeryBoringCost = \lx -> 1000 + lx*1000,
 
 -- Cost to make a review.  Used by the evaluator too.
 -- I'm using quadratic cost functions as a first attempt.
-assignmentCost = \pref -> (numAsWt 10 + pref) ^ 2,
+assignmentCost = \pref -> (widenInteger 10 + pref) ^ 2,
 
 -- Bonus for a first knowledgeable or expert review.
 knowledgeableBonus = 1000,
 
 -- Bonus for an additional expert review.
-expertBonus = 1000
+expertBonus = 1000,
+
+-- === Parameters for the random-instance generator ===
+
+-- Number of topics.
+numTopics = 20,
+
+-- Exponent of the Zipf distribution used to choose topics for each proposal.
+topicZipfExponent = -0.5,
+
+-- === Parameters for the matching evaluator ===
+
+-- The weights given to the best, ..., worst review of a proposal in evaluating
+-- its "unhappiness".  Default is [reviewsEachProposal, ..., 1] since it's most
+-- important for the best review to be good.
+reviewEvalWeights = let rep = reviewsEachProposal pmDefaults in
+       map widenInteger [rep, rep-1 .. 1]
 
 }