2009. Ph.D. in Computer Science, Dept. of Computer Science, University of L’Aquila, Italy
2005. M.s. in Computer Science, Dept. of Computer Science, University of L’Aquila, Italy
Oct. '12 - present. Associate Scientist (CRN) - CNRS, France
Oct. '09 - Oct. '12. Research Fellow - Division of Mathematical Sciences, SPMS, Nanyang Technological University, Singapore
Apr. '09 - Sep. '09. Research Fellow - Lehrstuhl für Informatik I (Algorithms and Complexity), RWTH Aachen University, Germany
Jan. '09 - Mar. '09. Research Assistant - Lehrstuhl für Informatik I (Algorithms and Complexity), RWTH Aachen University, Germany
Manuscripts and working papers
A. Fanelli, D. Fotakis. Preference games with local aggregation. https://arxiv.org/abs/2002.01251
A. Fanelli. On coevolutionary opinion formation.
A. Fanelli. On approximate pure Nash equilibria in combinatorial exact potential games.
A. Fanelli, A. Igarashi. Dynamics in coalition formation over graphs.
I. Caragiannis, A. Fanelli. On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. Journal of Computer and System Sciences, 117: 40-48, 2021
E. Elkind, A. Fanelli, M. Flammini. Price of Pareto optimality in hedonic games. Artificial Intelligence, , 288: 103357, 2020
I. Caragiannis, A. Fanelli. An almost ideal coordination mechanism for unrelated machine scheduling. Theory of Computing Systems, 63(1): 114-127, 2019
V. Auletta, A. Fanelli, D. Ferraioli. Consensus in opinion formation processes in fully evolving environments. 33th Conference on Artificial Intelligence, AAAI 2019
V. Bilò, A. Fanelli, M. Flammini, G. Monaco, L. Moscardelli. Nash stable outcomes in fractional hedonic games: existence, efficiency and computation. Journal of Artificial Intelligence Research, 62: 315-371, 2018
V. Bilò, I. Caragiannis, A. Fanelli, M. Flammini, G. Monaco. Simple greedy algorithms for fundamental multidimensional graph problems. 44th International Colloquium on Automata, Languages and Programming, ICALP 2017
I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik. Approximate pure Nash equilibria in weighted congestion games: Existence, efficient computation, and structure. ACM Transactions on Economics and Computation, 3(1): 2, 2015
I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik. Efficient computation of approximate pure Nash equilibria in congestion games. 52nd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2011
Email angelo DOT Fanelli AT gmail DOT com
Office MRSH, Esplanade de la Paix - Campus 1, 14000 Caen, France.