From 170d2865315415334720d78586d34e023c57504a Mon Sep 17 00:00:00 2001 From: Assem Hasna Date: Sat, 8 Nov 2025 22:01:57 +0100 Subject: [PATCH 1/2] =?UTF-8?q?doc:=20fix=20formatting=20of=20'unfair'=20i?= =?UTF-8?q?n=20auction=20documentation=20=F0=9F=92=85?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../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 252818a2..01da2731 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) From affe53ce45aa248c75756a73ed173b68c3514fa1 Mon Sep 17 00:00:00 2001 From: Assem Hasna Date: Tue, 11 Nov 2025 13:56:43 +0100 Subject: [PATCH 2/2] =?UTF-8?q?docs:=20clarifies=20auction=20bid=20selecti?= =?UTF-8?q?on=20=E2=9C=A8?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../concepts/introduction/fair-combinatorial-auction.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/docs/cow-protocol/concepts/introduction/fair-combinatorial-auction.md b/docs/cow-protocol/concepts/introduction/fair-combinatorial-auction.md index 01da2731..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)