98 search results - page 19 / 20 » Extending SATPLAN to Multiple Agents |
AAAI
2011
12 years 8 months ago
2011
The standard approach to computing an optimal mixed strategy to commit to is based on solving a set of linear programs, one for each of the follower’s pure strategies. We show t...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Learning, planning, and representing knowledge in large state t multiple levels of temporal abstraction are key, long-standing challenges for building flexible autonomous agents. ...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
—The real world is composed of sets of objects that move and morph in both space and time. Useful concepts can be defined in terms of the complex interactions between the multi-...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
The most important and interesting of the computing challenges we are facing are those that involve the problems and opportunities afforded by massive decentralization and disinte...
SIGECOM
2010
ACM
14 years 1 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...