Class to hold the PAUSETA algorithm.

• Pauseta()
• Pauseta(ArrayList<Bid> myOwnPrivateBids)
• addCompleteBidToSAB(CompleteBid completeBid)
• boolean updatePreviousHighestValue(double value)
• greedyPausetaBid(Agency bidder, int stage, Requirement requirement)

Pauseta()
Default constructor.

Pauseta(ArrayList<Bid> myOwnPrivateBids)
Constructor.

addCompleteBidToSAB(CompleteBid completeBid)
Adds the bids of a CompleteBid to the SAB.

boolean updatePreviousHighestValue(double value)
Updates the value for the previous highest value.

greedyPausetaBid(Agency bidder, int stage, Requirement requirement)
The algorithm that is described in the original paper. It gets a pretty good solution to fullfil the requirements using Composite bids.