Traditionally, the information system is assumed to be perfect, i.e. attribute values are not missing and supposed to be precise. In fact, imperfect information system is always existent. In this paper, based on imperfect information system (include missing data and imprecise data), the concepts of indiscernibility and discernibility are defined, their important properties are given, and the re...

This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state information at receivers (CSIR) is considered in two scenarios of perfect and imperfect CSIR. In the imperfect CSIR case, we consider a more practical assumption of...

IMP-minimax is the analog to minimax for games with imperfect information, like card games such as bridge or poker. It computes an optimal strategy for the game if the game has a single player and a certain natural property called perfect recall. IMP-minimax is described fully in a companion paper in this proceedings. Here we introduce an algorithm IMP-alpha-beta that is to IMP-minimax s alpha-...

Although game-tree search works well in perfect-information games, there are problems in trying to use it for imperfect-information games such as bridge. The lack of knowledge about the oppo-nents' possible moves gives the game tree a very large branching factor, making the tree so immense that game-tree searching is infeasible. In this paper, we describe our approach for overcoming this proble...