update README

README.md

@@ -154,12 +154,21 @@ greater than the time for the thieves to steal the treasure and go away.
 ## Authors
 
 - Jaime Arias (LIPN, CNRS UMR 7030, Université Sorbonne Paris Nord)
+- Łukasz Maśko (Institute of Computer Science, PAS, Warsaw University of Technology)
 - Wojciech Penczek (Institute of Computer Science, PAS, Warsaw University of Technology)
 - Laure Petrucci (LIPN, CNRS UMR 7030, Université Sorbonne Paris Nord)
 - Teofil Sidoruk (Institute of Computer Science, PAS, Warsaw University of Technology)
 
 ## Abstract
 
+Expressing attack-defence trees in a multi-agent setting allows for
+studying a new aspect of security scenarios, namely how the number of agents
+and their task assignment impact the performance, e.g. attack time, of
+strategies executed by opposing coalitions. Optimal scheduling of agents'
+actions, a non-trivial problem, is thus vital. We discuss associated caveats
+and propose an algorithm that synthesises such an assignment, targeting
+minimal attack time and using minimal number of agents for a given
+attack-defence tree.
 ## References
 
 [1] A. Buldas, P. Laud, J. Priisalu, M. Saarepera, and J. Willemson. Rational