Skip to main content
SpringerLink
Log in

A Distributed Allocation Mechanism for Network Resources Using Software Agents

  • Published:
Information Technology and Management Aims and scope Submit manuscript

Abstract

Functionality of electronic commerce enabling technologies is dependent upon pervasive networks that a large number of applications share. Given the scarcity of network resources, it is imperative to allocate existing resources based on the actual needs of its users. In this paper, we study a two sided matching algorithm that enables such an allocation using tools from matching literature. Network system deploys intelligent agents that negotiate terms of allocation assignments with other intelligent agents that represent the users. We report the time complexity of the algorithm and give an example on how the mechanism performs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. Chatterjee and L. Samuelson, Bargaining with two-sided incomplete information: An infinite horizon model with alternating offers, Review of Economic Studies 54(2) (April 1987) 175–92.

    Google Scholar 

  2. R.H. Guttman, A.G. Moukas and P. Maes, Agent-mediated electronic commerce: A survey, International Journal of Electronic Commerce (2000), forthcoming.

  3. J. Laine, On the nash equilibrium property of an auction matching game, Economics Letters 38 (1992) 399.

    Google Scholar 

  4. A.A. Lazar and N. Semret, Design, analysis and simulation of the progressive second price auction for network bandwidth sharing, in: 8th International Symposium on Dynamic Games and Applications, Netherlands, 1998.

  5. M. Olson, Dominant and nash strategy mechanisms for the assignment problem, Caltech Social Science Working Paper: 770, July 1991.

  6. A. Roth and J.H. Vande Vate, Random paths to stability in two-sided matching, Econometrica 58(6) (November 1990) 1475.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Krannert Graduate School of Management, Purdue University, West Lafayette, IN, 47907, USA

    Kemal Altinkemer

  2. College of Business Administration, University of Texas at Austin, CBA 5.202 B6500, Austin, TX, 78731, USA

    Kerem Tomak

Authors
  1. Kemal Altinkemer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kerem Tomak
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Altinkemer, K., Tomak, K. A Distributed Allocation Mechanism for Network Resources Using Software Agents. Information Technology and Management 2, 165–173 (2001). https://doi.org/10.1023/A:1011461518084

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011461518084

Search

Navigation