The application of linear programming technologies to the optimization of conflict problems
Authors:
- 1 September 2005
- journal article
- research article
- Published by Taylor & Francis in Journal of Information and Optimization Sciences
- Vol. 26 (3) , 693-713
Abstract
Due to information exchange among the conflict participants, conflict resolution occurs. Either through direct negotiation between the agents or through a third party known as the ‘mediator’ [1] [2], conflict resolution can be achieved. Because the solving of distributed problem, considering how the work of solving a particular problem, can be divided among a number of agents, the domain in which this strategy applies is one in which a macro-level or global perspective of problems and solutions may be best achieved by centralized control. In this paper, it develops several different mathematical models of which each tries to resolve the conflict in a multi-agent system by providing a possible solution to the problem. Among these mathematical models this paper concentrates on the Linear Programming model to develop its Conflict Resolution algorithm and implement it on AGENT-0.Keywords
This publication has 3 references indexed in Scilit:
- Parallel Programming Systems1993
- Participant Systems for Cooperative Work1987
- Planning with constraints (MOLGEN: Part 1)Artificial Intelligence, 1981