Skip to Main content Skip to Navigation

Axiomatisation de procédures d'agrégation de préférences

Abstract : Let D (the data) and M (the models) be two sets of binary relations on X, a finite set of alternatives. This Ph. D. Thesis is an axiomatic study of the (D,M)-procedures (or multiprocedures) that is mapping from the finite subsets of D to M (or the non empty subsets of M). In the first part is given an axiomatic characterization of the procedures relying only on matrices of preferences, ans also characterizations of those matrices for differents sets of data. In the second part we extend and then study the notion of choice function. The third ans last part deals with "prudent" proedures ans multiprocedures, ans sequential variation of the Borda's procedure.
Document type :
Complete list of metadatas
Contributor : Thèses Imag <>
Submitted on : Thursday, September 22, 2005 - 11:03:43 AM
Last modification on : Friday, November 6, 2020 - 3:52:44 AM
Long-term archiving on: : Friday, April 2, 2010 - 10:12:51 PM


  • HAL Id : tel-00010237, version 1



Bernard Debord. Axiomatisation de procédures d'agrégation de préférences. Modélisation et simulation. Université Joseph-Fourier - Grenoble I, 1987. Français. ⟨tel-00010237⟩



Record views


Files downloads