Matchmaking among minimal agents without a facilitator
Proceedings of the fifth international conference on Autonomous agents
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Analysis Models for Blind Search in Unstructured Overlays
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
IEEE Transactions on Computers
Mechanisms for automated negotiation in state oriented domains
Journal of Artificial Intelligence Research
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Free-riding and whitewashing in peer-to-peer systems
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Peer-to-peer frameworks are known to be robust and scalable to large numbers of agents. Recent resource allocation studies have leveraged this by using peer-to-peer frameworks for the implementation of resource matching algorithms. In this paper, we present a matching protocol for multiagent resource allocation in a competitive peer-to-peer environment; this work marks the first solution to the resource matching problem in this type of environment. Our approach makes use of micro-payment techniques, along with concepts from random graph theory and game theory. We provide an analytical characterization of our protocol, and specify how an agent should choose optimal values for the protocol parameters.