Activités de recherche : Algorithmique des systèmes en réseau

Résumé :

Statistical learning methods developed in the last decades have proved very useful for many applications. However, most algorithms were developed under the assumption that the data is independent from the algorithm. This is no longer true in applications where data is generated or provided by (human) strategic agents. As more and more modern applications indeed learn from data generated by strategic agents, it becomes increasingly crucial to account for the data-generator's incentives in order to design well-performing learning algorithms in practice.

In this talk, we show how game theory can be used to design learning algorithms adapted to strategic data on the example of classification of malicious behavior. In this example, a defender runs a classification algorithm to detect malicious behavior while an attacker chooses his attack strategy to balance the utility of the attack and the probability of being detected. We model explicitly the economic incentives of the learner and of the attacker generating data. Then we obtain analytic results on the Nash equilibrium that show how to optimally perform the classification given the attacker's utility.

Maximum Independent Set in H-free graphs
Théorie des graphes
Friday 05 October 2018 - 14h30
Salle : 445 - PCRI-N
Edouard BONNET
.............................................

A Family of Tractable Graph Distances
Gestion de données du Web
Wednesday 04 July 2018 - 10h30
Salle : 465 - PCRI-N
Stratis Ioannidis
.............................................