Sciweavers

606 search results - page 66 / 122
» Least-Commitment Action Selection
Sort
View
ATAL
2003
Springer
14 years 1 months ago
Towards a pareto-optimal solution in general-sum games
Multiagent learning literature has investigated iterated twoplayer games to develop mechanisms that allow agents to learn to converge on Nash Equilibrium strategy profiles. Such ...
Sandip Sen, Stéphane Airiau, Rajatish Mukhe...
ENTCS
2006
134views more  ENTCS 2006»
13 years 8 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
JSAC
2010
138views more  JSAC 2010»
13 years 6 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar
ATAL
2005
Springer
14 years 1 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
ECAI
2010
Springer
13 years 9 months ago
ANTIPA: an agent architecture for intelligent information assistance
Abstract. Human users trying to plan and accomplish informationdependent goals in highly dynamic environments with prevalent uncertainty must consult various types of information s...
Jean Oh, Felipe Meneguzzi, Katia P. Sycara