796 search results - page 79 / 160 » The canonical function game |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
In this work, we study the problem of power allocation in teams. Each team consists of two agents who try to split their available power between the tasks of communication and jam...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We construct a family of iterative discretization algorithms for computing sequences of finitely-supported correlated equilibria of n-player games with polynomial utility func...
CAAN
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
CDC
2009
IEEE
14 years 16 days ago
2009
IEEE
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...