Magdaléna Tydrichová

According to our database, Magdaléna Tydrichová authored at least 8 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Euclidean preferences in the plane under $\varvec{\ell _1},$$\varvec{\ell _2}$ and $\varvec{\ell _\infty }$ norms.

Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová

Soc. Choice Welf., August, 2024

Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms.

Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová

Discret. Appl. Math., 2024

Comparing Ways of Obtaining Candidate Orderings from Approval Ballots.

Théo Delemazure, Chris Dong, Dominik Peters, Magdaléna Tydrichová

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023

Structural and algorithmic aspects of preference domain restrictions in collective decision making : contributions to the study of single-peaked and Euclidean preferences. (Aspects structurels et algorithmiques des restrictions de domaines de préférences dans la prise de décision collective : contributions à l'étude des préférences unimodales et Euclidiennes).

Magdaléna Tydrichová

PhD thesis, 2023

Algorithmic Recognition of 2-Euclidean Preferences.

Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022

Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences.

Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová

Discret. Appl. Math., 2022

2021

Kemeny ranking is NP-hard for 2-dimensional Euclidean preferences.

Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová

CoRR, 2021

Measuring Nearly Single-Peakedness of an Electorate: Some New Insights.

Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021