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 a solver that does not take into account
the structure of the problem is very high, hindering the application of
MMUCAs to realistic scenarios. Here we outline how to take advantage
of the topology of the problem to eciently solve MMUCAs.
Links:
[1] http://www.iiia.csic.es/en/individual/andrea-giovannucci
[2] http://www.iiia.csic.es/en/individual/meritxell-vinyals
[3] http://www.iiia.csic.es/en/individual/juan-a-rodriguez-aguilar
[4] http://www.iiia.csic.es/en/individual/jesus-cerquides
[5] http://www.iiia.csic.es/en/publications/export/tagged/3198
[6] http://www.iiia.csic.es/en/publications/export/xml/3198
[7] http://www.iiia.csic.es/en/publications/export/bib/3198
[8] http://www.iiia.csic.es/en/project/open-knowledge
[9] http://www.iiia.csic.es/en/project/at
[10] http://www.iiia.csic.es/en/project/iea