We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, A...
This paper presents the ARTS (Agent-oriented Robust Transactional System) model, which applies transaction concepts to provide agent developers with high-level support for agent s...
We develop a new graphical representation for interactive partially observable Markov decision processes (I-POMDPs) that is significantly more transparent and semantically clear t...
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...
Regret based algorithms have been proposed to control a wide variety of multi-agent systems. The appeal of regretbased algorithms is that (1) these algorithms are easily implement...