A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems
IEEE Transactions on Computers
Job scheduling in the presence of multiple resource requirements
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Flexible Communication Mechanisms for Dynamic Structured Applications
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Nimrod: a tool for performing parametrised simulations using distributed workstations
HPDC '95 Proceedings of the 4th IEEE International Symposium on High Performance Distributed Computing
The design and implementation of a secure auction service
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
ICEC '03 Proceedings of the 5th international conference on Electronic commerce
Resource allocation in competitive multiagent systems
Resource allocation in competitive multiagent systems
Specification faithfulness in networks with rational nodes
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Libra: a computational economy-based job scheduling system for clusters
Software—Practice & Experience
Distributed Implementations of Vickrey-Clarke-Groves Mechanisms
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
The GrADS Project: Software Support for High-Level Grid Application Development
International Journal of High Performance Computing Applications
Comparing two approaches to dynamic, distributed constraint satisfaction
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
A taxonomy of market-based resource management systems for utility-driven cluster computing
Software—Practice & Experience
Introduction to the Special Issue on Electronic Markets
Management Science
A comparison of distributed and centralised agent based bundling systems
Proceedings of the ninth international conference on Electronic commerce
Towards Reputation Enhanced Electronic Negotiations for Service Oriented Computing
Trust in Agent Societies
A novel multi-agent reinforcement learning approach for job scheduling in Grid computing
Future Generation Computer Systems
On bidding algorithms for a distributed combinatorial auction
Multiagent and Grid Systems
| Hi-index | 0.00 |
Grid computations will be enabled by participants trading resources in order to construct bundles of goods or services that constitute experiments in science, engineering and, now emerging, social sciences. A combinatorial auction (CA) is a natural choice for optimal allocation, but the space and time dimensions that characterise a Grid would appear to indicate they are incompatible. This paper proposes that an analogue of a physical commodities market seems more appropriate and that there is a class of bundling problem whose complexity properties appear to make the utilisation of a CA impractical. A simulation environment, BrickWorld, is described which comprises a distributed tier of "TraderAgents" and multiple distributed single item auctions (MDAs). The issues associated with the complexity of bundling are evaluated, in particular those arising when attempting to provide useful combinations of items in situations when the multi-dimensionality of the bundle would make it impractical to finish the NP-complete optimisation successfully in the soft real-time setting that is the Grid. Finally, the evaluation strategy presented helps demonstrate that for small bundling problems, a single CA continues to provide a high level of performance, but as the complexity level of the problem increases and the problem becomes distributed a system of MDAs may prove more effective.