Fabio Cuzzolin,

Proceedings of the 2nd International Conference on Belief Functions (BELIEF'12), Compiegne, France, May 2012 

Abstract 
Probability transformations of belief functions can be classified into different families, according to the operator they commute with. In particular, as they commute with Dempster's rule, relative plausibility and belief transforms form one such "epistemic" family, and possess natural rationales within Shafer's formulation of the theory of evidence, while they are not consistent with the credal or probabilitybound semantic of belief functions. We prove here, however, that these transforms can be given in this latter case an interesting rationale in terms of optimal strategies in a noncooperative game.


Download 

PDF 

BibTeX entry 
@inproceedings{cuzzolin12beliefgame,
AUTHOR = "Fabio Cuzzolin",
TITLE = "Gametheoretical semantics of epistemic probability transformations",
JOURNAL = "Proceedings of BELIEF 2012",
YEAR = "2012"
} 
