Agents and peer-to-peer computing: Towards P2P-based resource allocation in competitive environments

Yoni Peleg*, Jeffrey S. Rosenschein

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationAgents and Peer-to-Peer Computing - 8th International Workshop, AP2PC 2009, Revised Selected Papers
Pages129-140
Number of pages12
DOIs
StatePublished - 2012
Event8th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2009 - Budapest, Hungary
Duration: 11 May 200911 May 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6573 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2009
Country/TerritoryHungary
CityBudapest
Period11/05/0911/05/09

Fingerprint

Dive into the research topics of 'Agents and peer-to-peer computing: Towards P2P-based resource allocation in competitive environments'. Together they form a unique fingerprint.

Cite this