Update README.md

Author: kayuksel

README.md

@@ -1,6 +1,6 @@
 # Combinatorial Multi-Armed Bandit
 
-A method for selecting a subset of best items w.r.t. black-box reward function: Given 𝑁 items, the algorithm searches for an optimal 𝑠𝑢𝑏𝑠𝑒𝑡 of a maximum number of 𝑘 items, which maximizes a blackbox reward function 𝑓(𝑠𝑢𝑏𝑠𝑒𝑡).
+A method for selecting a subset of best items w.r.t. a black-box reward function: Given 𝑁 items, the algorithm searches for an optimal 𝑠𝑢𝑏𝑠𝑒𝑡 of a maximum number of 𝑘 items, which maximizes a blackbox reward function 𝑓(𝑠𝑢𝑏𝑠𝑒𝑡).
 
 The algorithm generates new subset candidates based on the novelty of the items while also considering what is the ratio of presence of an item that exist among the top previously tried subsets (by sorting them wrt rewards achieved).