From a8baed32856b4bf8128dd4c06332d497fd570443 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Igor=20Ron=C4=8Devi=C4=87?=
 <57319163+igorroncevic@users.noreply.github.com>
Date: Wed, 22 Apr 2026 12:06:10 +0200
Subject: [PATCH] Update fair-combinatorial-auction.md

---
 .../concepts/introduction/fair-combinatorial-auction.md         | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/cow-protocol/concepts/introduction/fair-combinatorial-auction.md b/docs/cow-protocol/concepts/introduction/fair-combinatorial-auction.md
index 252818a22..a0fdaaa69 100644
--- a/docs/cow-protocol/concepts/introduction/fair-combinatorial-auction.md
+++ b/docs/cow-protocol/concepts/introduction/fair-combinatorial-auction.md
@@ -6,7 +6,7 @@ sidebar_position: 3
 
 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 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 Auctions](/img/concepts/batch-auctions.png)