Vidal's libraryTitle: | A Cooperative mediation-based protocol for dynamic distributed resource allocation |
Author: | Roger Mailler and Victor Lesser |
Journal: | IEEE Transactions on Systems, Man and Cybernetics, Part C |
Volume: | 36 |
Number: | 1 |
Pages: | 80--91 |
Year: | 2006 |
DOI: | 10.1109/TSMCC.2005.860577 |
Abstract: | In this paper, we present a cooperative mediation-based protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic environment. Two central principles are used in this protocol that allow it to operate in constantly changing conditions. First, we frame the allocation problem as an optimization problem, similar to a partial constraint satisfaction problem (PCSP), and use relaxation techniques to derive conflict (constraint violation) free solutions. Second, by using overlapping mediation sessions to conduct the search, we are able to prune large parts of the search space by using a form of arc-consistency. This allows the protocol to both quickly identify situations when the problem is over-constrained, and to determine the appropriate repair. From the global perspective, the protocol has a hill climbing behavior and because it was designed to work in dynamic environments, is approximate. We describe the domain which inspired the creation of this protocol, as well as discuss experimental results. |
@Article{mailler06a,
author = {Roger Mailler and Victor Lesser},
title = {A Cooperative mediation-based protocol for dynamic
distributed resource allocation},
journal = {{IEEE} Transactions on Systems, Man and Cybernetics,
Part {C}},
year = 2006,
volume = 36,
number = 1,
pages = {80--91},
abstract = {In this paper, we present a cooperative
mediation-based protocol that solves a distributed
resource allocation problem while conforming to soft
real-time constraints in a dynamic environment. Two
central principles are used in this protocol that
allow it to operate in constantly changing
conditions. First, we frame the allocation problem
as an optimization problem, similar to a partial
constraint satisfaction problem (PCSP), and use
relaxation techniques to derive conflict (constraint
violation) free solutions. Second, by using
overlapping mediation sessions to conduct the
search, we are able to prune large parts of the
search space by using a form of
arc-consistency. This allows the protocol to both
quickly identify situations when the problem is
over-constrained, and to determine the appropriate
repair. From the global perspective, the protocol
has a hill climbing behavior and because it was
designed to work in dynamic environments, is
approximate. We describe the domain which inspired
the creation of this protocol, as well as discuss
experimental results.},
doi = {10.1109/TSMCC.2005.860577},
url = {http://jmvidal.cse.sc.edu/library/mailler06a.pdf},
keywords = {multiagent negotiation}
}
Last modified: Wed Mar 9 10:16:35 EST 2011