Addressing the Brittleness of Agent Interaction

F. Hassan; D. Robertson

doi:10.1007/978-3-540-89674-6_24

Addressing the Brittleness of Agent Interaction

F. Hassan, D. Robertson

School of Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The field of multi-agent systems shifts attention from one particular agent to a society of agents; hence the interactions between agents in the society become critical towards the achievement of their goals. We assume that the interactions are managed via a protocol which enables agents to coordinate their actions in order to handle the dependencies that exist between their activities. However, the agents’ failures to comply with the constraints imposed by the protocol may cause the agents to have brittle interactions. To address this problem, a constraint relaxation approach derived from the Distributed Partial Constraint Satisfaction Problem (CSP) is proposed. This paper describes the computational aspects of the approach (i.e. specification of a distance metric, searching for a solvable problem and specification of a global distance function).

Original language	English
Title of host publication	Intelligent Agents and Multi-Agent Systems
Subtitle of host publication	11th Pacific Rim International Conference on Multi-Agents, PRIMA 2008, Hanoi, Vietnam, December 15-16, 2008. Proceedings
Publisher	Springer Berlin Heidelberg
Pages	214-221
Number of pages	8
ISBN (Electronic)	978-3-540-89674-6
ISBN (Print)	978-3-540-89673-9
DOIs	https://doi.org/10.1007/978-3-540-89674-6_24
Publication status	Published - 2008

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin Heidelberg
Volume	5357
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/978-3-540-89674-6_24

http://link.springer.com/chapter/10.1007%2F978-3-540-89674-6_24

Fingerprint Dive into the research topics of 'Addressing the Brittleness of Agent Interaction'. Together they form a unique fingerprint.

Cite this

Hassan, F., & Robertson, D. (2008). Addressing the Brittleness of Agent Interaction. In Intelligent Agents and Multi-Agent Systems: 11th Pacific Rim International Conference on Multi-Agents, PRIMA 2008, Hanoi, Vietnam, December 15-16, 2008. Proceedings (pp. 214-221). (Lecture Notes in Computer Science; Vol. 5357). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-89674-6_24

@inproceedings{e447d4b488b049479da077e22a4be634,

title = "Addressing the Brittleness of Agent Interaction",

abstract = "The field of multi-agent systems shifts attention from one particular agent to a society of agents; hence the interactions between agents in the society become critical towards the achievement of their goals. We assume that the interactions are managed via a protocol which enables agents to coordinate their actions in order to handle the dependencies that exist between their activities. However, the agents{\textquoteright} failures to comply with the constraints imposed by the protocol may cause the agents to have brittle interactions. To address this problem, a constraint relaxation approach derived from the Distributed Partial Constraint Satisfaction Problem (CSP) is proposed. This paper describes the computational aspects of the approach (i.e. specification of a distance metric, searching for a solvable problem and specification of a global distance function).",

author = "F. Hassan and D. Robertson",

year = "2008",

doi = "10.1007/978-3-540-89674-6_24",

language = "English",

isbn = "978-3-540-89673-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin Heidelberg",

pages = "214--221",

booktitle = "Intelligent Agents and Multi-Agent Systems",

}

Hassan, F & Robertson, D 2008, Addressing the Brittleness of Agent Interaction. in Intelligent Agents and Multi-Agent Systems: 11th Pacific Rim International Conference on Multi-Agents, PRIMA 2008, Hanoi, Vietnam, December 15-16, 2008. Proceedings. Lecture Notes in Computer Science, vol. 5357, Springer Berlin Heidelberg, pp. 214-221. https://doi.org/10.1007/978-3-540-89674-6_24

Addressing the Brittleness of Agent Interaction. / Hassan, F.; Robertson, D.

Intelligent Agents and Multi-Agent Systems: 11th Pacific Rim International Conference on Multi-Agents, PRIMA 2008, Hanoi, Vietnam, December 15-16, 2008. Proceedings. Springer Berlin Heidelberg, 2008. p. 214-221 (Lecture Notes in Computer Science; Vol. 5357).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Addressing the Brittleness of Agent Interaction

AU - Hassan, F.

AU - Robertson, D.

PY - 2008

Y1 - 2008

N2 - The field of multi-agent systems shifts attention from one particular agent to a society of agents; hence the interactions between agents in the society become critical towards the achievement of their goals. We assume that the interactions are managed via a protocol which enables agents to coordinate their actions in order to handle the dependencies that exist between their activities. However, the agents’ failures to comply with the constraints imposed by the protocol may cause the agents to have brittle interactions. To address this problem, a constraint relaxation approach derived from the Distributed Partial Constraint Satisfaction Problem (CSP) is proposed. This paper describes the computational aspects of the approach (i.e. specification of a distance metric, searching for a solvable problem and specification of a global distance function).

AB - The field of multi-agent systems shifts attention from one particular agent to a society of agents; hence the interactions between agents in the society become critical towards the achievement of their goals. We assume that the interactions are managed via a protocol which enables agents to coordinate their actions in order to handle the dependencies that exist between their activities. However, the agents’ failures to comply with the constraints imposed by the protocol may cause the agents to have brittle interactions. To address this problem, a constraint relaxation approach derived from the Distributed Partial Constraint Satisfaction Problem (CSP) is proposed. This paper describes the computational aspects of the approach (i.e. specification of a distance metric, searching for a solvable problem and specification of a global distance function).

U2 - 10.1007/978-3-540-89674-6_24

DO - 10.1007/978-3-540-89674-6_24

M3 - Conference contribution

SN - 978-3-540-89673-9

T3 - Lecture Notes in Computer Science

SP - 214

EP - 221

BT - Intelligent Agents and Multi-Agent Systems

PB - Springer Berlin Heidelberg

ER -