This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...
Rajiv T. Maheswaran, Jonathan P. Pearce, Milind Ta...
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
The widely used e-learning technology is facing new challenges such as how to produce student-centered systems that can be adapted to the needs of each student. Those objectives sh...
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
— In the lion and man game, a lion tries to capture a man who is as fast as the lion. We study a new version of this game which takes place in a Euclidean environment with a circ...