diff --git a/docs/cow-protocol/concepts/introduction/fair-combinatorial-auction.md b/docs/cow-protocol/concepts/introduction/fair-combinatorial-auction.md
index 252818a2..f0a78faf 100644
--- a/docs/cow-protocol/concepts/introduction/fair-combinatorial-auction.md
+++ b/docs/cow-protocol/concepts/introduction/fair-combinatorial-auction.md
@@ -4,9 +4,9 @@ sidebar_position: 3
 
 # Fair Combinatorial Batch Auction
 
-CoW Protocol collects and aggregates [intents](./intents) off-chain and auctions them off to [solvers](./solvers). The auction is combinatorial because each solver can submit multiple bids. A solver can submit multiple bids on individual orders, in which case each "bid" represents the best price this solver can provide to an individual order. However, a solver can also submit "batched" bids, that is, bids on groups of orders. 
+CoW Protocol collects and aggregates [intents](./intents) off-chain and auctions them off to [solvers](./solvers). The auction is combinatorial because each solver can submit multiple bids. A solver can submit multiple bids on individual orders, in which case each "bid" represents the best price this solver can provide to an individual order. However, a solver can also submit "batched" bids, that is, bids on groups of orders.
 
-The protocol filters out ``unfair'' batched bids, which are those delivering less to an order than some available "non-batched" bids. It then selects the combination of winning bids that maximizes the surplus received by the orders that are part of the auction (subject to some computational constraints due to the combinatorial nature of the problem).
+The protocol removes any "unfair" batched bids - ones that would give an order a worse outcome than a regular, single bid. Then, from the remaining options, it picks the mix of bids that gives traders the most total value possible, while staying within the system's computational limits.
 
 ![The Auctions](/img/concepts/batch-auctions.png)