Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. I. Shmyrev, “A Problem of Polyhedral Complementarity,” in Optimization, Vol. 44 (Inst. Mat. SO AN SSSR, Novosibirsk, 1988), pp. 82–95.
V. I. Shmyrev, “On the Determination of Fixed Points of Piecewise Constant Monotone Mappings in Rn,” Dokl. Akad. Nauk SSSR 259 (2), 299–301 (1981) [SovietMath. Dokl. 24 (1), 88–90 (1981)].
E. Eisenberg and D. Gale, “Consensus of Subjective Probabilities: The Pari-Mutuel Method,” Ann. Math. Stat. 30 (1), 165–168 (1959).
V. I. Shmyrev, “On an Approach to the Determination of Equilibrium in Elementary Exchange Models,” Dokl. Akad. Nauk SSSR 268 (5), 1062–1066 (1983) [SovietMath. Dokl. 27 (1), 230–233 (1983)].
V. I. Shmyrev, “An Algorithm for the Search of Equilibrium in a Linear Exchange Model,” Sibir. Mat. Zh. 26 (2), 162–175 (1985) [SiberianMath. J. 26 (2), 288–300 (1985)].
V. I. Shmyrev, “Polyhedral Complementarity Algorithms for Searching an Equilibrium in Linear Models of Competitive Economy,” Diskretn. Anal. Issled. Oper. 21 (2), 84–101 (2014).
N. R. Devanur, C. H. Papadimitriou, A. Saberi, and V. V. Vazirani, “Market Equilibrium via a Primal-Dual Algorithm for a Convex Program,” J. ACM55 (5), 22:1–22:18 (2008).
R. Cole, N. R. Devanur, V. Gkatzelis, K. Jain, T. Mai, V. V. Vazirani, and S. Yazdanbod, “Convex Program Duality, Fisher Markets, and Nash SocialWelfare,” in Proceedings of 18th ACMConference on Economics and Computation, Cambridge, MA, USA, June 26–30, 2017 (ACM, New York, 2017), pp. 459–460.
N. R. Devanur, K. Jain, T. Mai, V. V. Vazirani, and S. Yazdanbod, “New Convex Programs for Fisher’s Market Model and Its Generalizations,” Cornell Univ. Libr. e-Print Archive, arXiv:1603.01257 (2016).
B. Adsul, C. S. Babu, J. Gang, R. Mehta, and M. Sohoni, “A Simplex-LikeAlgorithm for FisherMarkets,” in Algorithmic Game Theory (SAGT 2010) (Proceedings of 3rd International Symposium, Athens, Greece, October 18–20, 2010) (Springer, Heidelberg, 2010), pp. 18–29.
V. I. Shmyrev, “An Algorithm for Finding Equilibrium in the Linear Exchange Model with Fixed Budgets,” Sibir.Zh. Industr. Mat. 11 (2), 139–154 (2008) [J. Appl. Indust. Math. 3 (4), 505–518 (2009)].
V. I. Shmyrev, “An Iterative Approach for Searching an Equilibrium in Piecewise Linear Exchange Model,” in Discrete Optimization and Operations Research: (Proceedings of 9th International Conference DOOR, Vladivostok, Russia, September 19–23, 2016) (Springer, Cham, 2016), pp. 61–72.
J. Gang, R. Mehta, M. Sohoni and N. K. Vishnoi, “Towards Polynomial Simplex-Like Algorithms for Market Equilibria,” in Proceedings of 24th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA, January 6–8, 2013 (SIAM, Philadelphia, PA, 2013), pp. 1226–1242.
V. V. Vazirani, “Spending Constraint Utilities with Applications to the Adwords Market,” Math. Oper. Res. 35 (2), 458–478 (2010).
B. Birnbaum, N.R. Devanur, and L. Xiao, “DistributedAlgorithms via Gradient Descent for FisherMarkets,” in Proceedings of 12th ACM Conference on Electronic Commerce, San Jose, CA, USA, June 5–9, 2011 (ACM, New York, 2011), pp. 127–136.
V. I. Shmyrev, “Polyhedral Complementarity on a Simplex. Potentiality of Regular Mappings,” Sibir. Zh. Industr. Mat. 21 (1), 118–128 (2018) [J. Appl. Indust. Math. 12 (1), 167–176 (2018)].
V. I. Shmyrev, “Polyhedral Complementarity and Fixed Points Problem of Decreasing Regular Mappings on Simplex,” in Optimization and Applications: (Proceedings of VIII International Conference on Optimization Methods and Applications, Petrovac, Montenegro, October 2–7, 2017) (RWTH Aachen Univ., Aachen, 2017), pp. 511–516 (Available at http://ceur-ws.org/Vol-1987, accessed November 15, 2018).
P. S. Aleksandrov, General Homology Theory (Nauka, Moscow, 1979) [in Russian].
L. S. Pontryagin, Fundamentals of Combinatorial Topology (Nauka, Moscow, 1986) [in Russian].
R. T. Rockafellar, Convex Analysis (Princeton Univ. Press, Princeton, 1970; Mir,Moscow, 1973).
Author information
Authors and Affiliations
Corresponding author
Additional information
Russian Text © V.I. Shmyrev, 2019, published in Diskretnyi Analiz i Issledovanie Operatsii, 2019, Vol. 26, No. 1, pp. 114–134.
Rights and permissions
About this article
Cite this article
Shmyrev, V.I. Polyhedral Complementarity on a Simplex: Search for Fixed Points of Decreasing Regular Mappings. J. Appl. Ind. Math. 13, 145–156 (2019). https://doi.org/10.1134/S1990478919010150
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478919010150