.png){kind=icon}
返回
Induction over Strategic Agents: a genetic algorithm solution
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-008-0485-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Discriminant analysis
Principal-agent
Strategic gaming
Generalization
Adversarial learning
Genetic algorithms
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
.png){kind=icon}
