Possibilistic sequential decision making

When the information about uncertainty cannot be quantified in a simple, probabilistic way, the topic of possibilistic decision theory is often a natural one to consider. The development of possibilistic decision theory has lead to the proposition a series of possibilistic criteria, namely: optimist...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of approximate reasoning Ročník 55; číslo 5; s. 1269 - 1300
Hlavní autoři: Ben Amor, Nahla, Fargier, Hélène, Guezguez, Wided
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier Inc 01.07.2014
Elsevier
Témata:
ISSN:0888-613X, 1873-4731
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract When the information about uncertainty cannot be quantified in a simple, probabilistic way, the topic of possibilistic decision theory is often a natural one to consider. The development of possibilistic decision theory has lead to the proposition a series of possibilistic criteria, namely: optimistic and pessimistic possibilistic qualitative criteria [7], possibilistic likely dominance [2,9], binary possibilistic utility [11] and possibilistic Choquet integrals [24]. This paper focuses on sequential decision making in possibilistic decision trees. It proposes a theoretical study on the complexity of the problem of finding an optimal strategy depending on the monotonicity property of the optimization criteria – when the criterion is transitive, this property indeed allows a polytime solving of the problem by Dynamic Programming. We show that most possibilistic decision criteria, but possibilistic Choquet integrals, satisfy monotonicity and that the corresponding optimization problems can be solved in polynomial time by Dynamic Programming. Concerning the possibilistic likely dominance criteria which is quasi-transitive but not fully transitive, we propose an extended version of Dynamic Programming which remains polynomial in the size of the decision tree. We also show that for the particular case of possibilistic Choquet integrals, the problem of finding an optimal strategy is NP-hard. It can be solved by a Branch and Bound algorithm. Experiments show that even not necessarily optimal, the strategies built by Dynamic Programming are generally very good. •We study the sequential decision making problem in possibilistic decision trees.•We propose a theoretical study on the complexity of finding an optimal strategy w.r.t. possibilistic decision criteria.•We propose a resolution algorithm (Dynamic programming (standard-extended) or Branch and Bound) for each criterion.•We show that for possibilistic Choquet integrals the problem of finding an optimal strategy is NP-hard.
AbstractList When the information about uncertainty cannot be quantified in a simple, probabilistic way, the topic of possibilistic decision theory is often a natural one to consider. The development of possibilistic decision theory has lead to the proposition a series of possibilistic criteria, namely: optimistic and pessimistic possibilistic qualitative criteria [7], possibilistic likely dominance [2,9], binary possibilistic utility [11] and possibilistic Choquet integrals [24]. This paper focuses on sequential decision making in possibilistic decision trees. It proposes a theoretical study on the complexity of the problem of finding an optimal strategy depending on the monotonicity property of the optimization criteria – when the criterion is transitive, this property indeed allows a polytime solving of the problem by Dynamic Programming. We show that most possibilistic decision criteria, but possibilistic Choquet integrals, satisfy monotonicity and that the corresponding optimization problems can be solved in polynomial time by Dynamic Programming. Concerning the possibilistic likely dominance criteria which is quasi-transitive but not fully transitive, we propose an extended version of Dynamic Programming which remains polynomial in the size of the decision tree. We also show that for the particular case of possibilistic Choquet integrals, the problem of finding an optimal strategy is NP-hard. It can be solved by a Branch and Bound algorithm. Experiments show that even not necessarily optimal, the strategies built by Dynamic Programming are generally very good. •We study the sequential decision making problem in possibilistic decision trees.•We propose a theoretical study on the complexity of finding an optimal strategy w.r.t. possibilistic decision criteria.•We propose a resolution algorithm (Dynamic programming (standard-extended) or Branch and Bound) for each criterion.•We show that for possibilistic Choquet integrals the problem of finding an optimal strategy is NP-hard.
Author Ben Amor, Nahla
Fargier, Hélène
Guezguez, Wided
Author_xml – sequence: 1
  givenname: Nahla
  surname: Ben Amor
  fullname: Ben Amor, Nahla
  email: nahla.benamor@gmx.fr
  organization: LARODEC, Institut Supérieur de Gestion Tunis, Université de Tunis, Tunisia
– sequence: 2
  givenname: Hélène
  surname: Fargier
  fullname: Fargier, Hélène
  email: fargier@irit.fr
  organization: IRIT, University of Paul Sabatier, Toulouse, France
– sequence: 3
  givenname: Wided
  surname: Guezguez
  fullname: Guezguez, Wided
  email: widedguezguez@gmail.com
  organization: LARODEC, Institut Supérieur de Gestion Tunis, Université de Tunis, Tunisia
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28438644$$DView record in Pascal Francis
BookMark eNp9kEFLAzEQhYNUsK3-AU-9CF52TTZpkoIXKVaFgh4UvIXsZFZm3e7WZBX8926pXjz0NJf3Pd58EzZquxYZOxc8F1zoqzqn2se84ELmQuScz4_YWFgjM2WkGLExt9ZmWsjXEzZJqeaca6PsmF0-dSlRSQ2lnmCW8OMT2558MwsIlKhrZxv_Tu3bKTuufJPw7PdO2cvq9nl5n60f7x6WN-sMFLd9ZkRVgdVaGgkGfYk6VKUqNBQcyyAXNhQYFlVhtbEIPgRQwpsAi7nWcw9cTtnFvnfrE_imir4ddrhtpI2P366wSlqt1JCz-xzE4YOIlQPqfT8M7qOnxgnudmZc7XZm3M6ME8INZga0-If-tR-ErvcQDs9_EUaXgLAFDBQRehc6OoT_ANY2f6c
CODEN IJARE4
CitedBy_id crossref_primary_10_1016_j_fss_2018_02_006
crossref_primary_10_1016_j_ijar_2019_03_003
crossref_primary_10_1016_j_fss_2017_06_007
Cites_doi 10.1016/0165-0114(78)90029-5
10.1016/j.artint.2010.11.019
10.2307/1911158
10.1016/S0004-3702(03)00037-7
10.1016/j.fss.2006.06.001
10.1016/0004-3702(91)90101-O
10.1016/0167-2681(82)90008-7
10.1007/s10479-011-0968-2
10.1016/j.ejor.2003.05.004
10.1016/j.ejor.2008.01.051
10.2307/1911053
10.1016/S0888-613X(98)10019-1
10.1145/581771.581772
ContentType Journal Article
Copyright 2014 Elsevier Inc.
2015 INIST-CNRS
Copyright_xml – notice: 2014 Elsevier Inc.
– notice: 2015 INIST-CNRS
DBID 6I.
AAFTH
AAYXX
CITATION
IQODW
DOI 10.1016/j.ijar.2013.11.005
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
Mathematics
EISSN 1873-4731
EndPage 1300
ExternalDocumentID 28438644
10_1016_j_ijar_2013_11_005
S0888613X13002831
GroupedDBID --K
--M
.~1
0R~
1B1
1RT
1~.
1~5
29J
4.4
457
4G.
5GY
5VS
6I.
7-5
71M
8P~
9JN
9JO
AAAKF
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
ABAOU
ABBOA
ABFNM
ABJNI
ABMAC
ABUCO
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNCT
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
ADTZH
AEBSH
AECPX
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
IHE
IXB
J1W
JJJVA
KOM
LG9
LY1
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SES
SEW
SPC
SPCBC
SSB
SSD
SST
SSV
SSW
SSZ
T5K
UHS
WUQ
XPP
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
BNPGV
IQODW
SSH
ID FETCH-LOGICAL-c408t-71ffc866373c7eabe6dfb426c20ebd398d2ed9f28678ecaddc41a7dc95665ac03
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000336712800010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0888-613X
IngestDate Wed Apr 02 07:28:58 EDT 2025
Sat Nov 29 04:42:29 EST 2025
Tue Nov 18 22:22:09 EST 2025
Fri Feb 23 02:17:40 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 5
Keywords Possibility theory
Choquet integrals
Decision analysis
Dynamic Programming
Decision tree
Branch and Bound
Process dynamics
Multicriteria analysis
Quantization
Sequential decision
Modeling
Optimization
Optimal strategy
Uncertain system
Dynamic programming
Mathematical programming
Probabilistic approach
Branch and bound method
Decision making
Dominance
Polynomial time
Choquet expected utility
Measure theory
Decision theory
Implicit enumeration method
NP hard problem
Problem solving
Matrix polynomial
Monotonicity
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c408t-71ffc866373c7eabe6dfb426c20ebd398d2ed9f28678ecaddc41a7dc95665ac03
OpenAccessLink https://dx.doi.org/10.1016/j.ijar.2013.11.005
PageCount 32
ParticipantIDs pascalfrancis_primary_28438644
crossref_citationtrail_10_1016_j_ijar_2013_11_005
crossref_primary_10_1016_j_ijar_2013_11_005
elsevier_sciencedirect_doi_10_1016_j_ijar_2013_11_005
PublicationCentury 2000
PublicationDate 2014-07-01
PublicationDateYYYYMMDD 2014-07-01
PublicationDate_xml – month: 07
  year: 2014
  text: 2014-07-01
  day: 01
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle International journal of approximate reasoning
PublicationYear 2014
Publisher Elsevier Inc
Elsevier
Publisher_xml – name: Elsevier Inc
– name: Elsevier
References Sabbadin, Fargier, Lang (br0270) 1998; 19
Dubois, Prade (br0050) 1988
Kikuti, Cozman, de Campos (br0180) 2005
Pearl (br0210) 1993
Sabbadin (br0260) 1999
Quiggin (br0230) 1982; 3
Rebille (br0250) 2006; 157
Spohn (br0290) 1990
Jeantet, Spanjaard (br0170) 2011; 175
G. Choquet, Théorie des capacités, Tech. rep., Ann. Inst. Fourier (1953).
Dubois, Fargier, Perny (br0020) 2003; 148
Dubois, Godo, Prade, Zapico (br0040) 1998
Perny, Spanjaard, Weng (br0220) 2005
Raifaa (br0240) 1968
Yaari (br0310) 1987; 55
Jeantet, Spanjaard (br0150) 2008
Dubois, Fargier, Prade, Perny (br0030) 2002; 49
Schmeidler (br0280) 1989; 57
Dubois, Prade (br0070) 1995
Wilson (br0300) 1995
Fargier, Perny (br0090) 1999
Guezguez, Ben Amor, Mellouli (br0140) 2009; 195
Huntley, Troffae (br0190) 2012; 195
Dubois, Prade (br0060) 1991; 50
Giang, Shenoy (br0130) 2005; 162
Neumann, Morgenstern (br0200) 1948
Giang, Shenoy (br0110) 2001
Fargier, Ben Amor, Guezguez (br0080) 2011
Giang, Shenoy (br0120) 2000
Garcia, Sabbadin (br0100) 2006
Zadeh (br0320) 1978; 1
Kikuti (10.1016/j.ijar.2013.11.005_br0180) 2005
Fargier (10.1016/j.ijar.2013.11.005_br0090) 1999
Jeantet (10.1016/j.ijar.2013.11.005_br0170) 2011; 175
Garcia (10.1016/j.ijar.2013.11.005_br0100) 2006
Perny (10.1016/j.ijar.2013.11.005_br0220) 2005
Wilson (10.1016/j.ijar.2013.11.005_br0300) 1995
Schmeidler (10.1016/j.ijar.2013.11.005_br0280) 1989; 57
Zadeh (10.1016/j.ijar.2013.11.005_br0320) 1978; 1
Dubois (10.1016/j.ijar.2013.11.005_br0040) 1998
Neumann (10.1016/j.ijar.2013.11.005_br0200) 1948
Pearl (10.1016/j.ijar.2013.11.005_br0210) 1993
Spohn (10.1016/j.ijar.2013.11.005_br0290) 1990
Guezguez (10.1016/j.ijar.2013.11.005_br0140) 2009; 195
Sabbadin (10.1016/j.ijar.2013.11.005_br0260) 1999
Giang (10.1016/j.ijar.2013.11.005_br0130) 2005; 162
Raifaa (10.1016/j.ijar.2013.11.005_br0240) 1968
Rebille (10.1016/j.ijar.2013.11.005_br0250) 2006; 157
Huntley (10.1016/j.ijar.2013.11.005_br0190) 2012; 195
Fargier (10.1016/j.ijar.2013.11.005_br0080) 2011
Giang (10.1016/j.ijar.2013.11.005_br0110) 2001
Giang (10.1016/j.ijar.2013.11.005_br0120) 2000
10.1016/j.ijar.2013.11.005_br0010
Dubois (10.1016/j.ijar.2013.11.005_br0070) 1995
Quiggin (10.1016/j.ijar.2013.11.005_br0230) 1982; 3
Dubois (10.1016/j.ijar.2013.11.005_br0030) 2002; 49
Dubois (10.1016/j.ijar.2013.11.005_br0050) 1988
Jeantet (10.1016/j.ijar.2013.11.005_br0150) 2008
Dubois (10.1016/j.ijar.2013.11.005_br0060) 1991; 50
Sabbadin (10.1016/j.ijar.2013.11.005_br0270) 1998; 19
Dubois (10.1016/j.ijar.2013.11.005_br0020) 2003; 148
Yaari (10.1016/j.ijar.2013.11.005_br0310) 1987; 55
References_xml – volume: 3
  start-page: 323
  year: 1982
  end-page: 343
  ident: br0230
  article-title: A theory of anticipated utility
  publication-title: J. Econ. Behav. Organ.
– volume: 49
  start-page: 455
  year: 2002
  end-page: 495
  ident: br0030
  article-title: Qualitative decision theory: from Savage's axioms to nonmonotonic reasoning
  publication-title: J. ACM
– year: 1988
  ident: br0050
  article-title: Possibility Theory, an Approach to Computerized Processing of Uncertainty
– start-page: 315
  year: 1990
  end-page: 322
  ident: br0290
  article-title: A general non-probabilistic theory of inductive reasoning
  publication-title: Uncertainty in Artificial Intelligence (UAI'90)
– volume: 175
  start-page: 1366
  year: 2011
  end-page: 1389
  ident: br0170
  article-title: Computing rank dependent utility in graphical models for sequential decision problems
  publication-title: Artif. Intell.
– start-page: 372
  year: 2006
  end-page: 376
  ident: br0100
  article-title: Possibilistic influence diagrams
  publication-title: European Conference on Artificial Intelligence (ECAI'06)
– start-page: 594
  year: 1998
  end-page: 605
  ident: br0040
  article-title: Making decision in a qualitative setting: from decision under uncertainty to case-based decision
  publication-title: 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'1998)
– start-page: 203
  year: 2011
  end-page: 210
  ident: br0080
  article-title: On the complexity of decision making in possibilistic decision trees
  publication-title: Uncertainty in Artificial Intelligence (UAI'11)
– start-page: 1372
  year: 2005
  end-page: 1377
  ident: br0220
  article-title: Algebraic Markov decision processes
  publication-title: International Joint Conference on Artificial Intelligence (IJCAI'05)
– start-page: 148
  year: 2008
  end-page: 155
  ident: br0150
  article-title: Rank-dependent probability weighting in sequential decision problems under uncertainty
  publication-title: International Conference on Automated Planning and Scheduling (ICAPS'08)
– volume: 162
  start-page: 450
  year: 2005
  end-page: 467
  ident: br0130
  article-title: Two axiomatic approaches to decision making using possibility theory
  publication-title: Eur. J. Oper. Res.
– start-page: 118
  year: 2005
  end-page: 123
  ident: br0180
  article-title: Partially ordered preferences in decision trees: Computing strategies with imprecision in probabilities
  publication-title: IJCAI'05 Workshop on Advances in Preference Handling
– year: 1968
  ident: br0240
  article-title: Decision Analysis: Introductory Lectures on Choices under Uncertainty
– volume: 157
  start-page: 3025
  year: 2006
  end-page: 3039
  ident: br0250
  article-title: Decision making over necessity measures through the Choquet integral criterion
  publication-title: Fuzzy Sets Syst.
– volume: 148
  start-page: 219
  year: 2003
  end-page: 260
  ident: br0020
  article-title: Qualitative decision theory with preference relations and comparative uncertainty: An axiomatic approach
  publication-title: Artif. Intell.
– start-page: 188
  year: 1999
  end-page: 195
  ident: br0090
  article-title: Qualitative models for decision under uncertainty without the commensurability assumption
  publication-title: Uncertainty in Artificial Intelligence (UAI'99)
– start-page: 220
  year: 2000
  end-page: 229
  ident: br0120
  article-title: A qualitative linear utility theory for spohn's theory of epistemic beliefs
  publication-title: Uncertainty in Artificial Intelligence (UAI'2000)
– start-page: 548
  year: 1995
  end-page: 555
  ident: br0300
  article-title: An order of magnitude calculus
  publication-title: Uncertainty in Artificial Intelligence (UAI'95)
– reference: G. Choquet, Théorie des capacités, Tech. rep., Ann. Inst. Fourier (1953).
– start-page: 12
  year: 1993
  end-page: 20
  ident: br0210
  article-title: From conditional oughts to qualitative decision theory
  publication-title: Uncertainty in Artificial Intelligence (UAI'93)
– volume: 1
  start-page: 3
  year: 1978
  end-page: 28
  ident: br0320
  article-title: Fuzzy sets as a basis for a theory of possibility
  publication-title: Fuzzy Sets Syst.
– start-page: 1924
  year: 1995
  end-page: 1930
  ident: br0070
  article-title: Possibility theory as a basis for qualitative decision theory
  publication-title: International Joint Conference on Artificial Intelligence (IJCAI'95)
– volume: 195
  start-page: 111
  year: 2012
  end-page: 134
  ident: br0190
  article-title: Normal form backward induction for decision trees with coherent lower previsions
  publication-title: Ann. Oper. Res.
– volume: 57
  start-page: 517
  year: 1989
  end-page: 587
  ident: br0280
  article-title: Subjective probability and expected utility without additivity
  publication-title: Econometrica
– volume: 55
  start-page: 95
  year: 1987
  end-page: 115
  ident: br0310
  article-title: The dual theory of choice under risk
  publication-title: Econometrica
– start-page: 162
  year: 2001
  end-page: 170
  ident: br0110
  article-title: A comparison of axiomatic approaches to qualitative decision making using possibility theory
  publication-title: Uncertainty in Artificial Intelligence (UAI'01)
– volume: 19
  start-page: 441
  year: 1998
  end-page: 471
  ident: br0270
  article-title: Towards qualitative approaches to multi-stage decision making
  publication-title: Int. J. Approx. Reason.
– start-page: 567
  year: 1999
  end-page: 574
  ident: br0260
  article-title: A possibilistic model for qualitative sequential decision problems under uncertainty in partially observable environments
  publication-title: Uncertainty in Artificial Intelligence (UAI'99)
– volume: 195
  start-page: 223
  year: 2009
  end-page: 238
  ident: br0140
  article-title: Qualitative possibilistic influence diagrams based on qualitative possibilistic utilities
  publication-title: Eur. J. Oper. Res.
– year: 1948
  ident: br0200
  article-title: Theory of Games and Economic Behavior
– volume: 50
  start-page: 223
  year: 1991
  end-page: 239
  ident: br0060
  article-title: Epistemic entrenchment and possibilistic logic
  publication-title: Artif. Intell.
– start-page: 315
  year: 1990
  ident: 10.1016/j.ijar.2013.11.005_br0290
  article-title: A general non-probabilistic theory of inductive reasoning
– volume: 1
  start-page: 3
  year: 1978
  ident: 10.1016/j.ijar.2013.11.005_br0320
  article-title: Fuzzy sets as a basis for a theory of possibility
  publication-title: Fuzzy Sets Syst.
  doi: 10.1016/0165-0114(78)90029-5
– year: 1968
  ident: 10.1016/j.ijar.2013.11.005_br0240
– start-page: 220
  year: 2000
  ident: 10.1016/j.ijar.2013.11.005_br0120
  article-title: A qualitative linear utility theory for spohn's theory of epistemic beliefs
– start-page: 203
  year: 2011
  ident: 10.1016/j.ijar.2013.11.005_br0080
  article-title: On the complexity of decision making in possibilistic decision trees
– volume: 175
  start-page: 1366
  issue: 7–8
  year: 2011
  ident: 10.1016/j.ijar.2013.11.005_br0170
  article-title: Computing rank dependent utility in graphical models for sequential decision problems
  publication-title: Artif. Intell.
  doi: 10.1016/j.artint.2010.11.019
– volume: 55
  start-page: 95
  year: 1987
  ident: 10.1016/j.ijar.2013.11.005_br0310
  article-title: The dual theory of choice under risk
  publication-title: Econometrica
  doi: 10.2307/1911158
– start-page: 148
  year: 2008
  ident: 10.1016/j.ijar.2013.11.005_br0150
  article-title: Rank-dependent probability weighting in sequential decision problems under uncertainty
– start-page: 594
  year: 1998
  ident: 10.1016/j.ijar.2013.11.005_br0040
  article-title: Making decision in a qualitative setting: from decision under uncertainty to case-based decision
– start-page: 567
  year: 1999
  ident: 10.1016/j.ijar.2013.11.005_br0260
  article-title: A possibilistic model for qualitative sequential decision problems under uncertainty in partially observable environments
– start-page: 372
  year: 2006
  ident: 10.1016/j.ijar.2013.11.005_br0100
  article-title: Possibilistic influence diagrams
– volume: 148
  start-page: 219
  issue: 1–2
  year: 2003
  ident: 10.1016/j.ijar.2013.11.005_br0020
  article-title: Qualitative decision theory with preference relations and comparative uncertainty: An axiomatic approach
  publication-title: Artif. Intell.
  doi: 10.1016/S0004-3702(03)00037-7
– start-page: 118
  year: 2005
  ident: 10.1016/j.ijar.2013.11.005_br0180
  article-title: Partially ordered preferences in decision trees: Computing strategies with imprecision in probabilities
– start-page: 1372
  year: 2005
  ident: 10.1016/j.ijar.2013.11.005_br0220
  article-title: Algebraic Markov decision processes
– start-page: 548
  year: 1995
  ident: 10.1016/j.ijar.2013.11.005_br0300
  article-title: An order of magnitude calculus
– start-page: 162
  year: 2001
  ident: 10.1016/j.ijar.2013.11.005_br0110
  article-title: A comparison of axiomatic approaches to qualitative decision making using possibility theory
– volume: 157
  start-page: 3025
  issue: 23
  year: 2006
  ident: 10.1016/j.ijar.2013.11.005_br0250
  article-title: Decision making over necessity measures through the Choquet integral criterion
  publication-title: Fuzzy Sets Syst.
  doi: 10.1016/j.fss.2006.06.001
– year: 1988
  ident: 10.1016/j.ijar.2013.11.005_br0050
– start-page: 12
  year: 1993
  ident: 10.1016/j.ijar.2013.11.005_br0210
  article-title: From conditional oughts to qualitative decision theory
– start-page: 188
  year: 1999
  ident: 10.1016/j.ijar.2013.11.005_br0090
  article-title: Qualitative models for decision under uncertainty without the commensurability assumption
– ident: 10.1016/j.ijar.2013.11.005_br0010
– volume: 50
  start-page: 223
  issue: 2
  year: 1991
  ident: 10.1016/j.ijar.2013.11.005_br0060
  article-title: Epistemic entrenchment and possibilistic logic
  publication-title: Artif. Intell.
  doi: 10.1016/0004-3702(91)90101-O
– start-page: 1924
  year: 1995
  ident: 10.1016/j.ijar.2013.11.005_br0070
  article-title: Possibility theory as a basis for qualitative decision theory
– year: 1948
  ident: 10.1016/j.ijar.2013.11.005_br0200
– volume: 3
  start-page: 323
  year: 1982
  ident: 10.1016/j.ijar.2013.11.005_br0230
  article-title: A theory of anticipated utility
  publication-title: J. Econ. Behav. Organ.
  doi: 10.1016/0167-2681(82)90008-7
– volume: 195
  start-page: 111
  issue: 1
  year: 2012
  ident: 10.1016/j.ijar.2013.11.005_br0190
  article-title: Normal form backward induction for decision trees with coherent lower previsions
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-011-0968-2
– volume: 162
  start-page: 450
  issue: 2
  year: 2005
  ident: 10.1016/j.ijar.2013.11.005_br0130
  article-title: Two axiomatic approaches to decision making using possibility theory
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2003.05.004
– volume: 195
  start-page: 223
  issue: 1
  year: 2009
  ident: 10.1016/j.ijar.2013.11.005_br0140
  article-title: Qualitative possibilistic influence diagrams based on qualitative possibilistic utilities
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2008.01.051
– volume: 57
  start-page: 517
  year: 1989
  ident: 10.1016/j.ijar.2013.11.005_br0280
  article-title: Subjective probability and expected utility without additivity
  publication-title: Econometrica
  doi: 10.2307/1911053
– volume: 19
  start-page: 441
  issue: 3–4
  year: 1998
  ident: 10.1016/j.ijar.2013.11.005_br0270
  article-title: Towards qualitative approaches to multi-stage decision making
  publication-title: Int. J. Approx. Reason.
  doi: 10.1016/S0888-613X(98)10019-1
– volume: 49
  start-page: 455
  year: 2002
  ident: 10.1016/j.ijar.2013.11.005_br0030
  article-title: Qualitative decision theory: from Savage's axioms to nonmonotonic reasoning
  publication-title: J. ACM
  doi: 10.1145/581771.581772
SSID ssj0006748
Score 2.1015089
Snippet When the information about uncertainty cannot be quantified in a simple, probabilistic way, the topic of possibilistic decision theory is often a natural one...
SourceID pascalfrancis
crossref
elsevier
SourceType Index Database
Enrichment Source
Publisher
StartPage 1269
SubjectTerms Applied sciences
Branch and Bound
Choquet integrals
Decision analysis
Decision theory. Utility theory
Decision tree
Dynamic Programming
Exact sciences and technology
Mathematical analysis
Mathematical programming
Mathematics
Measure and integration
Operational research and scientific management
Operational research. Management science
Possibility theory
Sciences and techniques of general use
Title Possibilistic sequential decision making
URI https://dx.doi.org/10.1016/j.ijar.2013.11.005
Volume 55
WOSCitedRecordID wos000336712800010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-4731
  dateEnd: 20180131
  omitProxy: false
  ssIdentifier: ssj0006748
  issn: 0888-613X
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9tAEF6K00MgJG3SkDRt0KGHgFHQ6uFdHU1JmpZiAk2pb2K1j1TGVoxlF5Nfn1nNSrZLG5JCL7IQ1mtnNPPN7Ox8hHxIo9zEmhpf0Dz3YyVin4ue8E0SGWUhaoysJV_ZYMCHw_Ta5XSrmk6AlSVfLtPpfxU1HANh26WzzxB3e1E4APsgdNiC2GH7JMFf31VY8mo7MHexVHpu8-LK0el0JzUD1Tos3cwLrnWTqFuOLwuAtZZeRVR18rYN4XXZ7U8w3h-In-PWwl-K2W2BunCFM_Hj-oev5vA_LfT97QLT1z8K5ZZYufQDjdtSVZcTa9bFbJRtguniEJTWTL_gZdC0chb5MXM239lebNHrdCxZM6Q0RAYX55TtpNsfDT7mHkbnxUjY7q40Orc9WYNk5d7aosNv9qnsQ9mLAaqCmHkrZEnKO2Sr__li-KX14JaABaMPfAu32ArrAn-_098Azc5UVPCZGeRHWQMtN6_Iros2vD5qyWvyQpf7ZK9h8vCcYT8gZxtK462UxmuUxkOleUO-X17cfLzyHYeGL-OAz31GjZEcYCWLJNMi1z1lckBlMgx0rqKUq1Cr1IQcQIuW4OxkTAVTEsLmXiJkEB2STnlX6iPigXMwKVWJYTmAVgn7pqeZCVRgkwiKHRPaDEQmXYN5y3MyzppKwlFmBy-zgweRZwaDd0y67TlTbK_y6L-TZnwzBxAR-GWgDo-ed7ohjPZWgM0iDhHB23-88AnZXn0T70hnPlvo9-Sl_DUvqtmpU6sH6YGVcw
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Possibilistic+sequential+decision+making&rft.jtitle=International+journal+of+approximate+reasoning&rft.au=Ben+Amor%2C+Nahla&rft.au=Fargier%2C+H%C3%A9l%C3%A8ne&rft.au=Guezguez%2C+Wided&rft.date=2014-07-01&rft.pub=Elsevier+Inc&rft.issn=0888-613X&rft.eissn=1873-4731&rft.volume=55&rft.issue=5&rft.spage=1269&rft.epage=1300&rft_id=info:doi/10.1016%2Fj.ijar.2013.11.005&rft.externalDocID=S0888613X13002831
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0888-613X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0888-613X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0888-613X&client=summon