Source: wikibot/knapsack-auction
= Knapsack auction
{wiki=Knapsack_auction}
A **Knapsack auction** is a variation of auction mechanisms that introduces elements from the well-known "knapsack problem" from combinatorial optimization. In a classic knapsack problem, the goal is to select a subset of items, each with a given weight and value, such that the total weight is within a specified limit (the capacity of the knapsack) and the total value is maximized.