Polyhedral Complementarity on a Simplex: Search for Fixed Points of Decreasing Regular Mappings

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)145-156
Number of pages12
JournalJournal of Applied and Industrial Mathematics
Volume13
Issue number1
DOIs
Publication statusPublished - 1 Jan 2019

Keywords

  • algorithm
  • complementarity
  • fixed point
  • monotonicity
  • polyhedral complex
  • potentiality
  • suboptimization

Fingerprint

Dive into the research topics of 'Polyhedral Complementarity on a Simplex: Search for Fixed Points of Decreasing Regular Mappings'. Together they form a unique fingerprint.

Cite this