|
Stochastic Transitivity
Stochastic transitivity models are stochastic versions of the transitivity property of binary relations studied in mathematics. Several models of stochastic transitivity exist and have been used to describe the probabilities involved in experiments of paired comparisons, specifically in scenarios where transitivity is expected, however, empirical observations of the binary relation is probabilistic. For example, players' skills in a sport might be expected to be transitive, i.e. "if player A is better than B and B is better than C, then player A must be better than C"; however, in any given match, a weaker player might still end up winning with a positive probability. Tightly matched players might have a higher chance of observing this inversion while players with large differences in their skills might only see these inversions happen seldom. Stochastic transitivity models formalize such relations between the probabilities (e.g. of an outcome of a match) and the underlying transit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stochastic
Stochastic (, ) refers to the property of being well described by a random probability distribution. Although stochasticity and randomness are distinct in that the former refers to a modeling approach and the latter refers to phenomena themselves, these two terms are often used synonymously. Furthermore, in probability theory, the formal concept of a '' stochastic process'' is also referred to as a ''random process''. Stochasticity is used in many different fields, including the natural sciences such as biology, chemistry, ecology, neuroscience, and physics, as well as technology and engineering fields such as image processing, signal processing, information theory, computer science, cryptography, and telecommunications. It is also used in finance, due to seemingly random changes in financial markets as well as in medicine, linguistics, music, media, colour theory, botany, manufacturing, and geomorphology. Etymology The word ''stochastic'' in English was originally used as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Preference
In psychology, economics and philosophy, preference is a technical term usually used in relation to choosing between alternatives. For example, someone prefers A over B if they would rather choose A than B. Preferences are central to decision theory because of this relation to behavior. Some methods such as Ordinal Priority Approach use preference relation for decision-making. As connative states, they are closely related to desires. The difference between the two is that desires are directed at one object while preferences concern a comparison between two alternatives, of which one is preferred to the other. In insolvency, the term is used to determine which outstanding obligation the insolvent party has to settle first. Psychology In psychology, preferences refer to an individual's attitude towards a set of objects, typically reflected in an explicit decision-making process (Lichtenstein & Slovic, 2006). The term is also used to mean evaluative judgment in the sense of lik ... [...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 economi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nontransitive Game
In game theory, an intransitive or non-transitive game is the one in which the various strategies produce one or more "loops" of preferences. In a non- transitive game in which strategy A is preferred over strategy B, and strategy B is preferred over strategy C, strategy A is ''not'' necessarily preferred over strategy C. A prototypical example non-transitive game is the game rock, paper, scissors which is explicitly constructed as a non-transitive game. In probabilistic games like Penney's game, the violation of transitivity results in a more subtle way, and is often presented as a probability paradox. Examples * Rock, paper, scissors * Penney's game * Intransitive dice * Street Fighter , commonly abbreviated as ''SF'' or スト (''Suto''), is a Japanese media franchise centered on a series of fighting video and arcade games developed and published by Capcom. The first game in the series was released in 1987, followed by six .... The videogame franchise that introduc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
NP-hardness
In computational complexity theory, NP-hardness ( non-deterministic polynomial-time hardness) is the defining property of a class of problems that are informally "at least as hard as the hardest problems in NP". A simple example of an NP-hard problem is the subset sum problem. A more precise specification is: a problem ''H'' is NP-hard when every problem ''L'' in NP can be reduced in polynomial time to ''H''; that is, assuming a solution for ''H'' takes 1 unit time, ''H''s solution can be used to solve ''L'' in polynomial time. As a consequence, finding a polynomial time algorithm to solve any NP-hard problem would give polynomial time algorithms for all the problems in NP. As it is suspected that P≠NP, it is unlikely that such an algorithm exists. It is suspected that there are no polynomial-time algorithms for NP-hard problems, but that has not been proven. Moreover, the class P, in which all problems can be solved in polynomial time, is contained in the NP class. Def ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Invertible Function
In mathematics, the inverse function of a function (also called the inverse of ) is a function that undoes the operation of . The inverse of exists if and only if is bijective, and if it exists, is denoted by f^ . For a function f\colon X\to Y, its inverse f^\colon Y\to X admits an explicit description: it sends each element y\in Y to the unique element x\in X such that . As an example, consider the real-valued function of a real variable given by . One can think of as the function which multiplies its input by 5 then subtracts 7 from the result. To undo this, one adds 7 to the input, then divides the result by 5. Therefore, the inverse of is the function f^\colon \R\to\R defined by f^(y) = \frac . Definitions Let be a function whose domain is the set , and whose codomain is the set . Then is ''invertible'' if there exists a function from to such that g(f(x))=x for all x\in X and f(g(y))=y for all y\in Y. If is invertible, then there is exactly one function sat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gérard Debreu
Gérard Debreu (; 4 July 1921 – 31 December 2004) was a French-born economist and mathematician. Best known as a professor of economics at the University of California, Berkeley, where he began work in 1962, he won the 1983 Nobel Memorial Prize in Economic Sciences. Biography His father was the business partner of his maternal grandfather in lace manufacturing, a traditional industry in Calais. Debreu was orphaned at an early age, as his father committed suicide and his mother died of natural causes. Prior to the start of World War II, he received his baccalauréat and went to Ambert to begin preparing for the entrance examination of a grande école. Later on, he moved from Ambert to Grenoble to complete his preparation, both places being in Vichy France during World War II. In 1941, he was admitted to the École Normale Supérieure in Paris, along with Marcel Boiteux. He was influenced by Henri Cartan and the Bourbaki writers. When he was about to take the final examinati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Learning To Rank
Learning to rank. Slides from Tie-Yan Liu's talk at WWW 2009 conference aravailable online or machine-learned ranking (MLR) is the application of machine learning, typically supervised, semi-supervised or reinforcement learning, in the construction of ranking models for information retrieval systems. Training data consists of lists of items with some partial order specified between items in each list. This order is typically induced by giving a numerical or ordinal score or a binary judgment (e.g. "relevant" or "not relevant") for each item. The goal of constructing the ranking model is to rank new, unseen lists in a similar way to rankings in the training data. Applications In information retrieval Ranking is a central part of many information retrieval problems, such as document retrieval, collaborative filtering, sentiment analysis, and online advertising. A possible architecture of a machine-learned search engine is shown in the accompanying figure. Training data c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Debreu Theorems
In economics, the Debreu theorems are several statements about the representation of a preference ordering by a real-valued function. The theorems were proved by Gerard Debreu during the 1950s. Background Suppose a person is asked questions of the form "Do you prefer A or B?" (when A and B can be options, actions to take, states of the world, consumption bundles, etc.). All the responses are recorded. Then, preferences of that person are represented by a numeric ''utility function'', such that the utility of option A is larger than option B if and only if the agent prefers A to B. The Debreu theorems come to answer the following basic question: what conditions on the preference relation of the agent guarantee that such representative utility function can be found? Existence of ordinal utility function The 1954 Theorems say, roughly, that every preference relation which is complete, transitive and continuous, can be represented by a continuous ordinal utility function. St ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Von Neumann–Morgenstern Utility Theorem
In decision theory, the von Neumann–Morgenstern (VNM) utility theorem shows that, under certain axioms of rational behavior, a decision-maker faced with risky (probabilistic) outcomes of different choices will behave as if he or she is maximizing the expected value of some function defined over the potential outcomes at some specified point in the future. This function is known as the von Neumann–Morgenstern utility function. The theorem is the basis for expected utility theory. In 1947, John von Neumann and Oskar Morgenstern proved that any individual whose preferences satisfied four axioms has a utility function; Neumann, John von and Morgenstern, Oskar, '' Theory of Games and Economic Behavior''. Princeton, NJ. Princeton University Press, 1953. such an individual's preferences can be represented on an interval scale and the individual will always prefer actions that maximize expected utility. That is, they proved that an agent is (VNM-)rational ''if and only if'' there ex ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rational Choice Theory
Rational choice theory refers to a set of guidelines that help understand economic and social behaviour. The theory originated in the eighteenth century and can be traced back to political economist and philosopher, Adam Smith. The theory postulates that an individual will perform a cost-benefit analysis to determine whether an option is right for them.Gary Browning, Abigail Halcli, Frank Webster (2000). ''Understanding Contemporary Society: Theories of the Present'', London: SAGE Publications. It also suggests that an individual's self-driven rational actions will help better the overall economy. Rational choice theory looks at three concepts: rational actors, self interest and the invisible hand. Rationality can be used as an assumption for the behaviour of individuals in a wide range of contexts outside of economics. It is also used in political science, sociology, and philosophy. Overview The basic premise of rational choice theory is that the decisions made by individu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transitive Relation
In mathematics, a relation on a set is transitive if, for all elements , , in , whenever relates to and to , then also relates to . Each partial order as well as each equivalence relation needs to be transitive. Definition A homogeneous relation on the set is a ''transitive relation'' if, :for all , if and , then . Or in terms of first-order logic: :\forall a,b,c \in X: (aRb \wedge bRc) \Rightarrow aRc, where is the infix notation for . Examples As a non-mathematical example, the relation "is an ancestor of" is transitive. For example, if Amy is an ancestor of Becky, and Becky is an ancestor of Carrie, then Amy, too, is an ancestor of Carrie. On the other hand, "is the birth parent of" is not a transitive relation, because if Alice is the birth parent of Brenda, and Brenda is the birth parent of Claire, then this does not imply that Alice is the birth parent of Claire. What is more, it is antitransitive: Alice can ''never'' be the birth parent of Claire. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
