Induction over Strategic Agents: a genetic algorithm solution

We study the problem called Induction over Strategic Agents. This problem has proven hard to solve, even for small problems. We start by reducing the problem to an unconstrained search over w∈ℜn. Once we accomplish this, we develop a Genetic Algorithm to perform this search. We compare our results to those obtained on a Mixed Integer formulation.