|
Stochastic Dominance
Stochastic dominance is a partial order between random variables. It is a form of stochastic ordering In probability theory and statistics, a stochastic order quantifies the concept of one random variable being "bigger" than another. These are usually partial orders, so that one random variable A may be neither stochastically greater than, less t .... The concept arises in decision theory and decision analysis in situations where one gamble (a probability distribution over possible outcomes, also known as prospects) can be ranked as superior to another gamble for a broad class of decision-makers. It is based on shared preference (economics), preferences regarding sets of possible outcomes and their associated probabilities. Only limited knowledge of preferences is required for determining dominance. Risk aversion is a factor only in second order stochastic dominance. Stochastic dominance does not give a total order, but rather only a partial order: for some pairs of gambles, nei ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partially Ordered Set
In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering. The relation itself is called a "partial order." The word ''partial'' in the names "partial order" and "partially ordered set" is used as an indication that not every pair of elements needs to be comparable. That is, there may be pairs of elements for which neither element precedes the other in the poset. Partial orders thus generalize total orders, in which every pair is comparable. Informal definition A partial order defines a notion of comparison. Two elements ''x'' and ''y'' may stand in any of four mutually exclusive relationships to each other: either ''x'' ''y'', or ''x'' and ''y'' are ''inc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inverse Transform Sampling
Inverse transform sampling (also known as inversion sampling, the inverse probability integral transform, the inverse transformation method, Smirnov transform, or the golden ruleAalto University, N. Hyvönen, Computational methods in inverse problems. Twelfth lecture https://noppa.tkk.fi/noppa/kurssi/mat-1.3626/luennot/Mat-1_3626_lecture12.pdf) is a basic method for pseudo-random number sampling, i.e., for generating sample numbers at random from any probability distribution given its cumulative distribution function. Inverse transformation sampling takes uniform samples of a number u between 0 and 1, interpreted as a probability, and then returns the largest number x from the domain of the distribution P(X) such that P(-\infty , e.g. from U \sim \mathrm ,1 #Find the inverse of the desired CDF, e.g. F_X^(x). # Compute X=F_X^(u). The computed random variable X has distribution F_X(x). Expressed differently, given a continuous uniform variable U in ,1/math> and an invertible cumu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Management Science (journal)
''For the theoretical and practical problem-solving subfield of Management, see Management Science.'' ''Management Science'' is a peer-reviewed academic journal that covers research on all aspects of management related to strategy, entrepreneurship, innovation, information technology, and organizations as well as all functional areas of business, such as accounting, finance, marketing, and operations. It is published by the Institute for Operations Research and the Management Sciences and was established in 1954 by the institute's precursor, the Institute of Management Sciences. C. West Churchman was the founding editor-in-chief. According to the ''Journal Citation Reports'', the journal has a 2018 impact factor of 4.219. Editors-in-chief The following persons are, or have been, editors-in-chief: *2018–2020: David Simchi-Levi *2014–2018: Teck-Hua Ho *2009–2014: Gérard Cachon *2003–2008: Wallace Hopp *1997–2002: Hau L. Lee *1993–1997: Gabriel R. Bitran *1983–19 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monotonic Function
In mathematics, a monotonic function (or monotone function) is a function between ordered sets that preserves or reverses the given order. This concept first arose in calculus, and was later generalized to the more abstract setting of order theory. In calculus and analysis In calculus, a function f defined on a subset of the real numbers with real values is called ''monotonic'' if and only if it is either entirely non-increasing, or entirely non-decreasing. That is, as per Fig. 1, a function that increases monotonically does not exclusively have to increase, it simply must not decrease. A function is called ''monotonically increasing'' (also ''increasing'' or ''non-decreasing'') if for all x and y such that x \leq y one has f\!\left(x\right) \leq f\!\left(y\right), so f preserves the order (see Figure 1). Likewise, a function is called ''monotonically decreasing'' (also ''decreasing'' or ''non-increasing'') if, whenever x \leq y, then f\!\left(x\right) \geq f\!\left(y\r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lagrange Multiplier
In mathematical optimization, the method of Lagrange multipliers is a strategy for finding the local maxima and minima of a function subject to equality constraints (i.e., subject to the condition that one or more equations have to be satisfied exactly by the chosen values of the variables). It is named after the mathematician Joseph-Louis Lagrange. The basic idea is to convert a constrained problem into a form such that the derivative test of an unconstrained problem can still be applied. The relationship between the gradient of the function and gradients of the constraints rather naturally leads to a reformulation of the original problem, known as the Lagrangian function. The method can be summarized as follows: in order to find the maximum or minimum of a function f(x) subjected to the equality constraint g(x) = 0, form the Lagrangian function :\mathcal(x, \lambda) = f(x) + \lambda g(x) and find the stationary points of \mathcal considered as a function of x and the Lagrange m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stochastic Programming
In the field of mathematical optimization, stochastic programming is a framework for modeling optimization problems that involve uncertainty. A stochastic program is an optimization problem in which some or all problem parameters are uncertain, but follow known probability distributions. This framework contrasts with deterministic optimization, in which all problem parameters are assumed to be known exactly. The goal of stochastic programming is to find a decision which both optimizes some criteria chosen by the decision maker, and appropriately accounts for the uncertainty of the problem parameters. Because many real-world decisions involve uncertainty, stochastic programming has found applications in a broad range of areas ranging from finance to transportation to energy optimization. Two-stage problems The basic idea of two-stage stochastic programming is that (optimal) decisions should be based on data available at the time the decisions are made and cannot depend on future ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Optimization
Mathematical optimization (alternatively spelled ''optimisation'') or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems of sorts arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries. In the more general approach, an optimization problem consists of maximizing or minimizing a real function by systematically choosing input values from within an allowed set and computing the value of the function. The generalization of optimization theory and techniques to other formulations constitutes a large area of applied mathematics. More generally, optimization includes finding "best available" values of some objective function given a defi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Risk Premium
A risk premium is a measure of excess return that is required by an individual to compensate being subjected to an increased level of risk. It is used widely in finance and economics, the general definition being the expected risky return less the risk-free return, as demonstrated by the formula below. Risk \ premium = E(r) - r_f Where E(r) is the risky expected rate of return and r_f is the risk-free return. The inputs for each of these variables and the ultimate interpretation of the risk premium value differs depending on the application as explained in the following sections. Regardless of the application, the market premium can be volatile as both comprising variables can be impacted independent of each other by both cyclical and abrupt changes. This means that the market premium is dynamic in nature and ever-changing. Additionally, a general observation regardless of application is that the risk premium is larger during economic downturns and during periods of increased ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Risk Premium
A risk premium is a measure of excess return that is required by an individual to compensate being subjected to an increased level of risk. It is used widely in finance and economics, the general definition being the expected risky return less the risk-free return, as demonstrated by the formula below. Risk \ premium = E(r) - r_f Where E(r) is the risky expected rate of return and r_f is the risk-free return. The inputs for each of these variables and the ultimate interpretation of the risk premium value differs depending on the application as explained in the following sections. Regardless of the application, the market premium can be volatile as both comprising variables can be impacted independent of each other by both cyclical and abrupt changes. This means that the market premium is dynamic in nature and ever-changing. Additionally, a general observation regardless of application is that the risk premium is larger during economic downturns and during periods of increased ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Skewness
In probability theory and statistics, skewness is a measure of the asymmetry of the probability distribution of a real-valued random variable about its mean. The skewness value can be positive, zero, negative, or undefined. For a unimodal distribution, negative skew commonly indicates that the ''tail'' is on the left side of the distribution, and positive skew indicates that the tail is on the right. In cases where one tail is long but the other tail is fat, skewness does not obey a simple rule. For example, a zero value means that the tails on both sides of the mean balance out overall; this is the case for a symmetric distribution, but can also be true for an asymmetric distribution where one tail is long and thin, and the other is short but fat. Introduction Consider the two distributions in the figure just below. Within each graph, the values on the right side of the distribution taper differently from the values on the left side. These tapering sides are called ''tai ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mean-preserving Spread
In probability and statistics, a mean-preserving spread (MPS) is a change from one probability distribution A to another probability distribution B, where B is formed by spreading out one or more portions of A's probability density function or probability mass function while leaving the mean (the expected value) unchanged. As such, the concept of mean-preserving spreads provides a stochastic ordering of equal-mean gambles (probability distributions) according to their degree of risk; this ordering is partial, meaning that of two equal-mean gambles, it is not necessarily true that either is a mean-preserving spread of the other. Distribution A is said to be a mean-preserving contraction of B if B is a mean-preserving spread of A. Ranking gambles by mean-preserving spreads is a special case of ranking gambles by second-order stochastic dominance – namely, the special case of equal means: If B is a mean-preserving spread of A, then A is second-order stochastically dom ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Concave Function
In mathematics, a concave function is the negative of a convex function. A concave function is also synonymously called concave downwards, concave down, convex upwards, convex cap, or upper convex. Definition A real-valued function f on an interval (or, more generally, a convex set in vector space) is said to be ''concave'' if, for any x and y in the interval and for any \alpha \in ,1/math>, :f((1-\alpha )x+\alpha y)\geq (1-\alpha ) f(x)+\alpha f(y) A function is called ''strictly concave'' if :f((1-\alpha )x + \alpha y) > (1-\alpha) f(x) + \alpha f(y)\, for any \alpha \in (0,1) and x \neq y. For a function f: \mathbb \to \mathbb, this second definition merely states that for every z strictly between x and y, the point (z, f(z)) on the graph of f is above the straight line joining the points (x, f(x)) and (y, f(y)). A function f is quasiconcave if the upper contour sets of the function S(a)=\ are convex sets. Properties Functions of a single variable # A differentia ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
