Winner determination for mixed multi-unit combinatorial auctions via petri nets

Mixed Multi-Unit Combinatorial Auctions (MMUCAs) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services, and in general MMUCAs extend and generalise several types of combinatorial auctions. Here we provide a formalism, based on an extension of Petri Nets, with which MMUCAs, and therefore all auction types subsumed by MMUCAs —and in particular combinatorial auctions for supply chain formation (SCF)–, can be formally analysed. As a second direct benefit, consequence of the provided mapping to Petri Nets, we manage to dramatically reduce the number of decision variables involved in the optimisation problem posed by MMUCAs from quadratic to linear for a wide class of MMUCA Winner Determination Problems (WDPs). Hence, we also make headway in the practical application of MMUCAs, and in particular to SCF. G...

• Type: Conference
• Year: 2007
• Where: ATAL
• Authors: Andrea Giovannucci, Juan A. Rodríguez-Aguilar, Jesús Cerquides, Ulle Endriss
• Keywords: ATAL 2007, Combinatorial Auctions, Petri Nets, Supply Chain