251 search results - page 45 / 51 » Agents Talking Faster |
AAAI
2012
11 years 11 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
AAAI
1993
13 years 10 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
We address the learning of trust based on past observations and context information. We argue that from the truster's point of view trust is best expressed as one of several ...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...