143 search results - page 20 / 29 » Computational Model for Online Agent Negotiation |
ATAL
2008
Springer
13 years 9 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 ...
CIMCA
2005
IEEE
14 years 1 months ago
2005
IEEE
Owing to the increase in both heterogeneity and complexity in today’s networking systems, the need arises for an architecture for network-based services that provides flexibilit...
AAAI
2008
13 years 9 months ago
2008
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
WSC
2001
13 years 8 months ago
2001
The need for new theoretical and experimental approaches to understand dynamic and heterogeneous behavior in complex economic and social systems is increasing recently. An approac...