A penalty function approach to alternative pairwise comparisons in ISMAUT, IEEE Transactions on Systems, Man, and Cybernetics, vol.23, issue.1, p.330333, 1993. ,
DOI : 10.1109/21.214795
Complexity of nding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, vol.8, p.277284, 1987. ,
Graphical models for preference and utility, Proc. of UAI, pp.3-10, 1995. ,
A wide-range algorithm for minimal triangulation from an arbitrary ordering, Journal of Algorithms, vol.58, issue.1, p.3366, 2006. ,
DOI : 10.1016/j.jalgor.2004.07.001
URL : https://hal.archives-ouvertes.fr/lirmm-00269411
Nonserial dynamic programming, 1972. ,
Visual exploration and incremental utility elicitation, Proc. of AAAI, pp.526-532, 2002. ,
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree, Journal of Algorithms, vol.18, issue.2, p.238255, 1995. ,
DOI : 10.1006/jagm.1995.1009
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.7198
A POMDP formulation of preference elicitation problems, Proc. of AAAI, pp.239-246, 2002. ,
UCP-networks ; a directed graphical representation of conditional utilities, Proc. of UAI, pp.56-64, 2001. ,
CP-nets : A tool for representing and reasoning with conditional ceteris paribus preference statements, Journal of Articial Intelligence Research, vol.21, p.135191, 2004. ,
Preference-Based Constrained Optimization with CP-Nets, Computational Intelligence, vol.14, issue.2, pp.137-157, 2004. ,
DOI : 10.1109/5254.708432
Evaluation and decision models : a critical perspective, 2000. ,
DOI : 10.1007/978-1-4615-1593-7
Introducing variable importance tradeos into CPnets, Proc. of UAI, p.6976, 2002. ,
Local utility elicitation in GAI models, Proc. of UAI, p.4249, 2005. ,
Minimax regret-based elicitation of generalized additive utilities, Proc. of UAI, 2007. ,
Elicitation of factored utilities, p.7992, 2008. ,
Utilities as random variables : Density estimation and structure discovery, Proc. of UAI, p.6371, 2000. ,
Theory of capacities, Annales de l'institut Fourrier, pp.131-295, 1953. ,
An ecient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph, Foundations of Computer Science, Annual IEEE Symposium on, vol.0, p.454459, 1989. ,
Continuity properties of paretian utility, International Economic Review, vol.5, p.285293, 1964. ,
Constraint processing, 2003. ,
Apprentissage par Renforcement dans les Processus de Décision Markoviens Factorisés, Thèse de doctorat, LIP6/AnimatLab, 2007. ,
Choix multiattribut à l'aide de réseaux GAI de forte densité, p.2539, 2009. ,
Choquet optimization using GAI networks for multiagent/multicriteria decision-making, dans Algorithmic Decision Theory, Lectures Notes in Articial Intelligence, p.377389, 2009. ,
Fast recommendations using GAI models, dans IJCAI'09, International Joint Conference on Articial Intelligence, p.1896, 1901. ,
URL : https://hal.archives-ouvertes.fr/hal-01295846
Multiobjective optimization using GAI models, dans IJCAI'09 International Joint Conference on Articial Intelligence, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01295848
CUI networks : A graphical representation for conditional utility independence, Proc. of AAAI, p.83112, 2006. ,
Utility Theory for Decision Making, 1970. ,
Méthodes exactes pour l'optimisation multicritère dans les graphes : recherche de solutions de compromis, Thèse de doctorat, pp.6-6, 2008. ,
Computers and Intractability : A Guide to the Theory of NP-Completeness, 1979. ,
The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.1, p.4756, 1974. ,
DOI : 10.1016/0095-8956(74)90094-X
Innite order lorenz dominance for fair multiagent optimization, Proc. of AAMAS, p.383390, 2010. ,
Triangulated graphs, Algorithmic Graph Theory and Perfect Graphs, p.98100, 1980. ,
GAI networks for utility elicitation, Proc. of KR, p.224234, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-01501402
GAI networks for decision making under certainty, dans R. Brafman et U. Junker, réds, Proceedings of the 19th International Joint Conference on Articial Intelligence workshop on advances in preference handling, p.100105, 2005. ,
Réseaux GAI pour la prise de décision, Revue d, Intelligence Articielle, vol.21, issue.4, p.555587, 2007. ,
Preference aggregation with graphical utility models, dans Proceedings of the 23rd AAAI conference on Articial Intelligence, p.10371042, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-01303904
The application of fuzzy integrals in multicriteria decision making, European Journal of Operational Research, vol.89, issue.3, p.445456, 1996. ,
DOI : 10.1016/0377-2217(95)00176-X
Agrégation multicritère, 2003. ,
Encyclopedia of Management, chap. Decision rules, 2000. ,
Bicriterion path problems, dans G. Fandel et T. Gal, réds., Multiple Criteria Decision Making : Theory and Applications, 1980. ,
DOI : 10.1007/978-3-642-48782-8_9
La modélisation des préférences : préordres, quasi-ordres et relations oues, Thèse de doctorat, 1975. ,
On the maximum probability which is consistent with a convex capacity, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol.3, p.2734, 1995. ,
Branch and bound with mini-bucket heuristics, dans IJCAI'99, International Joint Conference on Articial Intelligence, p.426433, 1999. ,
Decisions with multiple objectives -preferences and value tradeos, 1993. ,
Linear optimization with multiple equitable criteria, RAIRO - Operations Research, vol.33, issue.3, p.275297, 1999. ,
DOI : 10.1051/ro:1999112
On information and suciency, Annals of Mathematical Statistics, vol.22, p.7986, 1951. ,
In the quest of the best form of local consistency for weighted csp, Proc. of IJCAI'03, 2003. ,
Combining Convergence and Diversity in Evolutionary Multiobjective Optimization, Evolutionary Computation, vol.9, issue.3, p.263282, 2002. ,
DOI : 10.1109/4235.797969
Optimal decomposition by clique separators, Discrete Mathematics, vol.113, issue.1-3, p.99123, 1993. ,
DOI : 10.1016/0012-365X(93)90510-Z
Semiorders and a Theory of Utility Discrimination, Econometrica, vol.24, issue.2, p.415426, 1956. ,
DOI : 10.2307/1905751
Maximal prime subgraph decomposition of Bayesian Networks, IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol.32, p.2131, 2002. ,
Image theory and dominance search theory: How is decision making actually done?, Acta Psychologica, vol.66, issue.3, p.221224, 1987. ,
DOI : 10.1016/0001-6918(87)90035-7
A theory of fuzzy measures: Representations, the Choquet integral, and null sets, Journal of Mathematical Analysis and Applications, vol.159, issue.2, p.532549, 1991. ,
DOI : 10.1016/0022-247X(91)90213-J
An ecient algorithm for nding the M most probable congurations in probabilistic expert systems, Statistics and Computing, vol.8, issue.2, p.159173, 1998. ,
Inequality measures and equitable approaches to location problems, European Journal of Operational Research, vol.122, issue.2, p.374391, 2000. ,
DOI : 10.1016/S0377-2217(99)00240-4
A fast algorithm for nding an optimal ordering in the vertex elimination on a graph, SIAM J. Computing, vol.5, p.133145, 1976. ,
On the approximability of trade-os and optimal access of web sources, Proc. of FOCS, 2000. ,
Characterizations and algorithmic applications of chordal graph embeddings, Discrete Applied Mathematics, vol.79, issue.1-3, p.171188, 1997. ,
DOI : 10.1016/S0166-218X(97)00041-3
Probabilistic Reasoning in Intelligent Systems, 1988. ,
Near admissible algorithms for multiobjective search, Proc. of ECAI, p.490494, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-01303000
A decision-theoretic approach to robust optimization in multivalued graphs, Annals of Operations Research, vol.25, issue.6, pp.317-341, 2006. ,
DOI : 10.1007/s10479-006-0073-0
URL : https://hal.archives-ouvertes.fr/hal-01170404
Minimal orderings revisited, SIAM J. Matrix Analysis and Applications, p.271294, 2001. ,
DOI : 10.2172/9844
URL : http://digital.library.unt.edu/ark:/67531/metadc791747/m2/1/high_res_d/9844.pdf
Modèles graphiques décomposables pour la décision individuelle et collective, Thèse de doctorat, pp.6-6, 2008. ,
Triangulated graphs and the elimination process, Journal of Mathematical Analysis and Applications, vol.32, issue.3, p.597609, 1970. ,
DOI : 10.1016/0022-247X(70)90282-9
Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Journal on Computing, vol.5, issue.2, p.266283, 1976. ,
DOI : 10.1137/0205021
Preference Modelling, 1985. ,
DOI : 10.1007/978-3-642-46550-5
Méthodologie multicritère d'aide à la décision, 1985. ,
The Foundations of Statistics, 1954. ,
Integral representation without additivity, Proceedings of the American Mathematical Society, p.255261, 1986. ,
DOI : 10.1090/S0002-9939-1986-0835875-8
On economic inequality, 1997. ,
DOI : 10.1093/0198281935.001.0001
Probability propagation, Annals of Mathematics and Artificial Intelligence, vol.13, issue.1-4, p.327352, 1990. ,
DOI : 10.1007/BF01531015
Cores of convex games, International Journal of Game Theory, vol.57, issue.1, p.1122, 1971. ,
DOI : 10.1007/BF01753431
Axioms for probability and belief-function propagation, Proc. of UAI, p.169198, 1990. ,
A practical algorithm for nding optimal triangulations, Proc. of AAAI, p.185190, 1997. ,
An interactive weighted Tchebyche procedure for multiple objective programming, Mathematical Programming, p.326344, 1983. ,
Theory of fuzzy integrals and its applications, Thèse de doctorat, 1974. ,
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce hypergraphs, SIAM J. Computing, vol.13, p.566579, 1984. ,
Safe reduction rules for weighted treewidth, Lecture Notes in Computer Science, vol.2573, p.176185, 2002. ,
Approximation Algorithms, 2001. ,
DOI : 10.1007/978-3-662-04565-7
Aide Multicritère à la Décision , Editions de l, 1989. ,
Theory of games and economic behaviour, 1947. ,
Additive Representations of Preferences, A New Foundation of Decision Analysis, 1989. ,
Decision making with incomplete information, European Journal of Operational Research, vol.28, issue.1, p.4457, 1987. ,
DOI : 10.1016/0377-2217(87)90168-8
An interactive procedure for aiding multiattribute alternative selection, Omega, vol.11, issue.2, p.212214, 1983. ,
DOI : 10.1016/0305-0483(83)90011-7
On the completeness and constructiveness of parametric characterizations to vector optimization problems, Operations-Research-Spektrum, vol.22, issue.2, p.7387, 1986. ,
DOI : 10.1287/mnsc.22.6.652
On ordered weighted averaging aggregation operators in multicriteria decision making, IEEE Transactions on Systems, Man and Cybernetics, vol.18, p.183190, 1988. ,
Computing the minimum ll-in is NP-complete, SIAM Journal on Discrete Mathematics, vol.2, p.7779, 1981. ,
une représentation graphique compacte et expressive des préférences d'un décideur en Décision Multiattribut, c'est-à-dire dans des situations où les alternatives sur lesquelles portent les choix du décideur sont décrites à l'aide d'un ensemble d'attributs (de caractéristiques) L'exploitation de leur structure graphique permet de dénir des procédures ecaces d'élicitation de préférences (détermination des préférences à l'aide de questionnaires) ainsi que des algorithmes assez performants de prise de décision (calcul de l'alternative préférée du décideur ou des k meilleures alternatives) Le but de cette thèse est double. Tout d'abord elle vise à étendre les algorithmes de prise de décision dans des cas où les réseaux GAI sont denses, c'est-à-dire dans des situations où leur structure ne permet pas aux algorithmes de l'état de l'art de s'exécuter en un temps raisonnable . Pour cela, une nouvelle méthode de triangulation approchée a été développée, qui produit des réseaux GAI approchés sur lesquels des mécanismes d'inférence adaptés permettent d'obtenir les alternatives optimales des réseaux GAI d'origine. Ensuite, elle propose de nouvelles méthodes d'inférence en Décision multicritère ,
Aide à la décision, décision multiattribut, décision multicritère, modélisation des préférences, optimisation combinatoire, graphes ,