10 April 2007
Andrea Giovanucci & Meritxell Vinyals

After briefly introducing Petri Nets (PN), a graphical model to analyse discrete dynamical systems, we will extend them in order to solve an optimization problem, the winner determination problem for Mixed Multi-unit Combinatorial Auctions (MMUCA). In a MMUCA agents are allowed to bid for goods to buy, for goods to sell, and for transformations of goods. One such transformation can be seen as a step in a production process, so solving the auction requires choosing the sequence in which the accepted bids should be implemented. Finally, we will describe a test-bed for evaluating the performances of the solver.