Abstract
There are two types of market mechanism that can be used to allocate network resources efficiently based on users’ preference. One, mainly considered in previous works, is the Tâtonnement process; the allocation is not changed until the price reaches equilibrium. When the user preference changes dynamically, the resource allocation derived by the Tâtonnement process may not reflect the curent preference.
The other is the Non-Tâtonnement process, where the allocation is changed dynamically even while the allocation is being calculated. Consequently, it suits resource allocation in dynamic environments. However, the property of this process in terms of the time needed to complete all calculations has not been studied sufficiently.
As a first step,this paper compares the quality of the results derived by the Non-Tâtonnement process to that by the Tâtonnement process for dynamic network resource allocation. We find that the Non-Tâtonnement process works better in rapidly changing environments and that the Tâtonnement process offers superior results when there is enough time for the market to converge to equilibrium.
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
Hahn, F. H. and Negishi, T.: A Theorem on Non-Tâtonnement Stability, Econometrica, Vol. 30, No. 3, pp. 463–469 (1962).
Kurose, J. F. and Simha, R.: A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems, IEEE Transactions on Computers, Vol. 38, pp. 705–717 (1989).
Negishi, T.: On the Formation of Prices, International Economic Review, Vol. 2, No. 1, pp. 122–126 (1961).
Negishi, T.: General equilibrium theory and international trade, North-Holland, pp. 207–227 (1972).
Uzawa, H.: On the Stability of Edgeworth’s Barter Process, International Economic Review, Vol. 3, No. 2, pp. 218–232 (1962).
Wellman, M.P.: A Market-Oriented Programming Environment and Its Application to Distributed Multicommodity Flow Problems, Journal of Artificial Intelligence Research, Vol. 1, pp. 1–22 (1993).
Yamaki, H., Wellman, M. P. and Ishida, T.: A Market-Based Approach to Allocating QoS for Multimedia Applications, The Second International Conference on Multi-Agent Systems (ICMAS-96), pp. 385–392 (1996).
Yamaki, H., Yamauchi, Y. and Ishida, T.: Implementation Issues on Market-Based QoS Control, The Fourth International Conference on Multi-Agent Systems (ICMAS-98), pp. 357–364 (1998).
Ygge., F. and Akkermans., H.: On Resource-Oriented Multi-Commodity Market Computations, Third International Conference on Multi-Agent Systems (ICMAS), pp. 365–371 (1998).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakatsuka, K., Yamaki, H., Ishida, T. (2000). Market-Based Network Resource Allocation with Non-tâtonnement Process. In: Zhang, C., Soo, VW. (eds) Design and Applications of Intelligent Agents. PRIMA 2000. Lecture Notes in Computer Science(), vol 1881. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44594-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-44594-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67911-0
Online ISBN: 978-3-540-44594-4
eBook Packages: Springer Book Archive