Module auction 

Auction Algorithm for the Linear Assignment Problem

The auction algorithm uses a market-based approach where agents “bid” for tasks. It’s particularly efficient for sparse problems.

Algorithm Overview

1. Agents bid on preferred tasks
2. Tasks are “sold” to highest bidder
3. Prices increase for contested tasks
4. Repeat until all agents assigned

Time complexity: O(n³) worst case, often faster in practice.

Structs

AuctionSolver

Auction algorithm solver

Functions

solve

Solve using auction algorithm with default epsilon