|
Discrete Fixed-point Theorem
In discrete mathematics, a discrete fixed-point is a fixed-point for functions defined on finite sets, typically subsets of the integer grid \mathbb^n. Discrete fixed-point theorems were developed by Iimura, Murota and Tamura, Chen and Deng and others. Yang provides a survey. Basic concepts Continuous fixed-point theorems often require a continuous function. Since continuity is not meaningful for functions on discrete sets, it is replaced by conditions such as a direction-preserving function. Such conditions imply that the function does not change too drastically when moving between neighboring points of the integer grid. There are various direction-preservation conditions, depending on whether neighboring points are considered points of a hypercube (HGDP), of a simplex (SGDP) etc. See the page on direction-preserving function for definitions. Continuous fixed-point theorems often require a convex set. The analogue of this property for discrete sets is an integrally-convex ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Mathematics
Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather than "continuous" (analogously to continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets (finite sets or sets with the same cardinality as the natural numbers). However, there is no exact definition of the term "discrete mathematics". The set of objects studied in discrete mathematics can be finite or infinite. The term finite mathematics is sometimes applied to parts of the field of discrete mathematics that deals with finite se ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Point-to-set Mapping
A set-valued function (or correspondence) is a mathematical function that maps elements from one set, the domain of the function, to subsets of another set. Set-valued functions are used in a variety of mathematical fields, including optimization, control theory and game theory. Set-valued functions are also known as multivalued functions in some references, but herein and in many others references in mathematical analysis, a multivalued function is a set-valued function that has a further continuity property, namely that the choice of an element in the set f(x) defines a corresponding element in each set f(y) for close to , and thus defines locally an ordinary function. Examples The argmax of a function is in general, multivalued. For example, \operatorname_ \cos(x) = \. Set-valued analysis Set-valued analysis is the study of sets in the spirit of mathematical analysis and general topology. Instead of considering collections of only points, set-valued analysis con ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Walrasian Equilibrium
Competitive equilibrium (also called: Walrasian equilibrium) is a concept of economic equilibrium introduced by Kenneth Arrow and Gérard Debreu in 1951 appropriate for the analysis of commodity markets with flexible prices and many traders, and serving as the benchmark of efficiency in economic analysis. It relies crucially on the assumption of a competitive environment where each trader decides upon a quantity that is so small compared to the total quantity traded in the market that their individual transactions have no influence on the prices. Competitive markets are an ideal standard by which other market structures are evaluated. Definitions A competitive equilibrium (CE) consists of two elements: * A price function P. It takes as argument a vector representing a bundle of commodities, and returns a positive real number that represents its price. Usually the price function is linear - it is represented as a vector of prices, a price for each commodity type. * An allocation m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nash Equilibrium
In game theory, the Nash equilibrium, named after the mathematician John Nash, is the most common way to define the solution of a non-cooperative game involving two or more players. In a Nash equilibrium, each player is assumed to know the equilibrium strategies of the other players, and no one has anything to gain by changing only one's own strategy. The principle of Nash equilibrium dates back to the time of Cournot, who in 1838 applied it to competing firms choosing outputs. If each player has chosen a strategy an action plan based on what has happened so far in the game and no one can increase one's own expected payoff by changing one's strategy while the other players keep their's unchanged, then the current set of strategy choices constitutes a Nash equilibrium. If two players Alice and Bob choose strategies A and B, (A, B) is a Nash equilibrium if Alice has no other strategy available that does better than A at maximizing her payoff in response to Bob choosing B, and Bob ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semi-continuity
In mathematical analysis, semicontinuity (or semi-continuity) is a property of extended real-valued functions that is weaker than continuity. An extended real-valued function f is upper (respectively, lower) semicontinuous at a point x_0 if, roughly speaking, the function values for arguments near x_0 are not much higher (respectively, lower) than f\left(x_0\right). A function is continuous if and only if it is both upper and lower semicontinuous. If we take a continuous function and increase its value at a certain point x_0 to f\left(x_0\right) + c for some c>0, then the result is upper semicontinuous; if we decrease its value to f\left(x_0\right) - c then the result is lower semicontinuous. The notion of upper and lower semicontinuous function was first introduced and studied by René Baire in his thesis in 1899. Definitions Assume throughout that X is a topological space and f:X\to\overline is a function with values in the extended real numbers \overline=\R \cup \ = ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Neighbourhood (mathematics)
In topology and related areas of mathematics, a neighbourhood (or neighborhood) is one of the basic concepts in a topological space. It is closely related to the concepts of open set and interior. Intuitively speaking, a neighbourhood of a point is a set of points containing that point where one can move some amount in any direction away from that point without leaving the set. Definitions Neighbourhood of a point If X is a topological space and p is a point in X, then a of p is a subset V of X that includes an open set U containing p, p \in U \subseteq V \subseteq X. This is also equivalent to the point p \in X belonging to the topological interior of V in X. The neighbourhood V need be an open subset X, but when V is open in X then it is called an . Some authors have been known to require neighbourhoods to be open, so it is important to note conventions. A set that is a neighbourhood of each of its points is open since it can be expressed as the union of open sets ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Selection Function
A choice function (selector, selection) is a mathematical function ''f'' that is defined on some collection ''X'' of nonempty Set (mathematics), sets and assigns some element of each set ''S'' in that collection to ''S'' by ''f''(''S''); ''f''(''S'') maps ''S'' to some element of ''S''. In other words, ''f'' is a choice function for ''X'' if and only if it belongs to the direct product of ''X''. An example Let ''X'' = . Then the function that assigns 7 to the set , 9 to , and 2 to is a choice function on ''X''. History and importance Ernst Zermelo (1904) introduced choice functions as well as the axiom of choice (AC) and proved the well-ordering theorem, which states that every set can be well ordering, well-ordered. AC states that every set of nonempty sets has a choice function. A weaker form of AC, the axiom of countable choice (ACω) states that every countable set of nonempty sets has a choice function. However, in the absence of either AC or ACω, some sets c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kakutani Fixed-point Theorem
In mathematical analysis, the Kakutani fixed-point theorem is a fixed-point theorem for set-valued functions. It provides sufficient conditions for a set-valued function defined on a convex set, convex, compact set, compact subset of a Euclidean space to have a fixed point (mathematics), fixed point, i.e. a point which is map (mathematics), mapped to a set containing it. The Kakutani fixed point theorem is a generalization of the Brouwer fixed point theorem. The Brouwer fixed point theorem is a fundamental result in topology which proves the existence of fixed points for continuous function (topology), continuous functions defined on compact, convex subsets of Euclidean spaces. Kakutani's theorem extends this to set-valued functions. The theorem was developed by Shizuo Kakutani in 1941, and was used by John Forbes Nash, Jr., John Nash in his description of Nash equilibrium, Nash equilibria. It has subsequently found widespread application in game theory and economics. Statement K ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Brouwer Fixed-point Theorem
Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. (Bertus) Brouwer. It states that for any continuous function f mapping a compact convex set to itself there is a point x_0 such that f(x_0)=x_0. The simplest forms of Brouwer's theorem are for continuous functions f from a closed interval I in the real numbers to itself or from a closed disk D to itself. A more general form than the latter is for continuous functions from a convex compact subset K of Euclidean space to itself. Among hundreds of fixed-point theorems, Brouwer's is particularly well known, due in part to its use across numerous fields of mathematics. In its original field, this result is one of the key theorems characterizing the topology of Euclidean spaces, along with the Jordan curve theorem, the hairy ball theorem, the invariance of dimension and the Borsuk–Ulam theorem. This gives it a place among the fundamental theorems of topology. The theorem is also used for proving ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fixed Point (mathematics)
A fixed point (sometimes shortened to fixpoint, also known as an invariant point) is a value that does not change under a given transformation. Specifically, in mathematics, a fixed point of a function is an element that is mapped to itself by the function. In physics, the term fixed point can refer to a temperature that can be used as a reproducible reference point, usually defined by a phase change or triple point. Fixed point of a function Formally, is a fixed point of a function if belongs to both the domain and the codomain of , and . For example, if is defined on the real numbers by f(x) = x^2 - 3 x + 4, then 2 is a fixed point of , because . Not all functions have fixed points: for example, , has no fixed points, since is never equal to for any real number. In graphical terms, a fixed point means the point is on the line , or in other words the graph of has a point in common with that line. Fixed-point iteration In numerical analysis, ''fixed-point iter ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics Of Operations Research
''Mathematics of Operations Research'' is a quarterly peer-reviewed scientific journal established in February 1976. It focuses on areas of mathematics relevant to the field of operations research such as continuous optimization, discrete optimization, game theory, machine learning, simulation methodology, and stochastic models. The journal is published by INFORMS (Institute for Operations Research and the Management Sciences). the journal has a 2017 impact factor of 1.078. History The journal was established in 1976. The founding editor-in-chief was Arthur F. Veinott Jr. ( Stanford University). He served until 1980, when the position was taken over by Stephen M. Robinson, who held the position until 1986. Erhan Cinlar served from 1987 to 1992, and was followed by Jan Karel Lenstra (1993-1998). Next was Gérard Cornuéjols (1999-2003) and Nimrod Megiddo (2004-2009). Finally came Uri Rothblum (2009-2012), Jim Dai (2012-2018), and the current editor-in-chief Katya Scheinberg (2 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Poincaré–Miranda Theorem
In mathematics, the Poincaré–Miranda theorem is a generalization of intermediate value theorem, from a single function in a single dimension, to functions in dimensions. It says as follows: ::Consider n continuous functions of n variables, f_1,\ldots, f_n. Assume that for each variable x_i, the function f_i is nonpositive when x_i=-1 and nonnegative when x_i=1. Then there is a point in the n-dimensional cube 1,1n in which all functions are ''simultaneously'' equal to 0. The theorem is named after Henri Poincaré - who conjectured it in 1883, and Carlo Miranda - who in 1940 showed that it is equivalent to the Brouwer fixed-point theorem. It is sometimes called the Miranda theorem or the Bolzano-Poincare-Miranda theorem. Intuitive description The picture on the right shows an illustration of the Poincaré–Miranda theorem for functions. Consider a couple of functions whose domain of definition is (i.e., the unit square). The function is negative on the left boundary and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
