A swarm intelligence algorithm based game theory

Authors:
Yan-ping Bai;Yu Zhang
Affiliations:
School of Management, Capital Normal University, Beijing, 100048, China;State Key Laboratory for GeoMechanics and Deep Underground Engineering, China University of Mining and Technology, Beijing, 100083, China/ Department of Computer Teaching and Network Information, ...
Venue:
International Journal of Computing Science and Mathematics
Year:
2013

Citing 11
Cited 0

Algorithmic mechanism design (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Game theory perspectives on client: vendor relationships in offshore software outsourcing

Proceedings of the 2006 international workshop on Economics driven software engineering research
Algorithmic Game Theory

Algorithmic Game Theory
Computer science and game theory

Communications of the ACM - Designing games with a purpose
A survey on game theory applications in wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A fuzzy particle swarm optimization algorithm for computer communication network topology design

Applied Intelligence
A refactoring method for cache-efficient swarm intelligence algorithms

Information Sciences: an International Journal
An application of swarm intelligence to distributed image retrieval

Information Sciences: an International Journal
A modified Artificial Bee Colony algorithm for real-parameter optimization

Information Sciences: an International Journal
A single pass algorithm for clustering evolving data streams based on swarm intelligence

Data Mining and Knowledge Discovery
A mixed-discrete Particle Swarm Optimization algorithm with explicit diversity-preservation

Structural and Multidisciplinary Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we established a relationship between particle swarm optimisation algorithms and game theory. On that basis, a swarm intelligence-based search mechanism is proposed and applied to solving the attribute reduction problem in the context of rough sets. The proposed attribute reduction algorithm can set up different participatory groups and game strategies, construct corresponding pay utility matrix, and produce optimal combinations through gaming procedure. Numerical experiments on a number of UCI datasets show the proposed game strategies-based reduction algorithm is superior to particle swarm optimisation, tabu search, gene algorithm and PSO with mutation operator in terms of solution quality, and has lower computational cost.