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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chevaleyre, Y., Dunne, P., Endriss, U., Lang, J., Lemaitre, M., Maudet, N., Padget, J., Phelps, S., Rodriguez-Aguilar, J., Sousa, P.: Issues in multiagent resource allocation. Informatica 30 (2005)
Zlotkin, G., Rosenschein, J.S.: Mechanisms for automated negotiation in state oriented domains. Journal of Artificial Intelligence Research 5, 163–238 (1996)
Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. The Journal of Finance 16, 8–37 (1961)
Risson, J., Moors, T.: Survey of research towards robust peer-to-peer networks: search methods. Computer Networks 50, 3485–3521 (2006)
Li, X., Wu, J.: Searching techniques in peer-to-peer networks. In: Handbook of Theoretical and Algorithmic Aspects of Ad Hoc, Sensor, and Peer-to-Peer Networks, pp. 1–28 (2006)
Wu, B., Kshemkalyani, A.D.: Analysis models for blind search in unstructured overlays. In: NCA 2006: Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications, pp. 223–226. IEEE Computer Society, Washington, DC (2006)
Kalogeraki, V., Gunopulos, D., Zeinalipour-Yazti, D.: A local search mechanism for peer-to-peer networks. In: CIKM 2002: Proceedings of the Eleventh International Conference on Information and Knowledge Management, pp. 300–307. ACM, New York (2002)
Vanzin, M.M., Barber, K.S.: Decentralized partner finding in multiagent systems. Coordination of Large-Scale Multiagent Systems, 75–98 (2006)
Jakobsson, M., Hubaux, J.-P., Buttyán, L.: A Micro-Payment Scheme Encouraging Collaboration in Multi-hop Cellular Networks. In: Wright, R.N. (ed.) FC 2003. LNCS, vol. 2742, pp. 15–33. Springer, Heidelberg (2003)
Rivest, R.L., Shamir, A., Adelman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Technical Report MIT/LCS/TM-82, MIT (1977)
Peleg, Y.: Towards P2P-based resource allocation in competitive environments. Master’s thesis, School of Engineering and Computer Science, The Hebrew University of Jerusalem (2009)
Ahsanullah, M.: Order Statistics. Nova (2005)
Clement, A., Li, H., Napper, J., Martin, J.P., Alvisi, L., Dahlin, M.: Bar primer. In: IEEE International Conference on Dependable Systems and Networks With FTCS and DCC, DSN 2008, pp. 287–296 (2008)
Boyer, R., Orlean, A.: How do conventions evolve? Journal of Evolutionary Economics 2, 165–177 (1992)
Cooper, R., De Jong, D.V., Forsythe, R., Ross, T.W.: Forward induction in coordination games. Economics Letters 40, 167–172 (1992)
Feldman, M., Papadimitriou, C., Chuang, J., Stoica, I.: Free-riding and whitewashing in peer-to-peer systems. IEEE Journal on Selected Areas in Communications 24, 1010–1019 (2006)
Huyck, J.B.V., Battalio, R.C., Beil, R.O.: Tacit coordination games, strategic uncertainty, and coordination failure. The American Economic Review 80, 234–248 (1990)
Zegura, E., Calvert, K., Bhattacharjee, S.: How to model an internetwork. In: Proceedings of IEEE Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation, INFOCOM 1996, vol. 2, pp. 594–602 (1996)
Bertels, K., Panchanathan, N., Vassiliadis, S., Ebrahimi, B.P.: Centralized matchmaking for minimal agents. In: Proceedings of the Conference on Parallel and Distributed Computer Systems (ICPADS), p. 9 (2004)
Mullender, S.J., Vitanyi, P.M.B.: Distributed match-making. Algorithmica 3, 367–391 (1987)
Ogston, E., Vassiliadis, S.: Matchmaking among minimal agents without a facilitator. In: International Conference on Autonomous Agents, AAMAS (2001)
Smith, R.G.: The contract net protocol: high-level communication and control in a distributed problem solver. IEEE Transactions on Computers 12, 1104–1113 (1980)
Zhong, S., Chen, J., Yang, Y.R.: Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks. In: Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2003, vol. 3, pp. 1987–1997. IEEE (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peleg, Y., Rosenschein, J.S. (2012). Agents and Peer-to-Peer Computing: Towards P2P-Based Resource Allocation in Competitive Environments. In: Beneventano, D., Despotovic, Z., Guerra, F., Joseph, S., Moro, G., de Pinninck, A.P. (eds) Agents and Peer-to-Peer Computing. AP2PC AP2PC 2009 2008. Lecture Notes in Computer Science(), vol 6573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31809-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-31809-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31808-5
Online ISBN: 978-3-642-31809-2
eBook Packages: Computer ScienceComputer Science (R0)