Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
Though arrangement knowledge is well suited for qualitative representations of spatial situations, if we only use this kind of knowledge, we cannot do interesting inferences about...
in Joel's piece, but this really does not account for what the research actually accomplished. While I enjoyed his article and the references to "Officialdom" that w...
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...