Search results for "Decision problem"
showing 10 items of 42 documents
Automated vehicles' work planning in flexible manufacturing systems
2006
The problem of rules setting in coordination of automated vehicles access to shared system resources (sections of their transportation paths) which assure a deadlock free and starvation free flow of the executed processes belongs to NP-hard problems. Assuming that there are local (controlling access to shared resources) rules of priority dispatching, the problem deals with setting conditions sufficient for a pair (initial state, set of priority dispatching rules). The assumed knowledge base way of specifying a transportation subsystem leads to solving a logic-algebraic method decision problem. In this regard, the working knowledge representation synthesis method constitutes a significant co…
Perceptual commensuration in decision tables
2017
This paper calls attention to design features that could enhance the helpfulness of the decision table to decision makers trying to get a better intuitive grasp of the choices facing them. The experiments reported here show that the grey scale is more facilitative than the number scale for problem comprehension as measured by the identification of dominance and the identification of non-additivity, each of which requires a view of the decision problem that is sensitive to patterns across attributes. Additional design features that could enhance the decision makers’ grasp of the choices facing them are suggested for further research.
The guarded fragment with transitive guards
2004
The guarded fragment with transitive guards, (GF+TG), is an extension of the guarded frag- ment of 9rst-order logic, GF, in which certain predicates are required to be transitive, transitive predicate letters appear only in guards of the quanti9ers and the equality symbol may appear everywhere. We prove that the decision problem for (GF+TG) is decidable. Moreover, we show that the problem is in 2EXPTIME. This result is optimal since the satis9ability problem for GF is 2EXPTIME-complete (J. Symbolic Logic 64 (1999) 1719-1742). We also show that the satis- 9ability problem for two-variable (GF+TG) is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satis9ability …
Prospect theory and stochastic multicriteria acceptability analysis (SMAA)
2009
Abstract We consider problems where multiple decision makers (DMs) want to choose their most preferred alternative from a finite set based on multiple criteria. Several approaches to support DMs in such problems have been suggested. Prospect theory has appealed to researchers through its descriptive power, but rare attempts have been made to apply it to support multicriteria decision making. The basic idea of prospect theory is that alternatives are evaluated by a difference function in terms of gains and losses with respect to a reference point. The function is suggested to be concave for gains and convex for losses and steeper for losses than for gains. Stochastic multicriteria acceptabil…
Solving the discrete multiple criteria problem using linear prospect theory
1994
Abstract Prospect theory developed by Kahneman and Tversky is a popular model of choice in decision problems under uncertainty. Prospect theory has recently been extended to multiple criteria choice problems. In this paper, an interactive method for solving discrete multiple criteria decision problems, based on prospect theory type value functions, has been developed. Piecewise linear marginal value functions are assumed to approximate the S-shaped value functions of prospect theory. Therefore, the proposed procedure is valid only for convex preferences.
Experiments on a Prey Predators System
2003
The paper describes a prey-predators system devoted to perform experiments on concurrent complex environment. The problem has be treated as an optimization problem. The prey goal is to escape from the predators reaching its lair, while predators want to capture the prey. At the end of the 19th century, Pareto found an optimal solutions for decision problems regarding more than one criterion at the same time. In most cases this ‘Pareto-set’ cannot be determined analytically or the computation time could be exponential. In such cases, evolutionary Algorithms (EA) are powerful optimization tools capable of finding optimal solutions of multi-modal problems. Here, both prey and predators learn i…
Simulated Annealing in Bayesian Decision Theory
1992
Since the seminal paper by Kirkpatrick, Gelatt and Vechhi (1983), a number of papers in the scientific literature refer to simulated annealing as a powerful random optimization method which promises to deliver, within reasonable computing times, optimal or nearly optimal solutions to complex decision problems hitherto forbidding. The algorithm, which uses the physical process of annealing as a metaphor, is special in that, at each iteration, one may move with positive probability to solutions with higher values of the function to minimize, rather than directly jumping to the point with the smallest value within the neighborhood, thus drastically reducing the chances of getting trapped in lo…
Stochastic Multicriteria Acceptability Analysis (SMAA)
2010
Stochastic multicriteria acceptability analysis (SMAA) is a family of methods for aiding multicriteria group decision making in problems with uncertain, imprecise or partially missing information. These methods are based on exploring the weight space in order to describe the preferences that make each alternative the most preferred one, or that would give a certain rank for a specific alternative. The main results of the analysis are rank acceptability indices, central weight vectors and confidence factors for different alternatives. The rank acceptability indices describe the variety of different preferences resulting in a certain rank for an alternative, the central weight vectors represe…
Evolving to the Impatience Trap: The Example of the Farmer-Sheriff Game
2011
The literature on the evolution of impatience, focusing on one-person decision problems, finds that evolutionary forces favor the more patient individuals. This paper shows that in the context of a game, this is not necessarily the case. In particular, it offers a two-population example where evolutionary forces favor impatience in one group while favoring patience in the other. Moreover, not only evolution but also efficiency may prefer impatient individuals. In our example, it is efficient for one population to evolve impatience and for the other to develop patience. Yet, evolutionary forces move the wrong populations.
SMAA in Robustness Analysis
2016
Stochastic multicriteria acceptability analysis (SMAA) is a simulation based method for discrete multicriteria decision aiding problems where information is uncertain, imprecise, or partially missing. In SMAA, different kind of uncertain information is represented by probability distributions. Because SMAA considers simultaneously the uncertainty in all parameters, it is particularly useful for robustness analysis. Depending on the problem setting, SMAA determines all possible rankings or classifications for the alternatives, and quantifies the possible results in terms of probabilities. This chapter describes SMAA in robustness analysis using a real-life decision problem as an example. Bas…