diff --git a/src/main/java/MaximumIntegerWeightBipartiteAuctionMatching.java b/src/main/java/MaximumIntegerWeightBipartiteAuctionMatching.java
index 901caf9..556d1c9 100644
--- a/src/main/java/MaximumIntegerWeightBipartiteAuctionMatching.java
+++ b/src/main/java/MaximumIntegerWeightBipartiteAuctionMatching.java
@@ -82,7 +82,9 @@ public class MaximumIntegerWeightBipartiteAuctionMatching<V, E> implements Match
 
         /*
         Create a map to track the owner of each item, which is initially null,
-        and a map to track the price of each item, which is initially 0.
+        and a map to track the price of each item, which is initially 0. An
+        Initial price of 0 allows for asymmetric assignment (though does mean
+        that this form of the algorithm cannot take advantage of epsilon-scaling).
          */
         Map<V, V> owners = new HashMap<>();
         Map<V, BigDecimal> prices = new HashMap<>();