On Stable Multi-Agent Behavior in Face of Uncertainty

TL;DR

This paper introduces a computational framework for analyzing and synthesizing stable joint plans in multi-agent systems, ensuring goal achievement and deviation detection under uncertainty.

Contribution

It provides new methods for representing, verifying, and synthesizing stable joint plans in multi-agent environments.

Findings

Framework for stable joint plan analysis

Verification techniques for plan stability

Methods for synthesizing stable plans

Abstract

A stable joint plan should guarantee the achievement of a designer's goal in a multi-agent environment, while ensuring that deviations from the prescribed plan would be detected. We present a computational framework where stable joint plans can be studied, as well as several basic results about the representation, verification and synthesis of stable joint plans.