We characterize belief-free equilibria in infinitely repeated games with incomplete information with N ≥ 2 players and arbitrary information structures. This characterization involves a new type of individual rational constraint linking the lowest equilibrium payoffs across players. The characterization is tight: we define a set of payoffs that contains all the belief-free equilibrium payoffs; ...

Although we can build a belief network starting from any ordering of its variables, its structure depends heavily on the ordering being selected: the topology of the network, and therefore the number of conditional independence relationships that may be explicitly represented can vary greatly from one ordering to another. We develop an algorithm for learning belief networks composed of two main...

This article considers defeasible beliefs in dynamic settings. In particular, we examine the belief projection problem: what is believed after performing an action and/or receiving new information? The approach is based on an epistemic variant of Reiter’s situation calculus, where actions not only have physical effects but may also provide new information to the agent. The preferential belief s...

It has been shown that, despite the differences in approach and interpretation, all belief function based models without the socalled dynamic component lead essentially to mathematically equivalent theories – at least in the finite case. In this paper, we first argue that at the logical level these models seem to share a common formal framework and various interpretations just come at the epist...

Application of Bayesian belief networks in systems that interact directly with human users, such as decision support systems, requires eeective user interfaces. The principal task of such interfaces is bridging the gap between probabilistic models and human intuitive approaches to modeling uncertainty. We describe several methods for automatic generation of qualitative verbal explanations in sy...

This paper studies probability problems of intuitionistic fuzzy sets and the belief structure of general intuitionistic fuzzy information systems. First, for some special intuitionistic fuzzy sets, a probability is defined by using the integral operations on the level sets, and its properties are discussed. Then using this probability, a mass function of an intuitionistic fuzzy information syst...

This paper provides an analysis of different formal representations of beliefs in epistemic game theory. The aim is to attempt a synthesis of different structures of beliefs in the presence of indeterminate probabilities. Special attention is also paid to the decision-theoretic principle known as the thesis of no subjective probability for self-action. Conditions in cope with this principle are...

In this paper, we address the problem of object detection and recognition in complex scenes, where objects are partially occluded. We speculate that a careful analysis of visible object details at various scales may prove critical for recognition in these settings. However, in general, computational complexity becomes prohibitive when trying to analyze multiple sub-parts of multiple objects in ...