|
Wald's Maximin Model
In decision theory and game theory, Wald's maximin model is a non-probabilistic decision-making model according to which decisions are ranked on the basis of their worst-case outcomes – the optimal decision is one with the least bad worst outcome. It is one of the most important models in robust decision making in general and robust optimization in particular. It is also known by a variety of other titles, such as Wald's maximin rule, Wald's maximin principle, Wald's maximin paradigm, and Wald's maximin criterion. Often 'minimax' is used instead of 'maximin'. Definition This model represents a 2-person game in which the \max player plays first. In response, the second player selects the worst state in S(d), namely a state in S(d) that minimizes the payoff f(d,s) over s in S(d). In many applications the second player represents uncertainty. However, there are maximin models that are completely deterministic. The above model is the ''classic'' format of Wald's maximin model. Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Decision Theory
Decision theory (or the theory of choice; not to be confused with choice theory) is a branch of applied probability theory concerned with the theory of making decisions based on assigning probabilities to various factors and assigning numerical consequences to the outcome. There are three branches of decision theory: # Normative decision theory: Concerned with the identification of optimal decisions, where optimality is often determined by considering an ideal decision-maker who is able to calculate with perfect accuracy and is in some sense fully rational. # Prescriptive decision theory: Concerned with describing observed behaviors through the use of conceptual models, under the assumption that those making the decisions are behaving under some consistent rules. # Descriptive decision theory: Analyzes how individuals actually make the decisions that they do. Decision theory is closely related to the field of game theory and is an interdisciplinary topic, studied by econom ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Maximin (philosophy)
Minimax (sometimes MinMax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, game theory, statistics, and philosophy for ''mini''mizing the possible loss for a worst case (''max''imum loss) scenario. When dealing with gains, it is referred to as "maximin" – to maximize the minimum gain. Originally formulated for several-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of uncertainty. Game theory In general games The maximin value is the highest value that the player can be sure to get without knowing the actions of the other players; equivalently, it is the lowest value the other players can force the player to receive when they know the player's action. Its formal definition is: :\underline = \max_ \min_ Where: * is the index of the player of interest. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simplex Algorithm
In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming. The name of the algorithm is derived from the concept of a simplex and was suggested by T. S. Motzkin. Simplices are not actually used in the method, but one interpretation of it is that it operates on simplicial ''cones'', and these become proper simplices with an additional constraint. The simplicial cones in question are the corners (i.e., the neighborhoods of the vertices) of a geometric object called a polytope. The shape of this polytope is defined by the constraints applied to the objective function. History George Dantzig worked on planning methods for the US Army Air Force during World War II using a desk calculator. During 1946 his colleague challenged him to mechanize the planning process to distract him from taking another job. Dantzig formulated the problem as linear inequalities inspired by the work of Wassily Leontief, however, at that t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Programming
Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear function#As a polynomial function, linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization). More formally, linear programming is a technique for the mathematical optimization, optimization of a linear objective function, subject to linear equality and linear inequality Constraint (mathematics), constraints. Its feasible region is a convex polytope, which is a set defined as the intersection (mathematics), intersection of finitely many Half-space (geometry), half spaces, each of which is defined by a linear inequality. Its objective function is a real number, real-valued affine function, affine (linear) function defined on this polyhedron. A linear programming algorithm finds a point in the polytope where ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear
Linearity is the property of a mathematical relationship (''function'') that can be graphically represented as a straight line. Linearity is closely related to '' proportionality''. Examples in physics include rectilinear motion, the linear relationship of voltage and current in an electrical conductor (Ohm's law), and the relationship of mass and weight. By contrast, more complicated relationships are ''nonlinear''. Generalized for functions in more than one dimension, linearity means the property of a function of being compatible with addition and scaling, also known as the superposition principle. The word linear comes from Latin ''linearis'', "pertaining to or resembling a line". In mathematics In mathematics, a linear map or linear function ''f''(''x'') is a function that satisfies the two properties: * Additivity: . * Homogeneity of degree 1: for all α. These properties are known as the superposition principle. In this definition, ''x'' is not necessarily a real ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Info-gap Decision Theory
Info-gap decision theory seeks to optimize robustness to failure under severe uncertainty,Yakov Ben-Haim, ''Information-Gap Theory: Decisions Under Severe Uncertainty,'' Academic Press, London, 2001.Yakov Ben-Haim, ''Info-Gap Theory: Decisions Under Severe Uncertainty,'' 2nd edition, Academic Press, London, 2006. in particular applying sensitivity analysis of the stability radius type to perturbations in the value of a given estimate of the parameter of interest. It has some connections with Wald's maximin model; some authors distinguish them, others consider them instances of the same principle. It has been developed bYakov Ben-Haim and has found many applications and described as a theory for decision-making under "''severe'' uncertainty". It has been criticized as unsuited for this purpose, and alternatives proposed, including such classical approaches as robust optimization. Summary Info-gap is a theory: it assists in decisions under uncertainty. It does this by using model ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stability Radius
In mathematics, the stability radius of an object (system, function, matrix, parameter) at a given nominal point is the radius of the largest ball, centered at the nominal point, all of whose elements satisfy pre-determined stability conditions. The picture of this intuitive notion is this: where \hat denotes the nominal point, P denotes the space of all possible values of the object p, and the shaded area, P(s), represents the set of points that satisfy the stability conditions. The radius of the blue circle, shown in red, is the stability radius. Abstract definition The formal definition of this concept varies, depending on the application area. The following abstract definition is quite usefulZlobec S. (2009). Nondifferentiable optimization: Parametric programming. Pp. 2607-2615, in ''Encyclopedia of Optimization,'' Floudas C.A and Pardalos, P.M. editors, Springer.Sniedovich, M. (2010). A bird's view of info-gap decision theory. ''Journal of Risk Finance,'' 11(3), 268 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Facility Location , with the goal of sharing costs among clients
{{SIA ...
Facility location is a name given to several different problems in computer science and in game theory: * Facility location problem, the optimal placement of facilities as a function of transportation costs and other factors * Facility location (competitive game), in which competitors simultaneously select facility locations and prices, in order to maximize profit * Facility location (cooperative game) The cooperative facility location game is a cooperative game of cost sharing. The goal is to share the cost of opening new facilities between the clients enjoying these facilities.Kamal Jain and Mohammad Mahdian, "Cost Sharing". Chapter 15 in The g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Minimax Regret
In decision theory, on making decisions under uncertainty—should information about the best course of action arrive ''after'' taking a fixed decision—the human emotional response of regret is often experienced, and can be measured as the value of difference between a made decision and the optimal decision. The theory of regret aversion or anticipated regret proposes that when facing a decision, individuals might ''anticipate'' regret and thus incorporate in their choice their desire to eliminate or reduce this possibility. Regret is a negative emotion with a powerful social and reputational component, and is central to how humans learn from experience and to the human psychology of risk aversion. Conscious anticipation of regret creates a feedback loop that transcends regret from the emotional realm—often modeled as mere human behavior—into the realm of the rational choice behavior that is modeled in decision theory. Description Regret theory is a model in theoretical ec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Leonard Jimmie Savage
Leonard Jimmie Savage (born Leonard Ogashevitz; 20 November 1917 – 1 November 1971) was an American mathematician and statistician. Economist Milton Friedman said Savage was "one of the few people I have met whom I would unhesitatingly call a genius." Education and career Savage was born and grew up in Detroit. He studied at Wayne State University in Detroit before transferring to University of Michigan, where he first majored in chemical engineering, then switched to mathematics, graduating in 1938 with a Bachelor's degree. He continued at the University of Michigan with a PhD on differential geometry in 1941 under the supervision of Sumner Byron Myers. Savage subsequently worked at the Institute for Advanced Study in Princeton, New Jersey, the University of Chicago, the University of Michigan, Yale University, and the Statistical Research Group at Columbia University. Though his thesis advisor was Sumner Myers, he also credited Milton Friedman and W. Allen Wallis Wilson ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Payoff Matrix
In game theory, normal form is a description of a ''game''. Unlike extensive form, normal-form representations are not graphical ''per se'', but rather represent the game by way of a matrix. While this approach can be of greater use in identifying strictly dominated strategies and Nash equilibria, some information is lost as compared to extensive-form representations. The normal-form representation of a game includes all perceptible and conceivable strategies, and their corresponding payoffs, for each player. In static games of complete, perfect information, a normal-form representation of a game is a specification of players' strategy spaces and payoff functions. A strategy space for a player is the set of all strategies available to that player, whereas a strategy is a complete plan of action for every stage of the game, regardless of whether that stage actually arises in play. A payoff function for a player is a mapping from the cross-product of players' strategy spaces to that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Saddle Point
In mathematics, a saddle point or minimax point is a point on the surface of the graph of a function where the slopes (derivatives) in orthogonal directions are all zero (a critical point), but which is not a local extremum of the function. An example of a saddle point is when there is a critical point with a relative minimum along one axial direction (between peaks) and at a relative maximum along the crossing axis. However, a saddle point need not be in this form. For example, the function f(x,y) = x^2 + y^3 has a critical point at (0, 0) that is a saddle point since it is neither a relative maximum nor relative minimum, but it does not have a relative maximum or relative minimum in the y-direction. The name derives from the fact that the prototypical example in two dimensions is a surface that ''curves up'' in one direction, and ''curves down'' in a different direction, resembling a riding saddle or a mountain pass between two peaks forming a landform saddle. In te ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
