.png){kind=icon}
.png){kind=icon}
Return
Induction over Strategic Agents: a genetic algorithm solution
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-008-0485-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 waae (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.
Keywords:
Discriminant analysis
Principal-agent
Strategic gaming
Generalization
Adversarial learning
Genetic algorithms
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
