Classic Works of the Dempster-Shafer Theory of Belief Functions
DOI: 10.1007/978-3-540-44792-4_19
|View full text |Cite
|
Sign up to set email alerts
|

Some Characterizations of Lower Probabilities and Other Monotone Capacities through the use of Möbius Inversion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
180
0
1

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 110 publications
(183 citation statements)
references
References 17 publications
2
180
0
1
Order By: Relevance
“…This last proposition (Chateauneuf and Jaffray 1989) gives the form of supermodularity and submodularity constraints in terms of the Möbius transform. …”
Section: Proposition 7 a Set Function ν: P(n) → R Is Supermodular (Rementioning
confidence: 96%
See 2 more Smart Citations
“…This last proposition (Chateauneuf and Jaffray 1989) gives the form of supermodularity and submodularity constraints in terms of the Möbius transform. …”
Section: Proposition 7 a Set Function ν: P(n) → R Is Supermodular (Rementioning
confidence: 96%
“…In terms of the Möbius representation of a game µ, Chateauneuf and Jaffray (1989) showed that, for any x = (x 1 , . .…”
Section: Definitionmentioning
confidence: 99%
See 1 more Smart Citation
“…Unlike Savage, in this model there is an algebra A of subsets of X containing all singletons, with typical element X . 3 We denote by U the set of the nonempty subsets in A, i.e.,U ≡ A \ ∅. As explained in the Introduction, the sets X ∈ U are the sets of consequences that the DM envisions as possible results of her actions.…”
Section: The Modelmentioning
confidence: 99%
“…As for the result of Proposition 6, it was first proved for belief functions by Shafer[32], and extended to any capacity by Chateauneuf and Jaffray[3].…”
mentioning
confidence: 92%