Advertisement

Introducing Preferences into Commitment Protocols

  • Ashok U. Mallya
  • Munindar P. Singh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3859)

Abstract

Commitment protocols enable flexibility in agent interactions by utilizing the semantics of commitments to develop succinct declarative specifications for protocols that allow a large number of executions. As a consequence, commitment protocols enable agents to accommodate varying local policies and respond to exceptions. A consequent weakness of such protocols is that commitment protocols thus fail to distinguish between possible executions that are normal and those that may be allowed but are not ideal. This paper develops an approach for specifying preferences among executions that are allowed by a protocol. It captures sets of executions via a simple language and gives them a denotational characterization based on branching-time models. It shows how to incorporate the specifications into rulesets, thereby giving the specifications a natural operational characterization. The rulesets embed into a recent practical framework for protocols called OWL-P. The paper shows that the operational and denotational characterizations coincide.

Keywords

MultiAgent System Preference Structure Preference Lattice Agent Interaction Price Quote 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ashok U. Mallya
    • 1
  • Munindar P. Singh
    • 1
  1. 1.Department of Computer ScienceNorth Carolina State University RaleighUSA

Personalised recommendations