public class MUCA extends ExampleFD
The idea originated from reading the following paper where the first attempt to use CP was presented.
Comparing Winner Determination Algorithms for Mixed Multi-Unit Combinatorial Auctions by Brammert Ottens Ulle Endriss
Modifier and Type | Field and Description |
---|---|
List<IntVar> |
bidCosts
For each bidder it specifies variable representing
the cost of the chosen xor bid.
|
List<List<List<org.jacop.examples.fd.muca.MUCA.Transformation>>> |
bids
ArrayList of bids issued by different bidders.
|
List<List<Integer>> |
costs
For each bidder and each xor bid there is an
integer representing a cost of the xor bid.
|
IntVar[][] |
deltasI
For each transition and each good it specifies the
delta change of that good before the transition takes place.
|
IntVar[][] |
deltasO
For each transition and each good it specifies the
delta change of that good after the transition takes place.
|
String |
filename
It reads auction problem description from the file.
|
List<Integer> |
finalQuantity
It specifies the minimal quantities of items seeked to achieve.
|
List<Integer> |
initialQuantity
It specifies the initial quantities of goods.
|
int |
maxCost
It specifies the maximal value for the cost.
|
int |
maxDelta
It specifies the maximal possible delta of goods for any transformation.
|
int |
maxNoTransformations
It specifies the maximal number of transformations used by the auctioneer.
|
int |
maxProducts
The maximal number of products.
|
int |
minCost
It specifies the minimal value for the cost.
|
int |
minDelta
It specifies the minimal possible delta of goods for any transformation.
|
int |
noGoods
It specifies number of goods which are in the focus of the auction.
|
IntVar[] |
sum
It specifies the number of goods after the last transition.
|
IntVar[] |
transitions
It specifies the sequence of transitions used by an auctioneer.
|
Constructor and Description |
---|
MUCA() |
Modifier and Type | Method and Description |
---|---|
static void |
main(String[] args)
It executes the program which solve the supplied auction problem or
solves three problems available within the files.
|
void |
model()
It specifies a standard way of modeling the problem.
|
void |
readAuction(String filename)
It reads the auction problem from the file.
|
boolean |
searchSpecial()
It executes special master-slave search.
|
void |
setupProblem1()
It creates an instance of the auction problem.
|
void |
setupProblem2()
It creates an instance of the auction problem.
|
void |
setupProblem3()
It creates an instance of the auction problem.
|
void |
setupProblem4()
It creates an instance of the auction problem.
|
creditSearch, getSearch, getSearchVariables, getStore, printMatrix, search, searchAllAtOnce, searchAllOptimal, searchLDS, searchMasterSlave, searchMaxRegretOptimal, searchMiddle, searchMostConstrainedStatic, searchOptimal, searchSmallestDomain, searchSmallestMedian, searchSmallestMiddle, searchSmallestMin, searchWeightedDegree, searchWithMaxRegret, searchWithRestarts, shavingSearch
public List<List<List<org.jacop.examples.fd.muca.MUCA.Transformation>>> bids
public List<List<Integer>> costs
public List<Integer> finalQuantity
public int noGoods
public int minDelta
public int maxDelta
public int minCost
public int maxCost
public int maxProducts
public List<IntVar> bidCosts
public IntVar[] transitions
public int maxNoTransformations
public IntVar[][] deltasI
public IntVar[][] deltasO
public IntVar[] sum
public String filename
public void setupProblem1()
public void setupProblem2()
public void setupProblem3()
public void setupProblem4()
public static void main(String[] args)
args
- the first argument specifies the name of the file containing the problem description.public void model()
ExampleFD
public boolean searchSpecial()
public void readAuction(String filename)
filename
- file describing the auction problem.Copyright © 2022. All rights reserved.