Corpus ID: 18161186

The Conditions for Commitments

  title={The Conditions for Commitments},
  author={Scott N. Gerard},
Previous work describes the use of formal commitments to mediate the communication between autonomous agents through commitment-based protocols. I extend that work to examine the conditions that encourage the success of agents that use commitments. I define a parameterized and iterated Committer’s Dilemma game that extends the well-known Prisoner’s Dilemma game, and then use this game and different agent strategies to examine how the conditions for commitments affect game outcomes. I describe… Expand

Figures and Tables from this paper


Behavior-Oriented Commitment-based Protocols
This work introduces the notion of behavior-oriented commitment-based protocols, which account both for the constitutive and the regulative specifications and that explicitly foresee a representation of the latter based on constraints among commitments. Expand
Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations
This exciting and pioneering new overview of multiagent systems, which are online systems composed of multiple interacting intelligent agents, i.e., online trading, offers a newly seen computerExpand
Commitment Machines
It is shown how a commitment machine can be compiled into a finite state machine for efficient execution, and soundness and completeness of the compilation procedure are proved. Expand
An Ontology for Commitments in Multiagent Systems: Toward a Unification of Normative Concepts
This work synthesizes ideas from multiagent systems, particularly the idea of social context, with ideas from ethics and legal reasoning, specifically that of directed obligations in the Hohfeldian tradition, to capture normative concepts such as obligations, taboos, conventions, and pledges as different kinds of commitments. Expand
Positron : Composing Commitment Protocols
  • 2013
We consider (commitment) protocols specified formally in terms of their roles, their messages, and the meanings of their messages (expressed as commitments). In an important advance over previousExpand
Playing Games with Genetic Algorithms
In 1987 the first published research appeared which used the Genetic Algorithm as a means of seeking better strategies in playing the repeated Prisoner’s Dilemma. Since then the application ofExpand
Amongst First-Class Protocols
This paper explores the most prominent approaches to agency and multi-agent systems use of interaction protocols and compares them. Expand
The evolution of cooperation.
A model is developed based on the concept of an evolutionarily stable strategy in the context of the Prisoner's Dilemma game to show how cooperation based on reciprocity can get started in an asocial world, can thrive while interacting with a wide range of other strategies, and can resist invasion once fully established. Expand
Formalizing and verifying protocol refinements
Proton is developed, an analysis tool for protocol specifications that overlays a model checker to compute whether one protocol refines another with respect to a stated mapping. Expand
An Introduction to Genetic Algorithms.
An Introduction to Genetic Algorithms is one of the rare examples of a book in which every single page is worth reading. The author, Melanie Mitchell, manages to describe in depth many fascinatingExpand