Fixed point search in a discrete monotone decreasing operator

详细信息    查看全文

• 作者：I. A. Bashlaeva ; V. N. Lebedev
• 刊名：Automation and Remote Control
• 出版年：2016
• 出版时间：April 2016
• 年：2016
• 卷：77
• 期：4
• 页码：708-715
• 全文大小：304 KB
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Calculus of Variations and Optimal Control
  Systems Theory and Control
  Automation and Robotics
  Mechanical Engineering
  Computer-Aided Engineering and Design
  Russian Library of Science
  
• 出版者：MAIK Nauka/Interperiodica distributed exclusively by Springer Science+Business Media LLC.
• ISSN：1608-3032
• 卷排序：77

文摘

This paper analyzes the computational complexity of fixed point search in a nonincreasing additive operator. A power algorithm determining a fixed point is proposed. A constructive proof of fixed point existence is given in a special case of a nonincreasing additive bounded-variation operator. Possible applications include voluntary financing of public good, the Cournot oligopoly and others.Original Russian Text © I.A. Bashlaeva, V.N. Lebedev, 2012, published in Matematicheskaya Teoriya Igr i Ee Prilozheniya, 2012, No. 3, pp. 21–32.