Multiagent Coordination Using Probability Collectives

This thesis motivates and describes the use of probability collectives (PC) with a multiagent coordination system to solve different problems. The main challenge was to enable the agents to work in a coordinated way, optimizing the local utilities and contributing the maximum or minimum towards optimisation of a global objective. The approach was validated solving numerical benchmark problems such as sphere function in which the coupled variables are seen as autonomous agents working collectively to achieve the optimum solution. Moreover, PC algorithm solved successfully repeated games such as prisoner‟s dilemma, stag hunt, the battle of sexes game and choose sides. In all experimental trials, the optimum results were obtained at a reasonable computational cost. Keywords: Probability Collectives, Collective intelligence, Multiagent systems, Game theory.