This article is cited in 1 scientific paper (total in 1 paper)
Polyhedral complementarity on a simplex: search for fixed points of decreasing regular mappings
V. I. Shmyrevab
a Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov Street, 630090 Novosibirsk, Russia
We study the problem of finding a fixed point for a special class of piecewise-constant mappings of a simplex into itself which arise in connection with the search for equilibrium prices in the classical exchange model and its various versions. The consideration is based on the polyhedral complementarity which is a natural generalization of linear complementarity. Here we study the mappings arising from models with fixed budgets. Mappings of this class possess a special property of monotonicity (logarithmic monotonicity), which makes it possible to prove that they are potential. We show that the problem of finding fixed points of these mappings is reducible to optimization problems for which it is possible to propose finite suboptimization algorithms. We give description of two algorithms. Illustr. 3, bibliogr. 20.
polyhedral complex, complementarity, monotonicity, potentiality, fixed point, suboptimization, algorithm.
PDF file (381 kB)
Journal of Applied and Industrial Mathematics, 2019, 13:1, 145–156
V. I. Shmyrev, “Polyhedral complementarity on a simplex: search for fixed points of decreasing regular mappings”, Diskretn. Anal. Issled. Oper., 26:1 (2019), 114–134; J. Appl. Industr. Math., 13:1 (2019), 145–156
Citation in format AMSBIB
\paper Polyhedral complementarity on a simplex: search for fixed points of~decreasing regular~mappings
\jour Diskretn. Anal. Issled. Oper.
\jour J. Appl. Industr. Math.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
V. I. Shmyrev, “Poliedralnaya komplementarnost na simplekse. metod vstrechnykh putei dlya ubyvayuschikh kvaziregulyarnykh otobrazhenii”, Tr. IMM UrO RAN, 25, no. 2, 2019, 273–286
|Number of views:|