Games of Incomplete Information: a Framework Based on Belief Functions
Abstract
This paper proposes a model for incomplete games where the knowledge of the players is represented by a Dempster-Shafer belief function. Beyond an extension of the classical definitions, it shows such a game can be transformed into an equivalent hypergraphical complete game (without uncertainty), thus generalizing Howson and Rosenthal's theorem to the framework of belief functions and to any number of players. The complexity of this transformation is finally studied and shown to be polynomial in the degree of k-additivity of the mass function.
Origin : Files produced by the author(s)