Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Pr...
We introduce Transformation Games (TGs), a form of coalitional game in which players are endowed with sets of initial resources, and have capabilities allowing them to derive certa...
Yoram Bachrach, Michael Zuckerman, Michael Wooldri...
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such setti...
— Channel allocation was extensively studied in the framework of cellular networks. But the emergence of new system concepts, such as cognitive radio systems, has brought this to...