Key Takeaways
In the bundle allocation problem, a miner is given a fixed number of transactions which are to be included in a given block and a number of bundles which the miner can choose to include (or exclude) in this block.
The miner earns profits from including each bundle in the block, but the bundles have a number of allocation constraints which must be accounted for.
This note gives a simple formulation of the problem as an integer linear programming problem, and provide some basic extensions.
.png)
