I am a Researcher (CRN) at the French National Centre for Scientific Research (CNRS), affiliated to LAMSADE - UMR 7243, Université Paris Dauphine-PSL, Paris, France

My research interests lie in the area of Algorithms and Complexity Theory with applications in Game Theory, Social Choice and Artificial Intelligence.

Jeux Algorithmiques



Short Bio

Education

    • 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

Appointments

    • May '22 - present. Researcher (CRN) - CNRS, LAMSADE, Université Paris Dauphine-PSL, Paris, France

    • Oct. '12 - Apr. '22. Researcher (CRN) - CNRS, CREM, Université de Caen Normandie, Caen, 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

Link to full CV

Selected Publications

  • 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

Link to DBLP

Link to Mendeley

Link to Google Scholar

Manuscripts and working papers

  • A. Fanelli, D. Fotakis. Preference games with local aggregation. https://arxiv.org/abs/2002.01251

  • A. Fanelli. Approximate pure Nash equilibria in coevolutionary opinion formation.

  • A. Fanelli. Computing approximate pure Nash equilibria in combinatorial exact potential games.

  • A. Fanelli, G. Monaco, L. Moscardelli. The price of stabilty in outerplanar network design.

  • A. Fanelli, L. Moscardelli. Approximate roommate stable matching.

  • A. Fanelli, A. Igarashi. Dynamics in coalition formation over graphs.

Contacts

  • Institutional Email angelo DOT fanelli AT cnrs DOT fr

  • Personal Email angelo DOT fanelli AT gmail DOT com

  • Office Université Paris Dauphine-PSL, Paris, France