Find link

language:

Find link is a tool written by Edward Betts.

searching for Decision problem 116 found (636 total)

Bellman equation (4,004 words) [view diff] exact match in snippet view article find links to article

of a decision problem at a certain point in time in terms of the payoff from some initial choices and the "value" of the remaining decision problem that

Warren Goldfarb (369 words) [view diff] exact match in snippet view article find links to article

history of analytic philosophy and in logic, most notably the classical decision problem. He received his A.B. and philosophy Ph.D. from Harvard University

Partially observable Markov decision process (3,306 words) [view diff] no match in snippet view article find links to article

A partially observable Markov decision process (POMDP) is a generalization of a Markov decision process (MDP). A POMDP models an agent decision process

Counting problem (complexity) (169 words) [view diff] exact match in snippet view article

c_{R}(x)\}} denotes the corresponding decision problem. Note that cR is a search problem while #R is a decision problem, however cR can be C Cook-reduced

Alonzo Church (2,245 words) [view diff] exact match in snippet view article find links to article

Church–Turing thesis, proving the unsolvability of the Entscheidungsproblem ("decision problem"), the Frege–Church ontology, and the Church–Rosser theorem. Alongside

Ellipsoid method (3,704 words) [view diff] exact match in snippet view article find links to article

to the binary decision problem: "is there a z ≥ 0 such that Rz ≤ r?". This can be done as follows. If the answer to the decision problem is "no", then

Analytic hierarchy process (5,942 words) [view diff] exact match in snippet view article find links to article

provides a comprehensive and rational framework for structuring a decision problem, for representing and quantifying its elements, for relating those

Backward induction (3,605 words) [view diff] no match in snippet view article find links to article

Backward induction is the process of determining a sequence of optimal choices by reasoning from the endpoint of a problem or situation back to its beginning

Harry R. Lewis (4,524 words) [view diff] case mismatch in snippet view article find links to article

logic. His doctoral thesis, "Herbrand Expansions and Reductions of the Decision Problem", was supervised by Burton Dreben and dealt with Herbrand's theorem

Analytic network process (1,727 words) [view diff] exact match in snippet view article find links to article

process (AHP) used in multi-criteria decision analysis. AHP structures a decision problem into a hierarchy with a goal, decision criteria, and alternatives,

Bernstein–Vazirani algorithm (1,225 words) [view diff] exact match in snippet view article find links to article

separation between BQP and BPP, the problem must be reshaped into a decision problem (as these complexity classes refer to decision problems). This is accomplished

Yuri Gurevich (836 words) [view diff] exact match in snippet view article find links to article

1982. The best-known work of his Soviet period is on the classical decision problem. In Israel, Gurevich worked with Saharon Shelah on monadic second-order

Utility maximization problem (2,267 words) [view diff] exact match in snippet view article find links to article

my money in order to maximize my utility?" It is a type of optimal decision problem. It consists of choosing how much of each available good or service

Speedup theorem (105 words) [view diff] exact match in snippet view article find links to article

that the space and time requirements of a Turing machine solving a decision problem can be reduced by a multiplicative constant factor. Blum's speedup

Recursive competitive equilibrium (234 words) [view diff] exact match in snippet view article find links to article

the equilibrium associated with dynamic programs that represent the decision problem when agents must distinguish between aggregate and individual state

Independent set (graph theory) (3,561 words) [view diff] exact match in snippet view article

included among all the maximal independent sets. In the independent set decision problem, the input is an undirected graph and a number k, and the output is

Decision quality (1,124 words) [view diff] exact match in snippet view article find links to article

quality is framing. Having the appropriate frame ensures the right decision problem is addressed. Quality in framing is achieved when the decision makers

Formula game (234 words) [view diff] exact match in snippet view article find links to article

} . FORMULA-GAME is PSPACE-complete because it is exactly the same decision problem as True quantified Boolean formula. Player E has a winning strategy

Dana Scott (1,335 words) [view diff] case mismatch in snippet view article find links to article

Rabin, a colleague from Princeton, titled Finite Automata and Their Decision Problem (Scott and Rabin 1959) which introduced the idea of nondeterministic

Preference ranking organization method for enrichment evaluation (2,470 words) [view diff] exact match in snippet view article find links to article

provides a comprehensive and rational framework for structuring a decision problem, identifying and quantifying its conflicts and synergies, clusters

Decision-making software (937 words) [view diff] exact match in snippet view article find links to article

necessary to have a sound knowledge of the adopted methodology and of the decision problem at hand." As mentioned earlier, most DM software is based on multi-criteria

Burton Dreben (1,856 words) [view diff] exact match in snippet view article find links to article

writings. In the 1970s, Dreben and Warren Goldfarb wrote a book on the decision problem. From 1978 onwards, Dreben gave a series of lectures at Harvard which

Minimum degree spanning tree (341 words) [view diff] exact match in snippet view article find links to article

That is, it is a spanning tree whose maximum degree is minimal. The decision problem is: Given a graph G and an integer k, does G have a spanning tree such

Dodgson's method (344 words) [view diff] exact match in snippet view article find links to article

article only directly proves NP-hardness, but it is clear that the decision problem is in NP since given a candidate and a list of k swaps, you can tell

Algorithm (6,907 words) [view diff] exact match in snippet view article find links to article

algorithms began with attempts to solve the Entscheidungsproblem (decision problem) posed by David Hilbert. Later formalizations were framed as attempts

Learning with errors (3,411 words) [view diff] exact match in snippet view article find links to article

version can be solved easily: just feed the input samples for the decision problem to the solver for the search problem. Denote the given samples by {

Blocks world (626 words) [view diff] exact match in snippet view article find links to article

Descriptions from Examples and Copy Demo Gerald Jay Sussman's Sussman anomaly Decision problem (Gupta and Nau, 1992): Given a starting Blocks World, an ending Blocks

Francisco Dória (1,000 words) [view diff] exact match in snippet view article find links to article

within classical set theory, is incomplete in the sense of Gödel. The decision problem for chaotic dynamical systems had been formulated by mathematician

Numerical 3-dimensional matching (689 words) [view diff] exact match in snippet view article find links to article

Numerical 3-dimensional matching is an NP-complete decision problem. It is given by three multisets of integers X {\displaystyle X} , Y {\displaystyle

Real closed field (2,984 words) [view diff] exact match in snippet view article find links to article

quantifier elimination are intrinsically double exponential. For the decision problem, Ben-Or, Kozen, and Reif (1986) claimed to have proved that the theory

Randomised decision rule (2,239 words) [view diff] exact match in snippet view article find links to article

minimaxity and Bayes. This shall be illustrated in the case of a finite decision problem, i.e. a problem where the parameter space is a finite set of, say,

Gap reduction (1,183 words) [view diff] exact match in snippet view article find links to article

complexity theory, a gap reduction is a reduction to a particular type of decision problem, known as a c-gap problem. Such reductions provide information about

Decision-making paradox (837 words) [view diff] exact match in snippet view article find links to article

descriptive, yield different results, when fed with exactly the same decision problem and data.[citation needed] It has been recognized in the related literature

Moses Schönfinkel (945 words) [view diff] exact match in snippet view article find links to article

Schönfinkel had one other paper published, on special cases of the decision problem (Entscheidungsproblem), that was prepared by Paul Bernays. After he

Linear logic (2,979 words) [view diff] exact match in snippet view article find links to article

in full CLL is undecidable. When considering fragments of CLL, the decision problem has varying complexity: Multiplicative linear logic (MLL): only the

James Renegar (1,009 words) [view diff] exact match in snippet view article find links to article

Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals". Journal of Symbolic Computation

Frank Ramsey (mathematician) (4,296 words) [view diff] exact match in snippet view article

the way to his true goal in the paper, solving a special case of the decision problem for first-order logic, namely the decidability of what is now called

Computer hardware (4,448 words) [view diff] exact match in snippet view article find links to article

type of computer, proving that no computer would be able to solve the decision problem. The universal Turing machine was a type of stored-program computer

Constrained conditional model (1,502 words) [view diff] exact match in snippet view article find links to article

question answering. In all these cases, it is natural to formulate the decision problem as a constrained optimization problem, with an objective function that

Two-moment decision model (1,244 words) [view diff] exact match in snippet view article find links to article

before observing the market realization p of the product's price. Its decision problem is to choose q so as to maximize the expected utility of profit: Maximize

Hydrological optimization (794 words) [view diff] exact match in snippet view article find links to article

to find the best solution. Contaminant remediation in aquifers. The decision problem is where to locate wells, and choose a pumping rate, to minimize the

Interval scheduling (2,546 words) [view diff] exact match in snippet view article find links to article

intervals in which it can be executed. The group interval scheduling decision problem (GISDP) is to decide whether there exists a compatible set in which

Emil Leon Post (1,397 words) [view diff] exact match in snippet view article find links to article

Post, Emil L. (1943). "Formal reductions of the general combinatorial decision problem". American Journal of Mathematics. 65 (2): 197–215. doi:10.2307/2371809

List of cognitive biases (10,092 words) [view diff] exact match in snippet view article find links to article

a bad outcome with a decision problem, the tendency to avoid the choice previously made when faced with the same decision problem again, even though the

Bidding box (1,962 words) [view diff] exact match in snippet view article find links to article

wait for a while with his bid, regardless whether they have a bidding decision problem or not. The Tournament Director card is held high in the hand when

Roger Lyndon (807 words) [view diff] case mismatch in snippet view article find links to article

coauthor of the books: Notes on Logic (Van Nostrand, 1967) Word Problems: Decision Problem in Group Theory (with W. W. Boone and F.B. Cannonito, North-Holland

Pseudo-polynomial transformation (1,044 words) [view diff] exact match in snippet view article find links to article

{\displaystyle \Pi _{1}} is a strongly NP-complete decision problem, Π 2 {\displaystyle \Pi _{2}} is a decision problem in NP, and there exists a pseudo-polynomial

Bayes factor (2,505 words) [view diff] exact match in snippet view article find links to article

often biased. Other approaches are: to treat model comparison as a decision problem, computing the expected value or cost of each model choice; to use

Dynamic programming (9,283 words) [view diff] exact match in snippet view article find links to article

{\displaystyle 0<a<1} . Assume capital cannot be negative. Then the consumer's decision problem can be written as follows: max ∑ t = 0 T b t ln ⁡ ( c t ) {\displaystyle

Samuel Bowles (economist) (2,224 words) [view diff] exact match in snippet view article

cases, "[i]ncentives undermine ethical motives" as they "may frame a decision problem and thereby suggest self-interest as appropriate behavior". Simply

Phokion G. Kolaitis (630 words) [view diff] exact match in snippet view article find links to article

ACM Transactions on Database Systems (TODS) 30 (4), 994-1055 On the decision problem for two-variable first-order logic, E Grädel, PG Kolaitis, MY Vardi

Decision theory (3,216 words) [view diff] exact match in snippet view article find links to article

testing and parameter estimation, are special cases of the general decision problem. Wald's paper renewed and synthesized many concepts of statistical

Decision theory (3,216 words) [view diff] exact match in snippet view article find links to article

testing and parameter estimation, are special cases of the general decision problem. Wald's paper renewed and synthesized many concepts of statistical

Herbert York (826 words) [view diff] case mismatch in snippet view article find links to article

2014-09-20. Retrieved 2014-05-15. Dyson, George (2013-07-27). "The Decision Problem". Edge. "Obituary of Herbert Frank York". Physics Today (5). 2009-05-21

Cyrus Derman (971 words) [view diff] exact match in snippet view article find links to article

Lieberman and S.M. Ross, "Management Science", Vol. 18(7) 1972. A renewal decision problem with G.J. Lieberman and S.M. Ross, "Management Science", 1978 On the

Turing completeness (3,448 words) [view diff] exact match in snippet view article find links to article

Turing independently demonstrated that Hilbert's Entscheidungsproblem (decision problem) was unsolvable, thus identifying the computational core of the incompleteness

Decision EXpert (1,210 words) [view diff] exact match in snippet view article find links to article

Hierarchy Process (AHP). The hierarchy represents a decomposition of a decision problem into simpler sub-problems, so that higher-level attributes depend on

SSP (437 words) [view diff] exact match in snippet view article find links to article

Supply-side platform, for web advertising Subset sum problem, an NP-complete decision problem Six-state protocol, a quantum key distribution protocol Specialist

Ronald Fagin (1,179 words) [view diff] exact match in snippet view article find links to article

second-order logic coincides with the complexity class NP in the sense that a decision problem can be expressed in existential second-order logic if and only if it

Mathematics (15,938 words) [view diff] exact match in snippet view article find links to article

these traditional areas of mathematical statistics, a statistical-decision problem is formulated by minimizing an objective function, like expected loss

Weighted sum model (855 words) [view diff] exact match in snippet view article find links to article

apples and oranges." For a simple numerical example suppose that a decision problem of this type is defined on three alternative choices A1, A2, A3 each

Verena Huber-Dyson (1,426 words) [view diff] case mismatch in snippet view article find links to article

Stanford Research Report. 3. Huber-Dyson, Verena (1964). "On the Decision Problem for Theories of Finite Models". Israel Journal of Mathematics. 2 (1):

Backus–Naur form (2,984 words) [view diff] case mismatch in snippet view article find links to article

Post, Emil L. (1943). "Formal Reductions of the General Combinatorial Decision Problem". American Journal of Mathematics. 65 (2): 197–215. doi:10.2307/2371804

Turing Award (3,581 words) [view diff] case mismatch in snippet view article find links to article

Michael O. Rabin "For their joint paper 'Finite Automata and Their Decision Problem', which introduced the idea of nondeterministic machines, a continuous

Applications of sensitivity analysis to business (296 words) [view diff] exact match in snippet view article find links to article

may influence a business decision, such as e.g. an investment. In a decision problem, the analyst may want to identify cost drivers as well as other quantities

Two-variable logic (384 words) [view diff] case mismatch in snippet view article find links to article

University of Montreal, 1967 E. Grädel, P.G. Kolaitis and M. Vardi, On the Decision Problem for Two-Variable First-Order Logic, The Bulletin of Symbolic Logic

Bayes estimator (3,845 words) [view diff] exact match in snippet view article find links to article

hand, when n is small, the prior information is still relevant to the decision problem and affects the estimate. To see the relative weight of the prior information

Framing effect (psychology) (3,708 words) [view diff] exact match in snippet view article

problem is described. For example, varied descriptions of the same decision problem should not give rise to different decisions, due to the extensionality

Theory of art (4,023 words) [view diff] exact match in snippet view article find links to article

question of whether a new artifact is art "is not factual, but rather a decision problem, where the verdict turns on whether or not we enlarge our set of conditions

Distributed computing (6,666 words) [view diff] exact match in snippet view article find links to article

if there are more computers running in parallel (see speedup). If a decision problem can be solved in polylogarithmic time by using a polynomial number

Rank reversals in decision-making (2,204 words) [view diff] exact match in snippet view article find links to article

the analytic hierarchy process (AHP). They first considered a simple decision problem comprised by 3 alternatives and 2 criteria. Next a copy of a non-optimal

Arithmetical set (729 words) [view diff] exact match in snippet view article find links to article

nth arithmetical predicate. In fact, such a formula would describe a decision problem for all finite Turing jumps, and hence belongs to 0(ω), which cannot

James Tobin (2,345 words) [view diff] exact match in snippet view article find links to article

possible. Under Tobin's assumptions we can reformulate the person's decision problem as being one of trading off risk and expected return. Risk, or more

Non-commutative cryptography (1,807 words) [view diff] exact match in snippet view article find links to article

above is the difficulty of the following two problems: The conjugacy decision problem (also called the conjugacy problem): Given two elements u and v in

Post's theorem (3,832 words) [view diff] exact match in snippet view article find links to article

is for a decision problem, O m {\displaystyle O_{m}} is always "Yes" or "No", which we may formalize as 0 or 1. Suppose the decision problem itself can

Max Newman (2,344 words) [view diff] exact match in snippet view article find links to article

inspired Alan Turing to embark on his work on the Entscheidungsproblem (decision problem) that had been posed by Hilbert and Ackermann in 1928. Turing's solution

J. C. C. McKinsey (706 words) [view diff] exact match in snippet view article find links to article

MR 1501878. McKinsey, J. C. C. (1941). "A solution of the decision problem for the Lewis systems S2 and S4, with an application to topology."

David van Dantzig (923 words) [view diff] exact match in snippet view article find links to article

prevention, Econometrica, Vol. 24 (1956), pp. 276-287. The econometric decision problem concerning the prevention of floods in Holland (in Dutch), Report for

Quantum complexity theory (3,632 words) [view diff] exact match in snippet view article find links to article

can be compared based on promise problems. A promise problem is a decision problem which has an input assumed to be selected from the set of all possible

William Boone (mathematician) (257 words) [view diff] case mismatch in snippet view article

Amsterdam. W. W. Boone, Roger Lyndon, Frank Cannonito, Word Problems: Decision Problem in Group Theory, North-Holland, 1973. bio of Boone Novikov, Pyotr S

Epistemic motivation (3,361 words) [view diff] exact match in snippet view article find links to article

accurate understanding of the world, including the group task, or decision problem at hand, and the degree to which group members tend to systematically

List of paradoxes (7,937 words) [view diff] exact match in snippet view article find links to article

Decision-making paradox: Selecting the best decision-making method is a decision problem in itself. Ellsberg paradox: People exhibit ambiguity aversion (as

Representative agent (1,141 words) [view diff] exact match in snippet view article find links to article

model, an economist could analyze a policy change by recalculating the decision problem of each agent under the new policy, then aggregating these decisions

Post canonical system (782 words) [view diff] case mismatch in snippet view article find links to article

hierarchy. Emil Post, "Formal Reductions of the General Combinatorial Decision Problem," American Journal of Mathematics 65 (2): 197-215, 1943. Marvin Minsky

Cycle rank (1,221 words) [view diff] exact match in snippet view article find links to article

computationally hard: Gruber (2012) proves that the corresponding decision problem is NP-complete, even for sparse digraphs of maximum outdegree at most

Rectangle packing (949 words) [view diff] exact match in snippet view article find links to article

widths, and they should be packed in a given large rectangle. The decision problem of whether such a packing exists is NP-hard. This can be proved by

Egon Börger (642 words) [view diff] case mismatch in snippet view article find links to article

Italian Translation Bollati-Borighieri 1989) Egon Börger, The Classical Decision Problem (co-authored by E.Graedel and Y.Gurevich), Springer-Verlag 1997, ISBN 3-540-57073-X

List of Chinese discoveries (5,362 words) [view diff] exact match in snippet view article find links to article

Math. Soc. 171: 81–92. Zbl 0015.38803. Wu, Wen-Tsun (1978). "On the decision problem and the mechanization of theorem proving in elementary geometry". Scientia

Envy-free item allocation (3,729 words) [view diff] exact match in snippet view article find links to article

always EF. But if we want some efficiency in addition to EF, then the decision problem becomes computationally hard:: 300–310 Deciding whether an EF and

Behavioral economics (12,825 words) [view diff] exact match in snippet view article find links to article

decisions, their rationality is limited by the tractability of the decision problem, their cognitive limitations and the time available. Herbert A. Simon

Presburger arithmetic (3,249 words) [view diff] exact match in snippet view article find links to article

not internally provable (but see Gentzen's consistency proof). The decision problem for Presburger arithmetic is an interesting example in computational

Peter Arcidiacono (1,899 words) [view diff] exact match in snippet view article find links to article

structural parameters without having to fully solve the agent's dynamic decision problem. Both approaches result in substantial computational gains. Arcidiacono's

Modal logic (8,650 words) [view diff] case mismatch in snippet view article find links to article

University Press, 1993, p. x. McKinsey, J. C. C. (1941). "A Solution of the Decision Problem for the Lewis Systems S2 and S4, with an Application to Topology".

Configuration graph (593 words) [view diff] exact match in snippet view article find links to article

direction, it helps to verify the complexity of a computation model; the decision problem for a (deterministic) model whose configurations are of space which

Bag (puzzle) (342 words) [view diff] exact match in snippet view article

This decision question is NP-complete. This is proven by reducing the decision problem of deciding the 3-colorability of a planar graph, which is known to

Tutte polynomial (5,377 words) [view diff] exact match in snippet view article find links to article

of four-colorings of a planar graph is #P-complete, even though the decision problem is trivial by the four color theorem. In contrast, it is easy to see

Regular tree grammar (1,300 words) [view diff] case mismatch in snippet view article find links to article

(1968). "Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic". Mathematical Systems Theory. 2 (1): 57–81.

Expected value of perfect information (1,419 words) [view diff] exact match in snippet view article find links to article

activities can be more valuable than that quantified by EVPI. In a decision problem with two choices, and two possible outcomes for the random variable

Pseudorandom generator (1,864 words) [view diff] exact match in snippet view article find links to article

Wigderson is a pseudorandom generator assuming that there exists a decision problem that can be computed in time 2O(n) on inputs of length n but requires

Battleship (puzzle) (846 words) [view diff] case mismatch in snippet view article

pp. 5–6. ISBN 1-4027-4189-8. Sevenster, M. 2004, 'Battleships as Decision Problem', ICGA Journal [Electronic], Vol. 27, No. 3, pp.142-149. ISSN 1389-6911

Expected utility hypothesis (5,622 words) [view diff] exact match in snippet view article find links to article

Savage's theory are: States: The specification of every aspect of the decision problem at hand or "A description of the world leaving no relevant aspect undescribed

Multiple-criteria decision analysis (5,920 words) [view diff] exact match in snippet view article find links to article

(GADA). Analytic hierarchy process (AHP) The AHP first decomposes the decision problem into a hierarchy of subproblems. Then the decision-maker evaluates

Blackwell's informativeness theorem (1,456 words) [view diff] exact match in snippet view article find links to article

{\displaystyle \sigma } over σ ′ {\displaystyle \sigma '} , for any decision problem. The result was first proven by David Blackwell in 1951, and generalized

Ambiguity aversion (1,858 words) [view diff] exact match in snippet view article find links to article

ambiguity in a two-person coordination game, than a single person decision problem. More generally the results suggested that perceptions of ambiguity

Weighted product model (1,291 words) [view diff] exact match in snippet view article find links to article

numerical data are repeated next for easier reference. This simple decision problem is based on three alternatives denoted as A1, A2, and A3 each described

Multi-surface method (243 words) [view diff] exact match in snippet view article find links to article

versus backpropagation show MSM is better able to classify data. The decision problem associated linear program for the MSM is NP-complete. Given two finite

Richard M. Friedberg (945 words) [view diff] exact match in snippet view article find links to article

theory called Post's problem. In computability theory there is the decision problem of whether a given number is in a given set. Turing degree is a measure

Partition problem (2,439 words) [view diff] exact match in snippet view article find links to article

O(2^{n/3})} , but it is a randomized algorithm that only solves the decision problem (not the optimization problem). Sets with only one, or no partitions

Robust decision-making (2,471 words) [view diff] exact match in snippet view article find links to article

help identify and evaluate robust strategies. This structuring of the decision problem is a key feature of RDM. The traditional decision analytic approach

Term algebra (2,175 words) [view diff] exact match in snippet view article find links to article

shown decidable using quantifier elimination. The complexity of the decision problem is in NONELEMENTARY because binary constructors are injective and thus

Bounded rationality in environmental decision making (536 words) [view diff] exact match in snippet view article find links to article

individuals make decisions. Limitations include the difficulty of the decision problem, the cognitive capability of the mind, and the time available to make

Victor Johnston (991 words) [view diff] case mismatch in snippet view article find links to article

Risk Preference: A Re-examination of Framing Effects in a Life-Death Decision Problem. Journal of Behavioral Decision Making, 8:279–293, 1995. JOHNSTON,

Mir Shamsuddin Adib-Soltani (218 words) [view diff] case mismatch in snippet view article find links to article

Onlooker, Hermes Publishers, Tehran, 2010. ISBN 9789643636401 Topics in Decision Problem, Amir Kabir Publishers, Tehran, 2013. ISBN 978-964-00-1495-0 Critique

Ogden's lemma (1,819 words) [view diff] exact match in snippet view article find links to article

Post correspondence problem over binary strings, we reduce it to a decision problem over a CFG. Given any two lists of binary strings ξ 1 , . . . , ξ n

Semi-Thue system (3,406 words) [view diff] exact match in snippet view article find links to article

all that proves is that there is some Turing machine for which the decision problem is undecidable. However, that there is some Turing machine with undecidable

Minimax estimator (1,961 words) [view diff] exact match in snippet view article find links to article

risk when the parameter is θ 2 {\displaystyle \theta _{2}} . In this decision problem, the minimax estimator lies on a line segment connecting two deterministic