Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Solving Combinatorial Auctions Using Stochastic Local Search
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Matchmaking: Distributed Resource Management for High Throughput Computing
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Towards an open grid marketplace framework for resources trade
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
SORMA - building an open grid market for grid resource allocation
GECON'07 Proceedings of the 4th international conference on Grid economics and business models
| Hi-index | 0.00 |
Utility computing and Grid are establishing themselves business models where resource providers invest in technology and software platforms. One of the most studied problems is that of efficient resource allocation. Computational efficiency is translated into economical efficiency creating incentives to resource providers to develop nearly optimal resource allocation frameworks. Auctions have proven their ability to do so. Besides, due to the heterogeneity of these environments, some new approaches adopt multiple different auctions to best fit each situation. Our work tries to homogenise scenarios where multiple market mechanisms are present, thus providing to bidders a well-defined bidding specification language that makes their bids independent of the auction mechanism used.