Fixed-point computation refers to the process of computing an exact or approximate fixed point of a given function. In its most common form, the given function f {\displaystyle f} satisfies the condition to the Brouwer fixed-point theorem: that is, f {\displaystyle f} is continuous and maps the unit d-cube to itself. The Brouwer fixed-point theorem guarantees that f {\displaystyle f} has a fixed point, but the proof is not constructive. Various algorithms have been devised for computing an approximate fixed point. Such algorithms are used in economics for computing a market equilibrium, in game theory for computing a Nash equilibrium, and in dynamic system analysis.