Computationally-efficient winner determination for mixed multi-unit combinatorial auctions

@inproceedings{Giovannucci2008ComputationallyefficientWD,
  title={Computationally-efficient winner determination for mixed multi-unit combinatorial auctions},
  author={Andrea Giovannucci and Meritxell Vinyals and Juan A. Rodr{\'i}guez-Aguilar and Jes{\'u}s Cerquides},
  booktitle={AAMAS},
  year={2008}
}
Mixed Multi-Unit Combinatorial Auctions (MMUCA) offer a high potential to automate assembly of supply chains of agents offering goods and services. Their winner determination problem (WDP) is an NP-hard problem that can be mapped into an integer program. Nonetheless, the computational cost of the current solution hinders the application of MMUCAs to realistic scenarios. Here we propose a new integer program for MMUCAs that severely simplifies the problem by taking advantage of the topological… CONTINUE READING