Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Finding a longest path in a complete multipartite digraph
SIAM Journal on Discrete Mathematics
Data structures and algorithm analysis in C (2nd ed.)
Data structures and algorithm analysis in C (2nd ed.)
Flexible double auctions for electionic commerce: theory and implementation
Decision Support Systems - Special issue on economics of electronic commerce
Emergence and collapse of money through reciprocity
Applied Mathematics and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Electronic Commerce Research
Matchmaking: Distributed Resource Management for High Throughput Computing
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Policy Driven Heterogeneous Resource Co-Allocation with Gangmatching
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Learning in dynamic noncooperative multiagent systems
Learning in dynamic noncooperative multiagent systems
Used car salesman problem: A differential auction--barter market
Annals of Mathematics and Artificial Intelligence
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
An incentive approach for computational resource sharing in the autonomous environment
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
A direct barter model for course add/drop process
Discrete Applied Mathematics
Multi-unit differential auction-barter model for electronic marketplaces
Electronic Commerce Research and Applications
Hi-index | 0.00 |
We present models for bartering of resources on grids. Bartering models can be useful for making resource allocation decisions in grids and perhaps even for building a so called barter grid whereby distributed resources such as electronic media can be bartered. Grids allow various resources to be shared among many users. This sharing however definitely does not mean that everyone will have unrestricted use of the resources. Some mechanism such as pricing or quotas can be employed in order to enforce controlled sharing of resources. A barter model for resource sharing can enable people or computer centers to directly get something in return for letting their resources to be used by others. We utilize directed hypergraphs to develop a barter model in which multiple resources can be traded. We prove that the decision version of the multi-resource bartering problem is NP-complete. We present an integer programming formulation for the bartering problem. We also present a linear time algorithm to compute components that may contain feasible bartering solutions. We generalize our multi-resource bartering formulation to the case where multiple instances of resources are present. Finally, we present various computational results from our software that makes use of LP_SOLVE and CPLEX mixed integer programming libraries to solve example bartering problems.