Research Repository

A game theory framework for clustering

Salhi, A and Lausen, B and Rohmatul, F and Baeshen, M and Töreyen, Ö (2010) 'A game theory framework for clustering.' In: Goh, KY, (ed.) Proceedings of the 6th IMT-GT Conference on Mathematics, Statistics and its Applications (ICMSA2010). Wiley, 552 - 564. ISBN 978-983-41743-3-0

[img]
Preview
PDF
ST-Salhi.pdf

Download (473kB) | Preview

Abstract

The Game Theory-based Multi-Agent System (GTMAS) of Toreyen and Salhi, [10] and [12], implements a loosely coupled hybrid algorithm that may involve any number of algorithms suitable, a priori, for the solution of a given optimisation problem. The system allows the available algorithms to co-operate toward the solution of the problem in hand as well as compete for the computing facilities they require to run. This co-operative/competitive aspect is captured through the implementation of the Prisoners? Dilemma paradigm of game theory. Here, we apply GTMAS to the problem of clustering European Union (EU) economies, including Turkey, to find out whether the latter, based on a number of criteria, can fit in the EU and find out which countries, if any, it has strong similaries with. This clustering problem is first converted into an optimisation problem, namely the Travelling Salesman Problem (TSP) before being solved with GTMAS involving two players (agents) each implementing a standard combinatorial optimisation algorithm. Computational results are included.

Item Type: Book Section
Uncontrolled Keywords: Multi-Agent System; Game Theory; Payoff Table; Optimisation; TSP; Clustering
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science and Health > Mathematical Sciences, Department of
Depositing User: Jim Jamieson
Date Deposited: 09 Jan 2012 14:56
Last Modified: 06 Feb 2018 11:15
URI: http://repository.essex.ac.uk/id/eprint/1823

Actions (login required)

View Item View Item