Randomized distributed access to mutually exclusive resources

Moshe Dror, Bruce Hartman, Gary Knotts, Dajun Zeng

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Many systems consist of a set of agents which must acquire exclusive access to resources from a shared pool. Coordination of agents in such systems is often implemented in the form of a centralized mechanism. The intervention of this type of mechanism, however, typically introduces significant computational overhead and reduces the amount of concurrent activity. Alternatives to centralized mechanisms exist, butthey generally suffer from the need for extensive interagent communication. In this paper, we develop a randomized approach to make multiagent resource-allocation decisions with the objective of maximizing expected concurrency measured by the number of the active agents. This approach does not assume a centralized mechanism and has no need for interagent communication. Compared to existing autonomous-decentralized-decision-making (ADDM)-based approaches for resource-allocation, our work emphasizes achieving the highest degree of agent autonomy and is able to handle more general resource requirements.

Original languageEnglish (US)
Pages (from-to)1-18
Number of pages18
JournalJournal of Applied Mathematics and Decision Sciences
Volume2005
Issue number1
DOIs
StatePublished - 2005
Externally publishedYes

Fingerprint

Mutually exclusive
Resource allocation
Resources
Communication
Resource Allocation
Decision making
Concurrency
Decentralized
Concurrent
Decision Making
Alternatives
Requirements

ASJC Scopus subject areas

  • Applied Mathematics
  • Computational Mathematics
  • Statistics and Probability
  • Decision Sciences(all)

Cite this

Randomized distributed access to mutually exclusive resources. / Dror, Moshe; Hartman, Bruce; Knotts, Gary; Zeng, Dajun.

In: Journal of Applied Mathematics and Decision Sciences, Vol. 2005, No. 1, 2005, p. 1-18.

Research output: Contribution to journalArticle

@article{8bf50bcddb344d1188329fe8d07cd079,
title = "Randomized distributed access to mutually exclusive resources",
abstract = "Many systems consist of a set of agents which must acquire exclusive access to resources from a shared pool. Coordination of agents in such systems is often implemented in the form of a centralized mechanism. The intervention of this type of mechanism, however, typically introduces significant computational overhead and reduces the amount of concurrent activity. Alternatives to centralized mechanisms exist, butthey generally suffer from the need for extensive interagent communication. In this paper, we develop a randomized approach to make multiagent resource-allocation decisions with the objective of maximizing expected concurrency measured by the number of the active agents. This approach does not assume a centralized mechanism and has no need for interagent communication. Compared to existing autonomous-decentralized-decision-making (ADDM)-based approaches for resource-allocation, our work emphasizes achieving the highest degree of agent autonomy and is able to handle more general resource requirements.",
author = "Moshe Dror and Bruce Hartman and Gary Knotts and Dajun Zeng",
year = "2005",
doi = "10.1155/JAMDS.2005.1",
language = "English (US)",
volume = "2005",
pages = "1--18",
journal = "Journal of Applied Mathematics and Decision Sciences",
issn = "1173-9126",
publisher = "Hindawi Publishing Corporation",
number = "1",

}

TY - JOUR

T1 - Randomized distributed access to mutually exclusive resources

AU - Dror, Moshe

AU - Hartman, Bruce

AU - Knotts, Gary

AU - Zeng, Dajun

PY - 2005

Y1 - 2005

N2 - Many systems consist of a set of agents which must acquire exclusive access to resources from a shared pool. Coordination of agents in such systems is often implemented in the form of a centralized mechanism. The intervention of this type of mechanism, however, typically introduces significant computational overhead and reduces the amount of concurrent activity. Alternatives to centralized mechanisms exist, butthey generally suffer from the need for extensive interagent communication. In this paper, we develop a randomized approach to make multiagent resource-allocation decisions with the objective of maximizing expected concurrency measured by the number of the active agents. This approach does not assume a centralized mechanism and has no need for interagent communication. Compared to existing autonomous-decentralized-decision-making (ADDM)-based approaches for resource-allocation, our work emphasizes achieving the highest degree of agent autonomy and is able to handle more general resource requirements.

AB - Many systems consist of a set of agents which must acquire exclusive access to resources from a shared pool. Coordination of agents in such systems is often implemented in the form of a centralized mechanism. The intervention of this type of mechanism, however, typically introduces significant computational overhead and reduces the amount of concurrent activity. Alternatives to centralized mechanisms exist, butthey generally suffer from the need for extensive interagent communication. In this paper, we develop a randomized approach to make multiagent resource-allocation decisions with the objective of maximizing expected concurrency measured by the number of the active agents. This approach does not assume a centralized mechanism and has no need for interagent communication. Compared to existing autonomous-decentralized-decision-making (ADDM)-based approaches for resource-allocation, our work emphasizes achieving the highest degree of agent autonomy and is able to handle more general resource requirements.

UR - http://www.scopus.com/inward/record.url?scp=34547609281&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547609281&partnerID=8YFLogxK

U2 - 10.1155/JAMDS.2005.1

DO - 10.1155/JAMDS.2005.1

M3 - Article

AN - SCOPUS:34547609281

VL - 2005

SP - 1

EP - 18

JO - Journal of Applied Mathematics and Decision Sciences

JF - Journal of Applied Mathematics and Decision Sciences

SN - 1173-9126

IS - 1

ER -