Constraint relaxation to reduce brittleness of distributed agent protocols

Incompatible goals among multiple agents working on domains involving finite constraints can be a source of conflict. This conflict, in the form of incompatible constraints established locally by the agents and imposed on the negotiated variables, may break the dialogue between these agents eve...

Full description

Bibliographic Details
Main Authors: Hassan, M.F., Robertson, D.
Format: Conference or Workshop Item
Language:English
Published: 2004
Subjects:
Online Access:http://scholars.utp.edu.my/id/eprint/1920/
http://scholars.utp.edu.my/id/eprint/1920/1/Constraint_relaxation1.pdf
_version_ 1848659184822779904
author Hassan, M.F.
Robertson, D.
author_facet Hassan, M.F.
Robertson, D.
author_sort Hassan, M.F.
building UTP Institutional Repository
collection Online Access
description Incompatible goals among multiple agents working on domains involving finite constraints can be a source of conflict. This conflict, in the form of incompatible constraints established locally by the agents and imposed on the negotiated variables, may break the dialogue between these agents even though they could, in principle, reach an agreement. A common means of coordinating multi-agent systems is by using protocols to which are attached constraints on interaction; but protocols are brittle, in the sense that the constraints they contain must either succeed or fail, and if they fail the entire protocol may fail. We apply a constraint relaxation technique originally for automated negotiation using a distributed protocol language called the Lightweight Coordination Calculus (LCC), in order to overcome a class of conflicts, making protocols less brittle. This approach is illustrated in a scenario involving the ordering and configuration of a computer between the customer and vendor agents.
first_indexed 2025-11-13T07:26:24Z
format Conference or Workshop Item
id oai:scholars.utp.edu.my:1920
institution Universiti Teknologi Petronas
institution_category Local University
language English
last_indexed 2025-11-13T07:26:24Z
publishDate 2004
recordtype eprints
repository_type Digital Repository
spelling oai:scholars.utp.edu.my:19202017-01-19T08:27:35Z http://scholars.utp.edu.my/id/eprint/1920/ Constraint relaxation to reduce brittleness of distributed agent protocols Hassan, M.F. Robertson, D. QA75 Electronic computers. Computer science QA76 Computer software Incompatible goals among multiple agents working on domains involving finite constraints can be a source of conflict. This conflict, in the form of incompatible constraints established locally by the agents and imposed on the negotiated variables, may break the dialogue between these agents even though they could, in principle, reach an agreement. A common means of coordinating multi-agent systems is by using protocols to which are attached constraints on interaction; but protocols are brittle, in the sense that the constraints they contain must either succeed or fail, and if they fail the entire protocol may fail. We apply a constraint relaxation technique originally for automated negotiation using a distributed protocol language called the Lightweight Coordination Calculus (LCC), in order to overcome a class of conflicts, making protocols less brittle. This approach is illustrated in a scenario involving the ordering and configuration of a computer between the customer and vendor agents. 2004 Conference or Workshop Item PeerReviewed application/pdf en http://scholars.utp.edu.my/id/eprint/1920/1/Constraint_relaxation1.pdf Hassan, M.F. and Robertson, D. (2004) Constraint relaxation to reduce brittleness of distributed agent protocols. In: ECAI Workshop on Coordination in Emergent Agent Societies, 2004, Valencia, Spain.
spellingShingle QA75 Electronic computers. Computer science
QA76 Computer software
Hassan, M.F.
Robertson, D.
Constraint relaxation to reduce brittleness of distributed agent protocols
title Constraint relaxation to reduce brittleness of distributed agent protocols
title_full Constraint relaxation to reduce brittleness of distributed agent protocols
title_fullStr Constraint relaxation to reduce brittleness of distributed agent protocols
title_full_unstemmed Constraint relaxation to reduce brittleness of distributed agent protocols
title_short Constraint relaxation to reduce brittleness of distributed agent protocols
title_sort constraint relaxation to reduce brittleness of distributed agent protocols
topic QA75 Electronic computers. Computer science
QA76 Computer software
url http://scholars.utp.edu.my/id/eprint/1920/
http://scholars.utp.edu.my/id/eprint/1920/1/Constraint_relaxation1.pdf