Sciweavers

612 search results - page 47 / 123
» An Empirical Study of Agent Programs
Sort
View
FLAIRS
2004
13 years 10 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
AUSAI
2003
Springer
14 years 2 months ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar
AAAI
2010
13 years 10 months ago
Facilitating the Evaluation of Automated Negotiators using Peer Designed Agents
Computer agents are increasingly deployed in settings in which they make decisions with people, such as electronic commerce, collaborative interfaces, and cognitive assistants. Ho...
Raz Lin, Sarit Kraus, Yinon Oshrat, Ya'akov (Kobi)...
AAAI
2006
13 years 10 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons
ICMAS
1998
13 years 10 months ago
Leveled Commitment Contracting among Myopic Individually Rational Agents
In automated negotiation systems consisting of selfinterested agents, contracts have traditionally been binding, i.e., impossible to breach. Such contracts do not allow the agents...
Martin Andersson, Tuomas Sandholm