How local is that optimum? k-optimality for DCOP

Authors:
Jonathan P. Pearce;Rajiv T. Maheswaran;Milind Tambe
Affiliations:
University of Southern California, Los Angeles, CA;University of Southern California, Los Angeles, CA;University of Southern California, Los Angeles, CA
Venue:
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Year:
2005

Citing 2
Cited 1

Coding Theory: A First Course

Coding Theory: A First Course
Adopt: asynchronous distributed constraint optimization with quality guarantees

Artificial Intelligence - Special issue: Distributed constraint satisfaction

Conflicts in teamwork: hybrids to the rescue

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In multi-agent systems where sets of joint actions (JAs) are generated, metrics are needed to evaluate these sets and efficiently allocate resources for the many JAs. For the case where a JA set can be represented by multiple solutions to a DCOP. we introduce k-optimality as a metric that captures desirable properties of diversity and relative quality, and apply results from coding theory to obtain upper bounds on cardinalities of k-optimal JA sets. These bounds can help choose the appropriate level of k-optimality for settings with fixed resources and help determine appropriate resource allocation for settings where a fixed level of k-optimality is desired.