TY - GEN
T1 - Towards a formal approach to overhearing
T2 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004
AU - Gutnik, Gery
AU - Kaminka, Gal
PY - 2004
Y1 - 2004
N2 - Overhearing is gaining attention as a generic method for cooperative monitoring of distributed, open, multi-agent systems. It involves monitoring the routine conversations of agents-who know they are being overheard-to assist the agents, assess their progress, or suggest advice. While there have been several investigations of applications and methods of overhearing, no formal model of overhearing exists. This paper takes steps towards such a model. It first formalizes a conversation system-the set of conversations in a multi-agent system. It then defines a key step in overhearing-conversation recognition-identifying the conversations that took place within a system, given a set of overheard messages. We provide a skeleton algorithm for conversation recognition, and provide instantiations of it for settings involving no message loss, random message loss, and systematic message loss (such as always losing one side of the conversation). We analyze the complexity of these algorithms, and show that the systematic message loss algorithm, which is unique to overhearing, is significantly more efficient then the random loss algorithm (which is intractable).
AB - Overhearing is gaining attention as a generic method for cooperative monitoring of distributed, open, multi-agent systems. It involves monitoring the routine conversations of agents-who know they are being overheard-to assist the agents, assess their progress, or suggest advice. While there have been several investigations of applications and methods of overhearing, no formal model of overhearing exists. This paper takes steps towards such a model. It first formalizes a conversation system-the set of conversations in a multi-agent system. It then defines a key step in overhearing-conversation recognition-identifying the conversations that took place within a system, given a set of overheard messages. We provide a skeleton algorithm for conversation recognition, and provide instantiations of it for settings involving no message loss, random message loss, and systematic message loss (such as always losing one side of the conversation). We analyze the complexity of these algorithms, and show that the systematic message loss algorithm, which is unique to overhearing, is significantly more efficient then the random loss algorithm (which is intractable).
UR - http://www.scopus.com/inward/record.url?scp=4544322790&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:4544322790
SN - 1581138644
T3 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004
SP - 78
EP - 85
BT - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagents Systems, AAMAS 2004
A2 - Jennings, N.R.
A2 - Sierra, C.
A2 - Sonenberg, L.
A2 - Tambe, M.
Y2 - 19 July 2004 through 23 July 2004
ER -