Multistage negotiation for distributed constraint satisfaction

Conry, Susan; Kuwabara, Kazuhiro; Lesser, Victor; Meyer, Robert K.

doi:10.1109/21.135689

Cited by 151 publications

(52 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In recent years we have seen an increasing interest in Distributed Constraint Satisfaction Problem (DisCSP) formulations to model combinatorial problems arising in distributed, multi-agent environments [2,14,16,17,18,20]. There is a rich set of real-world distributed applications, such as in the area of networked systems, for which the DisCSP paradigm is particularly useful.…”

Section: Introductionmentioning

confidence: 99%

Communication and Computation in Distributed CSP Algorithms

Fernàndez

Béjar

Krishnamachari

et al. 2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We introduce SensorDCSP, a naturally distributed benchmark based on a real-world application that arises in the context of networked distributed systems. In order to study the performance of Distributed CSP (DisCSP) algorithms in a truly distributed setting, we use a discrete-event network simulator, which allows us to model the impact of different network traffic conditions on the performance of the algorithms. We consider two complete DisCSP algorithms: asynchronous backtracking (ABT) and asynchronous weak commitment search (AWC). In our study of different network traffic distributions, we found that, random delays, in some cases combined with a dynamic decentralized restart strategy, can improve the performance of DisCSP algorithms. More interestingly, we also found that the active introduction of message delays by agents can improve performance and robustness, while reducing the overall network load. Finally, our work confirms that AWC performs better than ABT on satisfiable instances. However, on unsatisfiable instances, the performance of AWC is considerably worse than ABT.

show abstract

Section: Introductionmentioning

confidence: 99%

Communication and Computation in Distributed CSP Algorithms

Fernàndez

Béjar

Krishnamachari

et al. 2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This is known as agents who are self-directed [39], [40], [41], [42], [43], [44]. On other hand, externally-directed or cooperative agents maximize the utility of their organization considering the achievement of others as their own [21], [45], [46], and [47]. Dominant agents are a combination of these two types of agents inside the organization.…”

Section: Task Assignment Strategymentioning

confidence: 99%

Spontaneous Organizations: Collaborative Computing Model of a Networked Organization

Alqithami

Hexmoor

2012

Proceedings of the 8th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing

View full text Add to dashboard Cite

Abstract-In most real life organizations, actions usually occur irrationally among their members which modify the behaviors of the organizations. As in Occupy Wall Street (OWS), for instance, that starts in 2011, and it was ongoing over more than 600 communities since then. Social movement, as in the OWS, frequently detected to increase the network rapidly. Therefore, our attention in this paper is on social networks among agents and their effects on the organization and the others. We show a study of such a movement that we label as Spontaneous Organization (SO). We illustrate a life cycle of the SO from the formation of it until the dissolution while covering some important concepts that case such a huge viral spreading. We present a method that can be used to assign tasks to the agents inside the organization depending on their level of fitness. A simulation for a small example of the real life that mimics a spontaneous organization will be implemented using NetLogo for further validation.Social networks; nontraditional collaboration; multiagent Strategies.

show abstract

“…Potential DisCSPs are the problems dealing with the decision of a consistent combination of agent actions and decisions. Typical examples include distributed scheduling [13], distributed interpretation problems [14], multiagent truth maintenance systems (a distributed version of a truth maintenance system) [15,16] and distributed resource allocation problems in a communication network [17]. Owing to the conceptualization of a large number of distributed artificial intelligence (DAI) problems as DisCSPs, algorithms for solving DisCSP play a vital role in the development of DAI infrastructure [18].…”

Section: Related Workmentioning

confidence: 99%

A Hybrid Autonomic Computing-Based Approach to Distributed Constraint Satisfaction Problems

2015

View full text Add to dashboard Cite

Distributed constraint satisfaction problems (DisCSPs) are among the widely endeavored problems using agent-based simulation. Fernandez et al. formulated sensor and mobile tracking problem as a DisCSP, known as SensorDCSP In this paper, we adopt a customized ERE (environment, reactive rules and entities) algorithm for the SensorDCSP, which is otherwise proven as a computationally intractable problem. An amalgamation of the autonomy-oriented computing (AOC)-based algorithm (ERE) and genetic algorithm (GA) provides an early solution of the modeled DisCSP. Incorporation of GA into ERE facilitates auto-tuning of the simulation parameters, thereby leading to an early solution of constraint satisfaction. This study further contributes towards a model, built up in the NetLogo simulation environment, to infer the efficacy of the proposed approach.

show abstract

Multistage negotiation for distributed constraint satisfaction

Cited by 151 publications

References 8 publications

Communication and Computation in Distributed CSP Algorithms

Communication and Computation in Distributed CSP Algorithms

Spontaneous Organizations: Collaborative Computing Model of a Networked Organization

A Hybrid Autonomic Computing-Based Approach to Distributed Constraint Satisfaction Problems

Contact Info

Product

Resources

About