Fanny Pascual
Professor at Sorbonne Université
Laboratoire d'Informatique de Paris 6 (LIP6)
Research team "Recherche Opérationnelle" (RO)
Office 432, Tower 26-00
4 place Jussieu, 75005 Paris

Tel: +33 (0)1 44 27 88 65

---

ENSEIGNEMENT

---

En 2024-2025 :

Co-responsable du parcours Bi-Disciplinaire Intensif Informatique et Mathématiques (PIMA) de Sorbonne Université.


Enseignements en master d'informatique :


• Complexité, Algorithmes Randomisés et Approchés (COMPLEX), M1 informatique (cours, TD, co-responsable de l'UE).
• Méthodes Avancées et applications industrielles en Optimisation Combinatoire et en Ordonnancement (MAOA), M2 parcours Androide (cours/TD).
• Algorithmique et Optimisation pour la Théorie des Jeux (AOTJ), M2 parcours Androide (cours/TD).
• Paradigmes algorithmiques (cours, préparation à l'agrégation d'informatique).

Enseignements en licence d'informatique :


• Algorithmique (LU3IN003), L3 informatique (cours, TD, co-responsable de l'UE).
• Projets (LU2IN013), L2 double majeure informatique/mathématiques.
• Introduction a la programmation impérative en C (LU1IN002), L1 (TD/TME).

---

RESEARCH

---

Research interests:

My interest include exact and approximation algorithms for combinatorial optimization problems, algorithmic game theory, and computational social choice.

I am interested in designing exact and approximate algorithms for combinatorial optimization problems. I am particularly interested on problems with shared resources. The resources can for example machines or tasks (scheduling problems), servers in datacenters (assignment of tasks), or more generic resources (generalized assignment problem). I study how we can obtain good performances in such systems. When the system is made of different actors, this often implies the design of algorithms making the actors cooperate, the design of truthful algorithms, and the use of multiobjective theory and social choice notions.

More details on my research interests can be found in the report of my habilitation à diriger les recherches.

Research activities:

Projects:

• ANR Themis (THeory and Evidence to Measure Influence in Social structures), 2021-2026.
  
• ANR Energumen (Economies d'énergie dans les grandes plate-formes distribuées - Energy saving in large scale distributed platforms), 2018-2022.
  
• ANR COCORICO (Computation, Communication, Rationality and Incentives in Collective and Cooperative Decision Making), 2014-2018.
  
• PGMO project "How Randomness helps in scheduling" (with Carola Doerr and Nguyen Kim Thang), 2017-2018.
  
• PHP Polonium (coordinator of the French part; coordinator of the Polish part: Krzysztof Rzadca). Subject: "Resource management in supercomputers and datacenters", 2016-2017.
  
• ANR COCA (Combinatorial Optimization with Competing Agents), 2009-2013.
  
• ANR GUEPARD (GUaranteed Efficiency for PAReto optimal solutions Determination in multiobjective combinatorial optimization problems), 2009-2013.
  

Ph.D Supervisions:

• Advisor of the PhD thesis of Martin Durand, entitled "Scheduling in the presence of multiple actors", and defended in October 2023.
  
• Co-advisor of the PhD thesis of Konstantinos Dogeas, entitled "Energy Minimization and Data Movements: models and algorithms", and defended in April 2022 (co-advisor: Evripidis Bampis).
  
• Co-advisor the PhD thesis of Siao-Leu Phouratsamay, entitled "Coordination des décisions de planification dans une chaîne logistique à deux niveaux", and defended in November 2018 (co-advisor: Safia Kedad-Sidhoum).
  
• Co-advisor of the PhD thesis of Alexandre Blogowski, entitled "Taking into account the uncertainties in the deployment of LTE mobile networks", and defended in April 2013 ("these CIFRE" founded by Orange Labs, and co-advised with Philippe Chrétienne and Adam Ouorou).
  

Member of commitees:

• Member of the program committees of the following conferences:
  - International European Conference on Parallel and Distributed Computing (Euro-Par): Euro-Par 2016 (local chair of the topic "Scheduling and Load Balancing"), Euro-Par 2019, Euro-Par 2020, Euro-Par 2024, Euro-Par 2025 ;
  - International Parallel & Distributed Processing Symposium (IPDPS): IPDPS 2016, IPDPS 2019;
  - International Joint Conferences on Artificial Intelligence (IJCAI): IJCAI 2015, IJCAI 2019, IJCAI 2020;
  - International Conference on Autonomous Agents and Multiagent Systems (AAMAS): AAMAS 2021, AAMAS 2022, AAMAS 2023;
  - International Conference on Algorithmic Decision Theory (ADT): ADT 2021.
  
• Organizing committee of the workshops "Games, algorithms and optimization", which took place in Paris in June 2013 and in June 2011.
  
• Coordinator of the spring school "théorie des jeux algorithmique", which took place in Paris in June 2012.
  
• Coordinator of the French working group on scheduling "GOThA" from 2008 to 2012.
  

Scientific popularization:

• Coordinator of the science festival (fête de la science) for LIP6.
  
• Scientific popularization about algorithms (atelier "récréations algorithmiques") for school classes and the general public at the science festival.
  
• Member of the steering comitee of the Colloquium d'Informatique de Sorbonne Université.
  
• Popularization articles (in french) :
  
• A small article in Interstices (3/2021) and in Pour la science (9/2022) about algorithmic game theory and computational social choice.
  
• Two articles in Tangente mag "la recherche opérationnelle" (3/2021) about algorithmic game theory and mechanism design.
  
• A small article in The Conversation (11/2017) about combinatorial optimization problems and their complexity.
  
• Journées ``filles, maths, et informatiques : une équation lumineuse" (co-organisation of days at Sorbonne Université for secondary school girls to encourage them to study maths or computer science), in 2023, 2024, 2025.
  



---

PUBLICATIONS

---


International journals:

• Efficiency and Equity in the Multi Organization Scheduling Problem.
  Martin Durand, Fanny Pascual.
  Theoretical Computer Science, Vol. 864, pages 103-117, 2021.
  
• Coordination of a two-level supply chain with contracts.
  Siao-Leu Phouratsamay, Safia Kedad-Sidhoum, Fanny Pascual.
  4OR, pages 1-30, 2020.
  
• Optimizing egalitarian performance when colocating tasks with types for cloud data center resource management.
  Fanny Pascual, Krzysztof Rzadca.
  IEEE Transactions on Parallel and Distributed Systems, Vol. 30(11), pages 2523-2535, 2019.
  
• Two-level lot-sizing with inventory bounds.
  Siao-Leu Phouratsamay, Safia Kedad-Sidhoum, Fanny Pascual.
  Discrete Optimization, Vol. 30, pages 1-19, 2018.
  
• Colocating tasks in data centers using a side-effects performance model.
  Fanny Pascual, Krzysztof Rzadca.
  European Journal of Operational Research (EJOR), Vol. 268(2), pages 450-462, 2018.
  
• Bi-objective matchings with the triangle inequality.
  Laurent Gourvès, Jérôme Monnot, Fanny Pascual, Daniel Vanderpooten.
  Theoretical computer Science, Vol. 610, pages 1-10, 2017.
  
• Network sharing by two mobile operators: beyond competition, cooperation.
  Alexandre Blogowski, Philippe Chrétienne, Fanny Pascual.
  RAIRO - Operations Research, Vol. 478, pages 635-650, 2015.
  
• Single approximation for Biobjective Max TSP.
  Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual.
  Theoretical Computer Science, Vol. 478, pages 41-50, 2013.
  
• Cooperation in Multiorganization Matching.
  Laurent Gourvès, Jérôme Monnot, Fanny Pascual.
  Algorithmic Operations Research, Vol. 7(2), 2012.
  
• Approximation algorithms for the Multi-Organization Scheduling Problem.
  Pierre-François Dutot, Fanny Pascual, Krzysztof Rzadca, Denis Trystram.
  IEEE Transactions on Parallel and Distributed Systems, Vol. 22(11), pages 1888-1895, 2011.
  
• Approximation Algorithms for Scheduling with Reservations.
  Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram.
  Algorithmica, Vol. 58(2), pages 391-404, 2010.
  
• On truthfulness and approximation for scheduling selfish tasks.
  Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia. Special issue of the Workshop "Models and Algorithms for Planning and Scheduling Problems" (MAPSP) 2007.
  Journal of Scheduling, Vol. 12(5), pages 437-445, octobre 2009.
  
• Cooperation in Multi-Organization Scheduling.
  Fanny Pascual, Krzysztof Rzadca, Denis Trystram. Selected papers of Euro-Par 2007.
  Concurrency and Computation: Practice and Experience, Vol. 21(7), pages 905-921, 2009.
  
• The impact of local policies on the quality of packet routing in paths, trees, and rings.
  Eric Angel, Evripidis Bampis, Fanny Pascual. Special issue of the workshop "Scheduling Algorithms for new Emerging Applications" (CIRM, mai 2006).
  Journal of Scheduling, Vol. 11(5), pages 311-322, 2008.
  
• How good are SPT schedules for fair optimality criteria.
  Eric Angel, Evripidis Bampis, Fanny Pascual. Special issue of MISTA'2005.
  Annals of Operations Research (AOR), Vol. 159(1), pages 53-64, 2008.
  
• An exponential (matching based) neighborhood for the Vehicle Routing Problem.
  Eric Angel, Evripidis Bampis, Fanny Pascual.
  Journal of Combinatorial Optimization, Vol. 15(2), pages 179-190, 2008.
  
• The k-densest Subgraph Problem in Pairwise Overlapping Cliques.
  Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos.
  Journal of Combinatorial Optimization, Vol. 14(3), pages 465-474, 2007.
  
• Truthful algorithms for scheduling selfish tasks on parallel machines.
  Eric Angel, Evripidis Bampis, Fanny Pascual.
  Theoretical Computer Science, Vol. 369, pages 157-168, 2006.
  

---

National journals:

• Découpage électoral des circonscriptions législatives en France: déséquilibres démographiques et contraintes territoriales.
  Thomas Ehrhard, Solal Attias, Evripidis Bampis, Vincent Cohen-Addad, Bruno Escoffier, Claire Mathieu, Fanny Pascual, Adèle Pass-Lanneau, David Saulpic.
  Revue française de science politique, Vol. 72-3, mai-juin 2022.
  

---

International conferences:

• Estimating the Electoral Consequences of Legislative Redistricting in France.
  Evripidis Bampis, Thomas Ehrhard, Bruno Escoffier, Claire Mathieu, Fanny Pascual, David Saulpic.
  ACM Conference on Fairness, Accountability, and Transparency 2025, to appear.
• Non-Clairvoyant Makespan Minimization Scheduling with Predictions.
  Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli, Fanny Pascual.
  ISAAC 2023 (34th International Symposium on Algorithms and Computation), Leibniz International Proceedings in Informatics (LIPIcs), pages 9:1-9:15, 2023.
• Collective Schedules: Axioms and Algorithms.
  Martin Durand, Fanny Pascual.
  SAGT 2022 (Algorithmic Game Theory - 15th International Symposium), pages 454-471, 2022.
• Scheduling with Untrusted Predictions.
  Evripidis Bampis, Konstantinos Dogeas, Alexander Kononov, Giorgio Lucarelli, Fanny Pascual.
  IJCAI 2022 (31st International Joint Conference on Artificial Intelligence), pages 4581-4587, 2022.
• A Non-Utilitarian Discrete Choice Model for Preference Aggregation.
  Martin Durand, Fanny Pascual, Olivier Spanjaard.
  SUM 2022 (15th International Conference on Scalable Uncertainty Management), 2022.
• Speed-scaling with explorable uncertainty.
  Evripidis Bampis, Konstantinos Dogeas, Alexander Kononov, Giorgio Lucarelli, Fanny Pascual.
  SPAA 2021 (33th ACM Symposium on Parallelism in Algorithms and Architectures), pages 83-93, 2021.
• Scheduling Malleable Jobs Under Topological Constraints.
  Evripidis Bampis, Konstantinos Dogeas, Alexander Kononov, Giorgio Lucarelli, Fanny Pascual.
  IPDPS 2020 (34th IEEE International Parallel and Distributed Processing Symposium), pages 316-325, 2020.
• Collective Schedules: Scheduling Meets Computational Social Choice.
  Fanny Pascual, Krzysztof Rzadca, Piotr Skowron.
  AAMAS 2018 (17th International Conference on Autonomous Agents and MultiAgent Systems), pages 667-675, 2018. Extended paper.
• Optimizing egalitarian performance in the side-effects model of colocation for data center resource management.
  Fanny Pascual, Krzysztof Rzadca.
  Euro-Par 2017 (23rd International European Conference on Parallel and Distributed Computing), LNCS 10417, pages 206-219, 2017.
• Truthfulness for the Sum of Weighted Completion Times.
  Eric Angel, Evripidis Bampis, Fanny Pascual, Nicolas Thibault.
  COCOON 2016 (22nd International Computing and Combinatorics Conference), LNCS 9797, pages 15-26, 2016.
• Partition with side effects.
  Fanny Pascual, Krzysztof Rzadca.
  HiPC 2015 (22nd IEEE International Conference on High Performance Computing), pages 295-304, 2015.
• Scheduling tasks from selfish multi-tasks agents.
  Johanne Cohen, Fanny Pascual.
  Euro-Par 2015 (21st International European Conference on Parallel and Distributed Computing), LNCS 9233, pages 183-195, 2015. Slides (ppsx).
• Truthful Many-to-many Assignment with Private Weights.
  Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard.
  CIAC 2013, LNCS 7878, pages 209-220, 2013.
• Strategy-proof Mechanisms for Facility Location Games with Many Facilities.
  Bruno Escoffier, Laurent Gourvès, Kim Thang Nguyen, Fanny Pascual, Olivier Spanjaard.
  ADT 2011, LNCS 6992, pages 67-81, 2011.
• Single approximation for Biobjective Max TSP.
  Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual.
  WAOA 2011, LNCS, 2011. Slides on this subject (pdf).
• Cooperation in Multiorganization Matching.
  Laurent Gourvès, Jérôme Monnot, Fanny Pascual.
  WAOA 2008, LNCS, 2008.
• Approximation Algorithms for Scheduling with Reservations.
  Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram.
  HiPC 2007, LNCS 4873, 2007.
• Cooperation in Multi-Organization Scheduling.
  Fanny Pascual, Krzysztof Rzadca, Denis Trystram.
  Euro-Par 2007, LNCS 4641, 2007.
• Scheduling Selfish Tasks: About the Performance of Truthful Algorithms.
  Georges Christodoulou, Laurent Gourvès, Fanny Pascual.
  COCOON 2007, LNCS 4598, 2007.
• On the Truthfulness and the Approximation for Scheduling Selfish Tasks.
  Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia.
  SPAA 2007, Brief announcement, 2007.
• The price of approximate stability for scheduling tasks on two links.
  Eric Angel, Evripidis Bampis, Fanny Pascual.
  Euro-Par 2006, LNCS 4128, 2006. Slides (ps).
• Truthful algorithms for scheduling selfish tasks on parallel machines.
  Eric Angel, Evripidis Bampis, Fanny Pascual.
  WINE 2005, LNCS 3828, 2005. Slides (ppt).
• How good are SPT schedules for fair optimality criteria.
  Eric Angel, Evripidis Bampis, Fanny Pascual.
  MISTA 2005, 2005. Slides (ppt).
• Traffic grooming in a passive star WDM network.
  Eric Angel, Evripidis Bampis, Fanny Pascual.
  SIROCCO 2004, LNCS 3104, 2004. Slides (ps).

---

Book chapters:

• Combinatorial Optimization with Competing Agents.
  Diodato Ferraioli, Laurent Gourvès, Stefano Moretti, Fanny Pascual, Olivier Spanjaard.
  In: Paradigms of Combinatorial Optimization, 2nd Edition, ed: Vangelis Th. Paschos. John Wiley & Sons, 2014.
  
• Algorithmic Game Theory and Scheduling.
  Eric Angel, Evripidis Bampis, Fanny Pascual.
  In: Approximation Algorithms and Metaheuristics, ed: Teofilo Gonzalez. Chapman & Hall/CRC, 2007.
  

---

Thesis:

• Optimisation dans les réseaux : de l'approximation polynomiale à la théorie des jeux. PhD. thesis, defended on October 12, 2006.
  Jury: Michael Bender, Michel de Rougemont (reviewers), Eric Angel, Evripidis Bampis, Michel Habib, Elias Koutsoupias.
  
  
• Models and algorithms for combinatorial optimization problems of resource sharing between agents. Habilitation à diriger les recherches (accreditation to supervise research), defended on November 29, 2019.
  Jury: Dimitris Fotakis, Jérôme Lang, Marc Uetz (reviewers), Jean-Charles Billaut, Johanne Cohen, Bruno Escoffier, Denis Trystram.