Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Computationally Manageable Combinational Auctions
Management Science
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
An Algorithm for Multi-Unit Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Taming the computational complexity of combinatorial auctions: optimal and approximate approaches
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Auctioning transformable goods
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Pick-a-bundle: a novel bundling strategy for selling multiple items within online auctions
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Benefits of Combinatorial Auctions with Transformability Relationships
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Bidding languages and winner determination for mixed multi-unit combinatorial auctions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Hi-index | 0.00 |
In this paper we extend the notion of multi-unit combinatorial reverse auction by adding a new dimension to the goods at auction. In such a new type of combinatorial auction a buyer can express transformability relationships among goods: some goods can be transformed into others at a transformation cost. Transformability relationships allow a buyer to introduce his information as to whether it is more convenient to buy some goods or others. We introduce such information in the winner determination problem (WDP) so that not only does the auction help allocate the optimal set of offers—taking into account transformability relationships—, but also assesses the transformability relationships that apply. In this way, the buyer finds out what goods to buy, to whom, and what transformations to apply to the acquired goods in order to obtain the required ones.