Algorithmic principle of least revenue for finding market equilibria
(2016) Optimization and Its Applications in Control and Data Sciences — ISBN: [978-3-319-42056-1], p. 381-435, published
Files
Rep2894.pdf
Closed Access - Adobe PDF
- 1.03 MB
Details
- Authors
- Abstract
- In analogy to extremal principles in physics, we introduce the Principle of Least Revenue for treating market equilibria. It postulates that equilibrium prices minimize the total excessive revenue of market's participants. As a consequence, the necessary optimality conditions describe the clearance of markets, i.e. at equilibrium prices supply meets demand. It is crucial for our approach that the potential function of total excessive revenue be convex. This facilitates structural and algorithmic analysis of market equilibria by using convex optimization techniques. In particular, results on existence, uniqueness, and efficiency of market equilibria follow easily. The market decentralization fits into our approach by the introduction of trades or auctions. For that, Duality Theory of convex optimization applies. The computability of market equilibria is ensured by applying quasi-monotone subgradient methods for minimizing nonsmooth convex ojective - total excessive revenue of the market's participants. We give an explicit implementable algorithm for finding market equilibria which cororesponds to real-life activities of market's participants.
- Affiliations
Citations
Nesterov, Y., & Shikhman, V. (2016). Algorithmic principle of least revenue for finding market equilibria. In B. Goldengorin (ed.), Optimization and Its Applications in Control and Data Sciences (p. p. 381-435). Springer. https://doi.org/10.1007/978-3-319-42056-1_14