Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/71434
Title: Algorithms for Generating Sets of Gambles for Decision Making with Lower Previsions
Authors: Nawapon Nakharutai
Authors: Nawapon Nakharutai
Keywords: Computer Science;Mathematics
Issue Date: 1-Jan-2020
Abstract: © 2020, Springer Nature Switzerland AG. (Formula Presented)-maximin, (Formula Presented)-maximax, maximality and interval dominance are well-known criteria for decision making using lower previsions when precise probabilities are not available. This study proposes algorithms for generating a set of gambles that has a precise number of (Formula Presented)-maximin (or (Formula Presented)-maximax) gambles that can be used to generate random decision problems for benchmarking algorithms for finding (Formula Presented)-maximin (or (Formula Presented)-maximax) gambles. Since (Formula Presented)-maximin and (Formula Presented)-maximax imply maximality and interval dominance, the algorithms can also be used as an alternative algorithm for generating random decision problems with pre-determined numbers of maximal and interval dominant gambles.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85096627106&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/71434
ISSN: 16113349
03029743
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.