About me Publications and Talks Teaching CV Other PhD Defense

Publications :

Here is the list of my publications - I try to keep it up to date ! You can also see my dblp.

Journal papers :

• B. Escoffier, O. Spanjaard, M. Tydrichová : “Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences”, Discrete Applied Mathematics, vol. 318, pp. 6-12, (Elsevier) (2022)
  PDF BibTeX
  

Conference papers :

• B. Escoffier, O. Spanjaard, M. Tydrichová : “Algorithmic Recognition of 2-Euclidean Preferences”, Proceeding of the 26th European Conference on Artificial Intelligence, ECAI 2023, Krakow, Poland, September 2023
  PDF BibTeX
• B. Escoffier, O. Spanjaard, M. Tydrichová : “Measuring Nearly Single-Peakedness of an Electorate: Some New Insights”, Proceeding of the Algorithmic Decision Theory 7th International Conference, ADT 2021, Toulouse, France, November 3–5, 2021, Proceedings, vol. 13023, Lecture Notes in Computer Science, Toulouse, France, pp. 19-34, (Springer) (2021)
  PDF BibTeX
  
• B. Escoffier, O. Spanjaard, M. Tydrichová : “Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms”, Proceedings of the 13th International Symposium on Algorithmic Game Theory, SAGT 2020, vol. 12283, Lecture Notes in Computer Science, Augsburg, Germany, pp. 291-306, (Springer) (2020)
  PDF BibTeX
  

Submitted:

• B. Escoffier, O. Spanjaard, M. Tydrichová : "Euclidean preferences in the plane under ℓ1, ℓ2 and ℓ∞ norms", Submitted to Social Choice and Welfare, in minor revision
  PDF
• B. Escoffier, O. Spanjaard, M. Tydrichová : “Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms” (long version), submitted to Discrete Applied Mathematics (spring 2022)

PhD thesis:

Talks:

I give you here the slides of (some of) my talks. Feel free to contact me if you are interested in source codes of some slides/figures!

• The slides of my PhD defense

  If you want a quick and (very) brief summary of my works, maybe this is a good way how to get in touch with them...

  PDF
  
• A Heuristic algorithm for recognizing 2-Euclidean preferences

  A talk given at ROADEF 2023, on recognizing 2-Euclidean preferences. Actually, Dominik Peters proved that this problem is ∃R-complete. We propose here an algorithm that, given an input profile, decide whether or not is is 2-Euclidean; this algorithm can not be able to decide for some entries.

  PDF
  
• The Domain of Euclidean preferences

  A talk given several times, for instance at Journée "Préférences, apprentissage et décision" in July 2022. The aim of this tal is to introduce the domain of multidimensional Euclidean preferences, to give some basic intuition about structural differencies while using different norms, and to show some typical questions one can study.
  

  PDF
  
• Recognizing single-Peaked preferences on an arbitrary graph: complexity and algorithms

  A talk given at SAGT 2020, in order to present our works on extension of the notion of single-peakedness on an arbitrary graph.

  PDF