A Fast and Simple Algorithm for Computing Market Equilibria
نویسندگان
چکیده
We give a new mathematical formulation of market equilibria using an indirect utility function: the function of prices and income that gives the maximum utility achievable. The formulation is a convex program and can be solved when the indirect utility function is convex in prices. We illustrate that many economies including – Homogeneous utilities of degree α ∈ [0, 1] in Fisher economies — this includes Linear, Leontief, Cobb-Douglas – Resource allocation utilities like multi-commodity flows satisfy this condition and can be efficiently solved. Further, we give a natural and decentralized price-adjusting algorithm in these economies. Our algorithm, mimics the natural tâtonnement dynamics for the markets as suggested by Walras: it iteratively adjusts a good’s price upward when the demand for that good under current prices exceeds its supply; and downward when its supply exceeds its demand. The algorithm computes an approximate equilibrium in a number of iterations that is independent of the number of traders and is almost linear in the number of goods. Interestingly, our algorithm applies to certain classes of utility functions that are not weak gross substitutes.
منابع مشابه
A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملA SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...
متن کاملNumerical algorithm for discrete barrier option pricing in a Black-Scholes model with stationary process
In this article, we propose a numerical algorithm for computing price of discrete single and double barrier option under the emph{Black-Scholes} model. In virtue of some general transformations, the partial differential equations of option pricing in different monitoring dates are converted into simple diffusion equations. The present method is fast compared to alterna...
متن کاملMultiequilibrium Game of Timing and Competition of Gas Pipeline Projects
The paper addresses the issue of the optimal investments in innovations with strong long-term aftereffects. As an example, investments in the construction of gas pipelines are considered. The most sensitive part of an investment project is the choice of the commercialization time (stopping time), i.e., the time of finalizing the construction of the pipeline. If several projects compete on the m...
متن کاملCompetition of Gas Pipeline Projects: Game of Timing
The paper addresses the issue of optimal investments in innovations with strong long-term aftereffects. As an example, investments in the construction of gas pipelines are considered. The most sensible part of a gas pipeline project is the choice of the commercialization time, i.e., the time of finalizing the construction of the pipeline. If several projects compete for a gas market, the choice...
متن کامل