Skip to main content
SpringerLink
Log in

Fixed point search in a discrete monotone decreasing operator

  • Mathematical Game Theory and Applications
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Vorob’ev, N.N., The Present State of the Theory of Games, Russ. Math. Surv., 1970, vol. 25, no. 2, pp. 77–136.

    Article  MathSciNet  MATH  Google Scholar 

  2. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translated under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1984.

    MATH  Google Scholar 

  3. Lebedev, V.N. and Chernichkin, M.S., Game Aspect of Program Verification, Izv. RAN, Teor. Sist. Upravlen., 2005, no. 5, pp. 40–45.

    MathSciNet  MATH  Google Scholar 

  4. Owen, G., Game Theory, Philadelphia: Saunders, 1968. Translated under the title Teoriya igr, Moscow: Mir, 1971.

    MATH  Google Scholar 

  5. Emerson, E.A., Jutla, C.S., and Sistla, A.P., On Model-Checking for Fragments of μ-Calculus, Fifth Int. Conf. on Computer Aided Verification, Elounda, Greece, 1993.

    Google Scholar 

  6. Kukushkin, N.S., A Fixed-Point Theorem for Decreasing Mappings, Econom. Lett., 1994, vol. 46, pp. 23–26.

    Article  MathSciNet  MATH  Google Scholar 

  7. Kukushkin, N.S., Best Response Dynamics in Finite Games with Additive Aggregation, Games Econom. Behav., 2004, vol. 48, no. 1, pp. 94–110.

    Article  MathSciNet  MATH  Google Scholar 

  8. Kukushkin, N.S., A Fixed-Point Theorem for Decreasing Mappings, Moscow: Vychisl. Tsentr RAN, 2012.

    MATH  Google Scholar 

  9. Novshek, W., On the Existence of Cournot Equilibrium, Rev. Econom. Stud., 1985, vol. 52, pp. 85–98.

    Article  MathSciNet  MATH  Google Scholar 

  10. Tarski, A., A Lattice-Theoretical Fixpoint Theorem and Its Applications, Pacific J. Math., 1955, vol. 5, pp. 285–309.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Volgograd State University, Volgograd, Russia

    I. A. Bashlaeva & V. N. Lebedev

Authors
  1. I. A. Bashlaeva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. N. Lebedev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. A. Bashlaeva.

Additional information

Original Russian Text © I.A. Bashlaeva, V.N. Lebedev, 2012, published in Matematicheskaya Teoriya Igr i Ee Prilozheniya, 2012, No. 3, pp. 21–32.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bashlaeva, I.A., Lebedev, V.N. Fixed point search in a discrete monotone decreasing operator. Autom Remote Control 77, 708–715 (2016). https://doi.org/10.1134/S0005117916040147

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117916040147

Keywords

Search

Navigation