128 search results - page 15 / 26 » Representation and Complexity in Boolean Games |
ACG
2009
Springer
14 years 4 months ago
2009
Springer
Retrograde analysis is a tool for reconstructing a game tree starting from its leaves; with these techniques one can solve specific subsets of a complex game, achieving optimal pl...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
EWCBR
2008
Springer
13 years 11 months ago
2008
Springer
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
WWW
2005
ACM
14 years 3 months ago
2005
ACM
The interoperability among distributed and autonomous systems is the ultimate challenge facing the semantic web. Heterogeneity of data representation is the main source of problem...
ATAL
2007
Springer
14 years 4 months ago
2007
Springer
We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic ...