public class GenericCCAMechanism<G extends GenericDefinition<T>,T extends Good> extends CCAMechanism<T>
bidders, clockPhaseNumberOfBundles, DEFAULT_STARTING_PRICE, epsilon, fallbackStartingPrice, maxRounds, paymentRule, result, totalRounds| Constructor and Description |
|---|
GenericCCAMechanism(List<Bidder<T>> bidders,
GenericDemandQueryMIPBuilder<G,T> genericDemandQueryMIPBuilder) |
adjustPayoffs, calculateAllocation, calculateSampledStartingPrices, copyOf, getEpsilon, getPayment, getTotalRounds, getWdWithoutBidder, setClockPhaseNumberOfBundles, setEpsilon, setFallbackStartingPrice, setMaxRounds, setPaymentRulepublic void setStartingPrice(G good, BigDecimal price)
public MechanismResult<T> getMechanismResult()
getMechanismResult in interface AuctionMechanism<T extends Good>getMechanismResult in class CCAMechanism<T extends Good>public void calculateSampledStartingPrices(int bidsPerBidder,
int numberOfWorldSamples,
double fraction,
long seed)
CCAMechanismcalculateSampledStartingPrices in class CCAMechanism<T extends Good>bidsPerBidder - How many bids are collected per bidder in each worldnumberOfWorldSamples - How many parallel worlds are created to collect these bidsfraction - The fraction of the estimated value that is turned into the starting priceseed - The seed used for drawing the valuespublic Allocation<T> calculateClockPhaseAllocation()
public Allocation<T> calculateAllocationAfterSupplementaryRound()
public Collection<GenericBid<G,T>> getBidsAfterSupplementaryRound()
public int getSupplyMinusDemand()
public void setPriceUpdater(GenericPriceUpdater<G,T> genericPriceUpdater)
public void addSupplementaryRound(GenericSupplementaryRound<G,T> genericSupplementaryRound)
public Map<Bidder<T>,Integer> getBidCountAfterSupplementaryRound()
public GenericDemandQueryMIPBuilder<G,T> getDemandQueryBuilder()
public Map<G,BigDecimal> getFinalPrices()
public Map<G,BigDecimal> getLastPrices()
public GenericBid<G,T> getBidAfterClockPhase(Bidder<T> bidder)
public GenericBid<G,T> getBidAfterSupplementaryRound(Bidder<T> bidder)
Copyright © 2019. All rights reserved.