Literatura científica selecionada sobre o tema "Nearly single-peaked preferences"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Nearly single-peaked preferences".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Nearly single-peaked preferences"
Ma, Mengfan, Mingyu Xiao, Tian Bai e Bakh Khoussainov. "Facility Location Games with Entrance Fees". Proceedings of the AAAI Conference on Artificial Intelligence 37, n.º 5 (26 de junho de 2023): 5797–804. http://dx.doi.org/10.1609/aaai.v37i5.25719.
Texto completo da fonteElkind, Edith, e Martin Lackner. "On Detecting Nearly Structured Preference Profiles". Proceedings of the AAAI Conference on Artificial Intelligence 28, n.º 1 (21 de junho de 2014). http://dx.doi.org/10.1609/aaai.v28i1.8823.
Texto completo da fonteMenon, Vijay, e Kate Larson. "Reinstating Combinatorial Protections for Manipulation and Bribery in Single-Peaked and Nearly Single-Peaked Electorates". Proceedings of the AAAI Conference on Artificial Intelligence 30, n.º 1 (21 de fevereiro de 2016). http://dx.doi.org/10.1609/aaai.v30i1.10026.
Texto completo da fonteTeses / dissertações sobre o assunto "Nearly single-peaked preferences"
Tydrichová, Magdaléna. "Structural and algorithmic aspects of preference domain restrictions in collective decision making : contributions to the study of single-peaked and Euclidean preferences". Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS048.
Texto completo da fonteThis thesis studies structural and algorithmic aspects of preference domain restrictions, namely single-peaked preferences and Euclidean preferences. In the first part of the thesis, we first introduce a generalization of the notion of single-peakedness on an arbitrary graph. We focus, in particular, on algorithmic aspects, namely the problem of recognition. The notion of nearly single-peakedness is then studied. More precisely, we introduce a new metric of nearly single-peakedness, and we study its theoretical and computational properties. The second part of the thesis is devoted to the study of d-Euclidean preferences (where d is the dimension of the real space) with respect to different norms. We first propose a heuristic algorithm for recognizing 2-Euclidean preferences with respect to the l_2 norm, and study its practical efficiency in practice. Finally, we focus on structural aspects of 2-Euclidean preferences with respect to the l_1 norm
Capítulos de livros sobre o assunto "Nearly single-peaked preferences"
Chen, Jiehua, Christian Hatschka e Sofia Simola. "Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences". In Frontiers in Artificial Intelligence and Applications. IOS Press, 2023. http://dx.doi.org/10.3233/faia230296.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Nearly single-peaked preferences"
Sornat, Krzysztof, Virginia Vassilevska Williams e Yinzhan Xu. "Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules". In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/69.
Texto completo da fonte