A Cooperative Network Game Efficiently Solved via an Ant Colony Optimization Approach

Abstract. In this paper, a Cooperative Network Game (CNG) is introduced. In this game, all players have the same goal: display a video content in real time, with no cuts and low buffering time. Inspired in cooperation and symmetry, all players should apply the same strategy, resulting in a fair play. For each strategy we shall define a score, and the search of the best one characterizes a Combinatorial Optimization Problem (COP). In this research we show that this search can be translated into a suitable Assymmetric Traveling Salesman Problem (ATSP). An Ant Colony Optimization (ACO) approach is defined, obtaining highly competitive solutions for the CNG. Finally, we play the game in a real context, using a new strategy in a Peer-to-Peer (P2P) platform, obtaining better results than previous strategies. Key words: COP, ATSP, ACO, P2P. 1 General Network Game

• Type: Journal
• Year: 2010
• Where: ANTSW
• Authors: Pablo Romero, Franco Robledo, Pablo Rodríguez-Bocca, Darío Padula, María Elisa Bertinat
• Keywords: ANTSW 2010, Artificial Intelligence, Cooperative Network Game, Low Buffering Time, Network Game