{"title":"Development of software for decision analysis","authors":"M. Danielson, L. Ekenberg","doi":"10.1109/SoMeT.2013.6645661","DOIUrl":null,"url":null,"abstract":"To be useful in reality, decision analytical tools must be able to handle imprecise information. This paper presents the algorithmic software design against a background of an evaluation method for analysing decision situations under semi-strong uncertainty. The design is built on a relaxation of the requirement for precise utilities, probabilities, and weights. To handle this, the calculations involved become computationally intensive to match an interactive work flow and the approach required implementation of new algorithms. We describe some particularly interesting implementation aspects of these and show how these computations can be tractable.","PeriodicalId":447065,"journal":{"name":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SoMeT.2013.6645661","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
To be useful in reality, decision analytical tools must be able to handle imprecise information. This paper presents the algorithmic software design against a background of an evaluation method for analysing decision situations under semi-strong uncertainty. The design is built on a relaxation of the requirement for precise utilities, probabilities, and weights. To handle this, the calculations involved become computationally intensive to match an interactive work flow and the approach required implementation of new algorithms. We describe some particularly interesting implementation aspects of these and show how these computations can be tractable.