A genetic algorithm for a sensor device location problem

In this paper we present a noncooperative game theoretical model for the well known problem of experimental design. A virtual player decides the design variables of an experiment and all the players solve a Nash equilibrium problem by optimizing suitable payoff functions. We consider the case where the design variables are the coordinates of n points in a region of the plane and we look for the optimal configuration of the points under some constraints. Arising from a concrete situation, concerning the ARGO-YBJ experiments, the goal is to find the optimal configuration of the detector, consisting of a single layer of resistive plate counters. Theoretical and computational results are presented for this location problem.