Abstract
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specifically, we consider on-line algorithms for this problem in which goods are considered on-line, and each good is assigned an irrevocable price. Since exact equilibria will not be found in such a setting, we appeal to the concept of approximate equilibrium defined in previous studies of the problem, to characterize the quality of our solutions. We consider both deterministic and randomized algorithms for finding approximate equilibria. We prove a tight bound on the performance of deterministic algorithms, and show that under certain natural conditions, randomized algorithms lead to market prices which are closer to equilibrium.
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
Arrow, K., Debreu, G.: Existence of an equilibrium for a competitive economy. Econometrica 22, 265–290 (1954)
Blum, A., Sandholm, T., Zinkevich, M.: Online algorithms for market clearing. In: SODA 2002: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 971–980 (2002)
Brainard, W.C., Scarf, H.E.: How to compute equilibrium prices in 1891. Cowles Foundation Discussion Paper 1270 (2000)
Devanur, N., Papadimitriou, C., Saberi, A., Vazirani, V.: Market equilibrium via a primal-dual type algorithm. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 389–395 (2002)
Deng, X., Papadimitriou, C., Safra, S.: On the complexity of equilibria. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 67–71 (2002)
Devanur, N.R., Vazirani, V.V.: An improved approximation scheme for computing arrow-debreu prices for the linear case. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 149–155. Springer, Heidelberg (2003)
Devanur, N.R., Vazirani, V.V.: Extensions of the spending constraint-model: existence and uniqueness of equilibria (extended abstract). In: ACM Conference on Electronic Commerce 2003, pp. 202–203 (2003)
Jain, K., Mahdian, M., Saberi, A.: Approximating market equilibria. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 98–108. Springer, Heidelberg (2003)
Scarf, H.E.: The computation of Economic Equilibria (with collaboration of T. Hansen). Cowles Foundation Monograph No. 24. Yale University Press (1973)
Walras, L.: Éléments d’économie politique pure; ou, théorie de la richesse sociale (Elements of Pure Economics, or the theory of social wealth). Lausanne, Paris (1874) (1899, 4th ed.; 1926 rev. ed. , 1954 Engl. transl.)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angelopoulos, S., Sarma, A.D., Magen, A., Viglas, A. (2005). On-Line Algorithms for Market Equilibria. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_61
Download citation
DOI: https://doi.org/10.1007/11533719_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)