Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Jerome Monnot

Email : Jerome.Monnot@dauphine.fr

Tel : 01 44 05 41 62
Bureau : P614
Site Personnel: http://www.lamsade.dauphine.fr/~monnot/
Pole : Optimisation combinatoire algorithmique
Status : Directeur de Recherche
Domaines de Recherche : Algorithmic Game Theory; Computational Complexity; Computational Social choice; Approximation


Encadrement de these de doctorat :


  • Mehdi Khosravian : La recherche de solutions max-min pour des problèmes algotithmiques ( Début : 2016-03-01)
voir toutes les theses

Publications Dblp


Publications DFIS


72 Bi-objective matchings with the triangle inequality (, , and ), In Theoretical Computer Science, volume 670, . [bibtex] [doi]

71 Conference Program Design with Single-Peaked and Single-Crossing Preferences (, and ), In Web and Internet Economics - 12th International Conference, WINE 2016, Montreal, Canada, December 11-14, 2016, Proceedings (Yang Cai, Adrian Vetta, ed.), Springer, . [bibtex]

70 How Hard Is It for a Party to Nominate an Election Winner? (, , , and ), In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016 (Subbarao Kambhampati, ed.), AAAI Press / IJCAI, . [bibtex]

69 Achieving Proportional Representation in Conference Programs (, and ), In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July (Subbarao Kambhampati, ed.), AAAI Press / IJCAI, . [bibtex]

68 Upper Domination : Complexity and Approximation (, , , , , , , , and ), In Combinatorial Algorithms. 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings (Veli Mäkinen, Simon J. Puglisi, Leena Salmela, ed.), Springer, . [bibtex]

67 Algorithmic Aspects of Upper Domination: A Parameterized Perspective (, , , , , , , , and ), In Algorithmic Aspects in Information and Management. 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings (Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri, ed.), Springer, . [bibtex]

66 Optimal Reallocation under Additive and Ordinal Preferences (, , , and ), In Proceedings of the 2016 International Conference on Autonomous Agents And Multiagent Systems, Singapore, May 9-13, 2016, IFAAMAS, . [bibtex]

65 Computing Pareto Optimal Committees (, and ), In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July (Subbarao Kambhampati, ed.), AAAI Press / IJCAI, . [bibtex]

64 A Boundary Property for Upper Domination (, , , , and ), In Combinatorial Algorithms. 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings (Veli Mäkinen, Simon J. Puglisi, Leena Salmela, ed.), Springer, . [bibtex]

63 New Results on Polynomial Inapproximability and Fixed Parameter Approximability of Edge Dominating Set (, , and ), In Theory of Computing Systems, volume 56, . [bibtex] [doi]

62 On the maximum independent set problem in subclasses of subcubic graphs (, and ), In Journal of Discrete Algorithms, volume 31, . [bibtex] [doi]

61 Worst case compromises in matroids with applications to the allocation of indivisible goods (, and ), In Theoretical Computer Science, volume 589, . [bibtex] [doi]

60 Congestion Games with Capacitated Resources (, , and ), In Theory of Computing Systems, volume 57, . [bibtex] [doi]

59 Approximate tradeoffs on weighted labeled matroids (, and ), In Discrete Applied Mathematics, volume 184, . [bibtex] [doi]

58 The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (, , and ), In Theoretical Computer Science, volume 602, . [bibtex] [doi]

57 The Lazy Matroid Problem (, and ), In Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings (Josep Diaz, Ivan Lanese, Davide Sangiorgi, ed.), Springer, . [bibtex]

56 Near Fairness in Matroids (, and ), In ECAI 2014 : 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic : including Prestigious Applications of Artificial Intelligence (PAIS 2014), Systems : proceedings (Schaub, Torsten, ed.), IOS Press, . [bibtex]

55 On regular and approximately fair allocations of indivisible goods (, and ), In AAMAS '14 Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, International Foundation for Autonomous Agents and Multiagent Systems, . [bibtex]

54 On the complexity of the selective graph coloring problem in some special classes of graphs (, , and ), In Theoretical Computer Science, volume 540-541, . [bibtex] [doi]

53 A note on the Clustered Set Covering Problem ( and ), In Discrete Applied Mathematics, volume 164, . [bibtex] [pdf] [doi]

52 A Dichotomy for Upper Domination in Monogenic Classes (, , , and ), In Combinatorial Optimization and Applications. 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings (Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du, ed.), Springer International Publishing, . [bibtex]

51 Reoptimization under Vertex Insertion: Max Pk-Free Subgraph and Max Planar Subgraph (, and ), In Discrete Mathematics, Algorithms and Applications, volume 05, . [bibtex] [doi]

50 A Protocol for Cutting Matroids Like Cakes (, and ), In Web and Internet Economics 9th International Conference, WINE 2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings (Immorlica, Nicole, ed.), Springer, . [bibtex]

49 Resilience and optimization of identifiable bipartite graphs (, , and ), In Discrete Applied Mathematics, volume 161, . [bibtex] [doi]

48 Fair solutions for some multiagent optimization problems (, and ), In Autonomous Agents and Multi-Agent Systems, volume 26, . [bibtex] [doi]

47 Complexity of trails, paths and circuits in arc-colored digraphs (, , and ), In Discrete Applied Mathematics, volume 161, . [bibtex] [doi]

46 The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design (, and ), In Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings (Leszek Antoni Gąsieniec, Frank Wolter, ed.), Springer, . [bibtex]

45 Approximation du point idéal dans des matroïdes: bornes et algorithmes (, and ), . [bibtex]

44 A matroid approach to the worst case allocation of indivisible goods (, and ), In IJCAI '13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence (Rossi, Francesca, ed.), AAAI Press, . [bibtex]

43 Truthful Many-to-Many Assignment with Private Weights (, , and ), In Algorithms and Complexity 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings (Serna, Maria ; Spirakis, Paul G., ed.), Springer, . [bibtex]

42 Reoptimization of maximum weight induced hereditary subgraph problems (, and ), In Theoretical Computer Science, volume 514, . [bibtex] [doi]

41 Single approximation for the biobjective Max TSP (, , and ), In Theoretical Computer Science, volume 478, . [bibtex] [doi]

40 Approximation with a fixed number of solutions of some multiobjective maximization problems (, and ), In Journal of Discrete Algorithms, volume 22, . [bibtex] [doi]

39 Possible Winners in Approval Voting (, , and ), In Algorithmic Decision Theory - Third International Conference, ADT 2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings (Patrice Perny, Marc Pirlot, Alexis Tsoukiàs, ed.), Springer, . [bibtex]

38 Approximate Tradeoffs on Matroids (, and ), In European Conference on Artificial Intelligence ECAI 2012 (Lucas, Peter, ed.), IOS Press Books, . [bibtex]

37 Selective Graph Coloring in Some Special Classes of Graphs (, , and ), In ISCO 2012 (Paschos, Vangelis Th., ed.), Springer, . [bibtex]

36 Strategic Scheduling Games: Equilibria and Efficiency (, and ), Chapter in (Roger Z. Ríos-Mercado, Yasmín A. Ríos-Solís, ed.), Springer, . [bibtex]

35 On paths, trails and closed trails in edge-colored graphs (, , and ), In Discrete Mathematics and Theoretical Computer Science, volume 14, . [bibtex]

34 Cooperation in multiorganization matching (, and ), In Algorithmic Operations Research, volume 7, . [bibtex] [doi]

33 Congestion Games with Capacitated Resources (, , and ), In Algorithmic Game Theory 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings (Serna, Maria, ed.), Springer, . [bibtex]

32 Approximation polynomiale pour des problèmes de matroïdes bi-objectifs (, and ), . [bibtex]

31 Strategic Coloring of a Graph (, and ), In Internet Mathematics, volume 8, . [bibtex] [doi]

30 Cost allocation protocols for network formation on connection situations (, , and ), In 6th International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2012 - proceedings, IEEE, . [bibtex]

29 Complexity Results for the Empire Problem in Collection of Stars (, and ), In Combinatorial Optimization and Applications 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012, Proceedings (Lin, Guohui, ed.), Springer, . [bibtex]

28 New candidates welcome! Possible winners with respect to the addition of new candidates (, , , and ), In Mathematical Social Sciences, volume 64, . [bibtex] [doi]

27 Reoptimization of the Maximum Weighted Pk-Free Subgraph Problem under Vertex Insertion (, and ), In WALCOM: Algorithms and Computation 6th International Workshop (Rahman, Md. Saidur, ed.), Springer, . [bibtex]

26 Single Approximation for Biobjective Max TSP (, , and ), In WAOA 2011 (Solis-Oba, Roberto, ed.), Springer, . [bibtex]

25 Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems (, and ), In WAOA 2011 (Solis-Oba, Roberto, ed.), Springer, . [bibtex]

24 Possible Winners When New Alternatives Join: New Results Coming Up! (, and ), In Proceedings of 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011) (Yolum, Pınar, ed.), IFAAMAS, . [bibtex]

23 The Price of Optimum in a Matching Game (, and ), In Algorithmic Game Theory 4th International Symposium, SAGT 2011, Amalfi, Italy, October 17-19, 2011. Proceedings (Persiano, Giuseppe, ed.), Springer, . [bibtex]

22 Compilation and communication protocols for voting rules with a dynamic set of candidates (, , and ), In TARK 2011 (Apt, Krzysztof R., ed.), ACM, . [bibtex]

21 Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation (, , and ), In European Journal of Operational Research, volume 205, . [bibtex] [doi]

20 The minimum reload s–t path, trail and walk problems (, , and ), In Discrete Applied Mathematics, volume 158, . [bibtex] [doi]

19 On a Labeled Vehicle Routing Problem (, and ), In SOFSEM 2010: Theory and Practice of Computer Science (Van Leeuwen, Jan, ed.), Springer, . [bibtex]

18 Equilibres forts et jeu de la coupe maximum ( and ), . [bibtex]

17 Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs (, , and ), In Theory and Applications of Models of Computation 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings, Springer, . [bibtex]

16 The Max k-Cut Game and Its Strong Equilibria ( and ), In Theory and Applications of Models of Computation 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings (Li, Angsheng, ed.), Springer, . [bibtex]

15 Strategic Coloring of a Graph (, and ), In Algorithms and Complexity 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings, Springer, . [bibtex]

14 On the impact of local taxes in a set cover game (, and ), In Structural Information and Communication Complexity, 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010. Proceedings. (Patt-Shamir, Boaz, ed.), Springer, . [bibtex]

13 Complexity and Approximation Results for the Connected Vertex Cover Problem in Graphs and Hypergraphs (, and ), In Journal of Discrete Algorithms, volume 8, . [bibtex] [doi]

12 Labeled Traveling Salesman Problems: Complexity and approximation (, , and ), In Discrete Optimization, volume 7, . [bibtex] [doi]

11 Possible winners when new candidates are added : the case of scoring rules (, , and ), In Proceedings of the Twenty-fourth AAAI Conference on Artificial Intelligence and the Twenty-second Innovative Applications of Artificial Intelligence (American Association for Artificial Intelligence, ed.), AAAI Press, . [bibtex]

10 Approximation of the Clustered Set Covering Problem ( and ), In ISCO International Symposium on Combinatorial Optimization, Electronic Notes in Discrete Mathematics, . [bibtex]

9 On Strong Equilibria in the Max Cut Game ( and ), In WINE 2009, 5th International Workshop on Internet and Network Economics (Leonardi, Stefano, ed.), Springer, . [bibtex]

8 On s-t paths and trails in edge-colored graphs (, , , and ), In Electronic Notes in Discrete Mathematics, volume 35, . [bibtex] [doi]

7 The exact weighted independent set problem in perfect graphs and related classes ( and ), In Electronic Notes in Discrete Mathematics, volume 35, . [bibtex] [doi]

6 The Minimum Reload s-t Path/Trail/Walk Problems (, , and ), In SOFSEM 2009: Theory and Practice of Computer Science 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 24-30, 2009. Proceedings (Valencia, Frank, ed.), Springer, . [bibtex]

5 The minimum reload s-t path/trail/walk problems (, , and ), In SOFSEM 2009: Theory and Practice of Computer Science 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings (Valencia, Frank, ed.), Springer, . [bibtex]

4 Selfish scheduling with setup times (, and ), In Internet and Network Economics, 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings, Springer, . [bibtex]

3 A matching-related property of bipartite graphs with applications in signal processing (, , and ), Technical report, Université Paris-Dauphine, . [bibtex]

2 Weighted coloring on planar, bipartite and split graphs: complexity and approximation (, , , and ), In Discrete Applied Mathematics, volume 157, . [bibtex] [doi]

1 Reoptimization of minimum and maximum traveling salesman's tours (, , and ), In Journal of Discrete Algorithms, volume 7, . [bibtex] [doi]

Publications HAL