Introduction to Algorithms
Combinatorial Auctions
Bid expressiveness and clearing algorithms in multiattribute double auctions
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Winner determination for mixed multi-unit combinatorial auctions via petri nets
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Decentralized supply chain formation: a market protocol and competitive equilibrium analysis
Journal of Artificial Intelligence Research
Bidding languages and winner determination for mixed multi-unit combinatorial auctions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
A test suite for the evaluation of mixed multi-unit combinatorial auctions
Journal of Algorithms
A mixed multi-unit combinatorial auctions test suite
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Auctions and bidding: A guide for computer scientists
ACM Computing Surveys (CSUR)
Empirical hardness for mixed auctions
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Solving sequential mixed auctions with integer programming
CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
Proceedings of the 13th International Conference on Electronic Commerce
Combining adaptive goal-driven agents with mixed multi-unit combinatorial auctions
Proceedings of the 13th International Conference on Computer Systems and Technologies
Proof systems and transformation games
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Mixed Multi-Unit Combinatorial Auctions offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services. Their winner determination problem 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 mixed multi-unit combinatorial auctions to realistic scenarios. In this paper we propose a new integer program for mixed multi-unit combinatorial auctions that severely simplifies the problem by taking advantage of the topological characteristics of the winner determination problem. Furthermore, we provide empirical evidence showing that the new IP allows to cope with much larger supply chain formation scenarios.