theory, a decision problem is a computational problem that can be posed as a yes–no question of the input values. An example of a decision problem is deciding...

Research about decision-making is also published under the label problem solving, particularly in European psychological research. Decision-making can be...

Markov decision process (MDP), also called a stochastic dynamic program or stochastic control problem, is a model for sequential decision making when outcomes...

mathematics and computer science, the Entscheidungsproblem (German for 'decision problem'; pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm]) is a challenge posed by David...

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...

Decision problems are one of the central objects of study in computational complexity theory. A decision problem is a type of computational problem where...

a complexity class used to classify decision problems. NP is the set of decision problems for which the problem instances, where the answer is "yes"...

model a variety of real-world sequential decision processes. Applications include robot navigation problems, machine maintenance, and planning under uncertainty...

A decision tree is a decision support hierarchical model that uses a tree-like model of decisions and their possible consequences, including chance event...

knapsack problem has been studied for more than a century, with early works dating as far back as 1897. Knapsack problems appear in real-world decision-making...