Abstract
Consider continuous negotiations where the goal is to obtain exactly one complete bundle of resources and there exists alternative bundles that solve the task. This paper presents a market-based model of this negotiation that does not require commitment and decommitment during the negotiation phase. A negotation goal is represented by a graph, called a resource network. Goals are achieved by obtaining resources along one path in the graph. The resource network model can be applied to electronic commerce with agents trading bandwidth in all-or-nothing deals, and for agents that want to combine simple goods into more complex goods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aspnes J., Azar Y., Fiat A. Plotkin S. and Waarts O., On-Line Routing of Virtual Circuits with Applications to Load Balancing and Machine Scheduling, Journal of the ACM, vol. 44, no. 3, (1997), pp. 486–504.
Davis R. and Smith R. G., Negotiation as a Metaphor for Distributed Problem Solving, Artificial Intelligence, 20 (1983), pp. 63–109.
Ferguson D., Yemini Y. and Nikolaou C., Microeconomic Algorithms for Load Balancing in Distributed Computer Systems, Proc. of DCS, (1988).
Hull J. C., Options, Futures, and Other Derivatives, Prentice Hall, (1997).
Hurwicz L., The Design of Mechanisms for Resource Allocation, Richard T. Ely Lecture, American Economic Association, vol. 63, no. 2, (1973), pp. 1–30.
Kurose J. F., A Microeconomic Approach to Decentralized Optimization of Channel Access Policies in Multiaccess Networks, Proc. of the 5th Int. Conf. On Distributed Computer Systems, Denver Co., (1985).
Lazar A. A. and Semret N., Spot and Derivative Markets for Admission Control and Pricing in Connection-Oriented Networks, Technical Report CU/CTR/TR 501-98-35, Dept. of Electrical Engineering, Columbia University, (1998).
Milton R. C., Computer Evaluation of the Multivariate Normal Integral, Techno-metrica, 14 (1972), pp. 881–889.
Sandholm, T. An Algorithm for Optimal Winner Determination in Combinatorial Auctions, Proc. of IJCAI’99, (1999.), pp. 542–547.
Waldspurger C. A., Hogg T., Huberman B., Kephart J. O. and Stornetta W. S., Spawn: A Distributed Computational Economy, IEEE Trans. on Software Engineering, vol. 18, no. 2, (1992).
Walsh W. E., Wellman M. P., Wurman P. R. and MacKie-Mason J. K., Some Economics of Market-based Distributed Scheduling, 18th Int. Conf. on Distributed Computing Systems, (1998).
Wellman M., A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems, Journal of Arti-cial Intelligence Research, 1 (1993), pp. 1–23.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rasmusson, L. (2001). Evaluating Resource Bundle Derivatives for Multi-agent Negotiation of Resource Allocation. In: Liu, J., Ye, Y. (eds) E-Commerce Agents. Lecture Notes in Computer Science, vol 2033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45370-9_9
Download citation
DOI: https://doi.org/10.1007/3-540-45370-9_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41934-1
Online ISBN: 978-3-540-45370-3
eBook Packages: Springer Book Archive