In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from ever...
We consider the problem of learning to attain multiple goals in a dynamic environment, which is initially unknown. In addition, the environment may contain arbitrarily varying ele...
Negotiation can be regarded as playing a game with certain rules. If the rules change, the game has to be played differently. Compared to traditional markets, electronic markets ca...
Although TD-Gammon is one of the major successes in machine learning, it has not led to similar impressive breakthroughs in temporal difference learning for other applications or ...
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solv...