@article{cailloux_classification_2024,
title = {Classification aggregation without unanimity},
journal = {Mathematical Social Sciences},
volume = {128},
pages = {6-9},
year = {2024},
issn = {0165-4896},
doi = {https://doi.org/10.1016/j.mathsocsci.2024.01.002},
url_HAL = {https://hal.science/hal-04397165v1},
author = {Olivier Cailloux and Matthieu Hervouin and Ali I. Ozkes and M. Remzi Sanver},
keywords = {Aggregation, Independence, Categories, Individuals},
abstract = {A classification is a surjective mapping from a set of objects to a set of categories. A classification aggregation function aggregates every vector of classifications into a single one. We show that every citizen sovereign and independent classification aggregation function is essentially a dictatorship. This impossibility implies an earlier result of Maniquet and Mongin (2016), who show that every unanimous and independent classification aggregation function is a dictatorship. The relationship between the two impossibilities is reminiscent to the relationship between Wilson’s (1972) and Arrow’s (1951) impossibilities in preference aggregation. Moreover, while the Maniquet-Mongin impossibility rests on the existence of at least three categories, we propose an alternative proof technique that covers the case of two categories, except when the number of objects is also two. We also identify all independent and unanimous classification aggregation functions for the case of two categories and two objects.}
}

A classification is a surjective mapping from a set of objects to a set of categories. A classification aggregation function aggregates every vector of classifications into a single one. We show that every citizen sovereign and independent classification aggregation function is essentially a dictatorship. This impossibility implies an earlier result of Maniquet and Mongin (2016), who show that every unanimous and independent classification aggregation function is a dictatorship. The relationship between the two impossibilities is reminiscent to the relationship between Wilson’s (1972) and Arrow’s (1951) impossibilities in preference aggregation. Moreover, while the Maniquet-Mongin impossibility rests on the existence of at least three categories, we propose an alternative proof technique that covers the case of two categories, except when the number of objects is also two. We also identify all independent and unanimous classification aggregation functions for the case of two categories and two objects.

@misc{mejri_experimental_2022,
 title = {Experimental evaluation of similarity indices about the MIA molecular family},
 keywords = {similarity indices, MS/MS, similarity comparaison},
 url_Article = {https://da2pl.pre.utc.fr/wp-content/uploads/sites/70/2022/11/DA2PL_paper_2645.pdf},
 url_Conference = {https://da2pl.pre.utc.fr/},
 url_HAL = { https://hal.science/hal-04272008 },
 abstract = {The purpose of this article is to evaluate the performance of the Morgan/Tanimoto, modified cosine similarity, Spec2Vec and MS2Deep Score similarity indices that aim at measuring structural and spectral similarities between molecules. To illustrate this evaluation, we used a spectral database containing about a hundred of the emblematic monoterpene indole alkaloids (MIADB).},
 note = {DA2PL'2022: From Multiple Criteria Decision Aid to Preference Learning},
 author = {Yassine M. Mejri and Mehdi A. Beniddir and Olivier Cailloux and Meltem Öztürk},
 year = {2022}
}

The purpose of this article is to evaluate the performance of the Morgan/Tanimoto, modified cosine similarity, Spec2Vec and MS2Deep Score similarity indices that aim at measuring structural and spectral similarities between molecules. To illustrate this evaluation, we used a spectral database containing about a hundred of the emblematic monoterpene indole alkaloids (MIADB).

@article{cailloux_compromising_2022,
  title = {Compromising as an equal loss principle},
  author = {Cailloux, Olivier and Napolitano, Beatrice and Sanver, M. Remzi},
  journal = {Review of Economic Design},
  month = May,
  year = 2022,
  doi = {10.1007/s10058-022-00302-w},
  url_Article = {https://link.springer.com/article/10.1007/s10058-022-00302-w},
  url_HAL = {https://hal.archives-ouvertes.fr/hal-03665048/},
}

@inproceedings{napolitano:hal-03384433,
	TITLE = {{Simultaneous Elicitation of Scoring Rule and Agent Preferences for Robust Winner Determination}},
	AUTHOR = {Napolitano, Beatrice and Cailloux, Olivier and Viappiani, Paolo},
	BOOKTITLE = {{Algorithmic Decision Theory (ADT 2021)}},
	YEAR = {2021},
	MONTH = Nov,
  	doi = {10.1007/978-3-030-87756-9_4},
	url_Article = {https://hal.archives-ouvertes.fr/hal-03384433/document},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-03384433},
}

@article{meinard_deliberation_2021,
	author = {Meinard, Yves and Cailloux, Olivier},
	title = {Deliberation in Valuation and Decision Making: A Conceptual Clarification},
	journal = {Œconomia},
	doi = {10.4000/oeconomia.11669},
	volume = 11,
	number = 4,
	year = 2021,
	url_Article = {https://hal.archives-ouvertes.fr/hal-03487127/document},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-03487127},
}

@article{cailloux_formal_2020,
	title = {A formal framework for deliberated judgment},
	keywords = {Deliberated judgment},
	url_Article = {https://github.com/oliviercailloux/formal-framework-dj/raw/master/deliber.pdf},
	url_GitHub = {https://github.com/oliviercailloux/formal-framework-dj},
	url_arXiv = {https://arxiv.org/abs/1801.05644},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-02556933},
	doi = {10.1007/s11238-019-09722-7},
	abstract = {While the philosophical literature has extensively studied how decisions relate to arguments, reasons and justifications, decision theory almost entirely ignores the latter notions.
In this article, we elaborate a formal framework in order to introduce in decision theory the stance that decision-makers take towards arguments and counter-arguments.We start from a decision situation, where an individual requests decision support. We formally define, as a commendable basis for decision-aid, this individual’s deliberated judgment, a notion inspired by Rawls' contributions to the philosophical literature, and embodying the requirement that the decision-maker should carefully examine arguments and counter-arguments. We explain how models of deliberated judgment can be validated empirically.
We then identify conditions upon which the existence of a valid model can be taken for granted, and analyze how these conditions can be relaxed. We then explore the significance of our framework for the practice of decision analysis. Our framework opens avenues for future research involving both philosophy and decision theory, as well as empirical implementations.},
	journal = {Theory and Decision},
	volume = 88,
	number = 2,
	pages="269--295",
	author = {Cailloux, Olivier and Meinard, Yves},
	year = 2020,
}

While the philosophical literature has extensively studied how decisions relate to arguments, reasons and justifications, decision theory almost entirely ignores the latter notions. In this article, we elaborate a formal framework in order to introduce in decision theory the stance that decision-makers take towards arguments and counter-arguments.We start from a decision situation, where an individual requests decision support. We formally define, as a commendable basis for decision-aid, this individual’s deliberated judgment, a notion inspired by Rawls' contributions to the philosophical literature, and embodying the requirement that the decision-maker should carefully examine arguments and counter-arguments. We explain how models of deliberated judgment can be validated empirically. We then identify conditions upon which the existence of a valid model can be taken for granted, and analyze how these conditions can be relaxed. We then explore the significance of our framework for the practice of decision analysis. Our framework opens avenues for future research involving both philosophy and decision theory, as well as empirical implementations.

@article{meinard_justification_2020,
	title = {On justifying the norms underlying decision support},
	keywords = {Deliberated judgment},
	abstract = {When decision sciences are applied to concrete problems, Decision Makers (DMs), concerned stakeholders, and the general public typically expect clear recommendations.
As emphasized in particular in the literature on ethical dimensions of Operational Research practice, such recommendations are unavoidably conditioned by norms or normative conceptions.
Although an extensive literature is devoted to promoting certain norms designed to be largely accepted by decision analysts, studies specifically devoted to determine, at a general level, how decision analysts can decide which norms should underlie their work, are found lacking.
To make up for this lacuna, we flesh out the concept of justification. 
We develop requirements that any justification should satisfy to qualify for being able to justify norms on which recommendations can rest.
We then introduce and recommend a series of practical rules that decision analysts should abide by, on the basis of which, in a given decision situation, a decision analyst can decide, together with the DM, whether a given norm underlying a given recommendation can be adopted.
},
	doi = {10.1016/j.ejor.2020.02.022},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-03049579},
	author = {Meinard, Yves and Cailloux, Olivier},
	month = September,
	year = {2020},
	journal = {European Journal of Operational Research},
	pages = "1002--1010",
	volume = 285,
	number = 3,
}

When decision sciences are applied to concrete problems, Decision Makers (DMs), concerned stakeholders, and the general public typically expect clear recommendations. As emphasized in particular in the literature on ethical dimensions of Operational Research practice, such recommendations are unavoidably conditioned by norms or normative conceptions. Although an extensive literature is devoted to promoting certain norms designed to be largely accepted by decision analysts, studies specifically devoted to determine, at a general level, how decision analysts can decide which norms should underlie their work, are found lacking. To make up for this lacuna, we flesh out the concept of justification. We develop requirements that any justification should satisfy to qualify for being able to justify norms on which recommendations can rest. We then introduce and recommend a series of practical rules that decision analysts should abide by, on the basis of which, in a given decision situation, a decision analyst can decide, together with the DM, whether a given norm underlying a given recommendation can be adopted.

@article{murillo_consistency_2020,
	author = {Murillo, Javier and Spetale, Flavio and Guillaume, Serge and Bulacio, Pilar and Labari, Ignacio Garcia and Cailloux, Olivier and Destercke, Sebastien and Tapia, Elizabeth},
	title = {Consistency of tools that predict the impact of SNPs on gene functionality: the BRCA1 gene},
	journal = {Biomolecules},
	doi = {10.3390/biom10030475},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-02964085},
	volume = 10,
	number = 3,
	year = {2020},
}

@inproceedings{murillo_preliminary_2020,
	series = {{IFMBE} {Proceedings}},
	title = {A {Preliminary} {Comparison} of {P}-{Tool} {Consistency}},
	isbn = {978-3-030-30648-9},
	doi = {10.1007/978-3-030-30648-9_97},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-03082827},
	abstract = {Many Bioinformatics tools, known as p-tools, have been developed to predict the effect of single nucleotide polymorphisms (SNPs) on gene functionality, in an effort to reduce the need for in-vivo assays. However, the large number of p-tools available and the heterogeneity of their output make their selection and comparison difficult. To study the consistency of predictions across p-tools, here we present two indices and test them on five p-tools whose predictions are based on different types of background information. For this test, SNPs from well-known organism Drosophila melanogaster are considered.},
	language = {en},
	booktitle = {{VIII} {Latin} {American} {Conference} on {Biomedical} {Engineering} and {XLII} {National} {Conference} on {Biomedical} {Engineering}},
	publisher = {Springer International Publishing},
	author = {Murillo, Javier and Spetale, Flavio and Tapia, Elizabeth and Krsticevic, Flavia and Cailloux, Olivier and Guillaume, Serge and Vazquez, Gustavo and Fernandez, Tamara and Destercke, Sebastien and Ponce, Sergio and Bulacio, Pilar},
	editor = {González Díaz, César A. and Chapa González, Christian and Laciar Leber, Eric and Vélez, Hugo A. and Puente, Norma P. and Flores, Dora-Luz and Andrade, Adriano O. and Galván, Héctor A. and Martínez, Fabiola and García, Renato and Trujillo, Citlalli J. and Mejía, Aldo R.},
	year = {2020},
	pages = {731--735}
}

Many Bioinformatics tools, known as p-tools, have been developed to predict the effect of single nucleotide polymorphisms (SNPs) on gene functionality, in an effort to reduce the need for in-vivo assays. However, the large number of p-tools available and the heterogeneity of their output make their selection and comparison difficult. To study the consistency of predictions across p-tools, here we present two indices and test them on five p-tools whose predictions are based on different types of background information. For this test, SNPs from well-known organism Drosophila melanogaster are considered.

@inproceedings{kirsten_towards_2018,
	title = {Towards automatic argumentation about voting rules},
	keywords = {Deliberated judgment},
	abstract = {Voting rules aggregate a group's preferences to make decisions. As multiple reasonable voting rules exist, the axiomatic approach has been proposed to exhibit both their merits and paradoxical behaviors. It is however a difficult task to characterize a voting rule by such axioms, and even when a proof exists, it may be difficult to understand why a specific rule fails to satisfy a given axiom.
	In this article, we present an automatic method which determines whether a given rule satisfies a set of axioms. It produces evidence which can be used by non-expert users to comprehend why a rule violates some axiom and may serve to argue in favor of rules which satisfy it. Our method is based on the software analysis technique “bounded model checking”, which enables bounded verification of software programs. The method can be applied to arbitrary voting rules; we demonstrate it on the case of the Borda axiomatization and compare the Borda rule to both the Black and the Copeland voting rules.},
	booktitle = {4ème {Conférence} {Nationale} sur les {Applications} {Pratiques} de l'{Intelligence} {Artificielle} ({APIA} 2018)},
	author = {Kirsten, Michael and Cailloux, Olivier},
	editor = {Bringay, Sandra and Mattioli, Juliette},
	month = jul,
	year = {2018},
	url_Article = {https://hal.archives-ouvertes.fr/hal-01830911/document},
	url_Conference = {https://pfia2018.loria.fr/apia/},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-01830911v1},
}

Voting rules aggregate a group's preferences to make decisions. As multiple reasonable voting rules exist, the axiomatic approach has been proposed to exhibit both their merits and paradoxical behaviors. It is however a difficult task to characterize a voting rule by such axioms, and even when a proof exists, it may be difficult to understand why a specific rule fails to satisfy a given axiom. In this article, we present an automatic method which determines whether a given rule satisfies a set of axioms. It produces evidence which can be used by non-expert users to comprehend why a rule violates some axiom and may serve to argue in favor of rules which satisfy it. Our method is based on the software analysis technique “bounded model checking”, which enables bounded verification of software programs. The method can be applied to arbitrary voting rules; we demonstrate it on the case of the Borda axiomatization and compare the Borda rule to both the Black and the Copeland voting rules.

@misc{cailloux_learning_2018,
	title = {Learning argumentative recommenders},
	keywords = {Deliberated judgment, Preference modeling},
	url_Article = {https://da2pl.cs.put.poznan.pl/programme/detailed-programme/da2pl2018-abstract-09.pdf},
	url_Conference = {https://da2pl.cs.put.poznan.pl/programme/detailed-programme},
	url_HAL = {https://hal.science/hal-04176648},
	url_Slides = {https://da2pl.cs.put.poznan.pl/programme/detailed-programme/da2pl2018-slides-15.pdf},
	abstract = {Recommender systems aim at recommending some item as most appropriate for the user. This article introduces a new way of measuring appropriateness for the user: an item is among the most appropriate ones if it is among the preferred items of the user when considering all arguments in favor or against all possible items. I describe precisely this goal and describe what a recommender system aiming for that goal could look like, called an Argumentative Recommender. I also provide a way of measuring whether a recommender system has achieved the goal, which can be used to compare such recommender systems, and briefly outline a way of building such a system.},
	note = {DA2PL'2018: From Multiple Criteria Decision Aid to Preference Learning},
	author = {Cailloux, Olivier},
	year = {2018}
}

Recommender systems aim at recommending some item as most appropriate for the user. This article introduces a new way of measuring appropriateness for the user: an item is among the most appropriate ones if it is among the preferred items of the user when considering all arguments in favor or against all possible items. I describe precisely this goal and describe what a recommender system aiming for that goal could look like, called an Argumentative Recommender. I also provide a way of measuring whether a recommender system has achieved the goal, which can be used to compare such recommender systems, and briefly outline a way of building such a system.

@inproceedings{cailloux_reasons_2017,
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {Reasons and {Means} to {Model} {Preferences} as {Incomplete}},
	keywords = {Preference modeling},
	isbn = {978-3-319-67581-7 978-3-319-67582-4},
	doi = {10.1007/978-3-319-67582-4_2},
	abstract = {Literature involving preferences of artificial agents or human beings often assume their preferences can be represented using a complete transitive binary relation. Much has been written however on different models of preferences. We review some of the reasons that have been put forward to justify more complex modeling, and review some of the techniques that have been proposed to obtain models of such preferences.},
	language = {en},
	urldate = {2018-01-11},
	booktitle = {Scalable {Uncertainty} {Management}},
	publisher = {Springer},
	author = {Cailloux, Olivier and Destercke, Sébastien},
	month = oct,
	year = {2017},
	pages = {17--30},
	url_Article = {https://arxiv.org/pdf/1801.01657},
	url_arXiv = {https://arxiv.org/abs/1801.01657},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-01658459},
	url_GitHub = {https://github.com/oliviercailloux/pref-modeling-survey}
}

Literature involving preferences of artificial agents or human beings often assume their preferences can be represented using a complete transitive binary relation. Much has been written however on different models of preferences. We review some of the reasons that have been put forward to justify more complex modeling, and review some of the techniques that have been proposed to obtain models of such preferences.

@inproceedings{cailloux_arguing_2016,
	title = {Arguing about {Voting} {Rules}},
	keywords = {Deliberated judgment},
	isbn = {978-1-4503-4239-1},
	abstract = {When the members of a group have to make a decision, they can use a voting rule to aggregate their preferences. But which rule to use is a difficult question. Different rules have different properties, and social choice theorists have found arguments for and against most of them. These arguments are aimed at the expert reader, used to mathematical formalism. We propose a logic-based language to instantiate such arguments in concrete terms in order to help people understand the strengths and weaknesses of different voting rules. Our approach allows us to automatically derive a justification for a given election outcome or to support a group in arguing over which voting rule to use. We exemplify our approach with an in-depth study of the Borda rule.},
	booktitle = {Proceedings of the 15th {International} {Conference} on {Autonomous} {Agents} and {Multiagent} {Systems} ({AAMAS}-2016)},
	publisher = {IFAAMAS},
	address = {Singapore},
	author = {Cailloux, Olivier and Endriss, Ulle},
	month = may,
	year = {2016},
	url_Article = {http://www.ifaamas.org/Proceedings/aamas2016/pdfs/p287.pdf},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-01388186},
	url_Comsoc_2016_version = {https://github.com/oliviercailloux/Arguing-about-voting-rules/raw/comsoc-2016/arguing.pdf},
	url_Presentations_and_more = {https://github.com/oliviercailloux/Arguing-about-voting-rules},
	url_Proceedings = {http://www.ifaamas.org/Proceedings/aamas2016/forms/authors.htm#C},
}

When the members of a group have to make a decision, they can use a voting rule to aggregate their preferences. But which rule to use is a difficult question. Different rules have different properties, and social choice theorists have found arguments for and against most of them. These arguments are aimed at the expert reader, used to mathematical formalism. We propose a logic-based language to instantiate such arguments in concrete terms in order to help people understand the strengths and weaknesses of different voting rules. Our approach allows us to automatically derive a justification for a given election outcome or to support a group in arguing over which voting rule to use. We exemplify our approach with an in-depth study of the Borda rule.

@article{cailloux_data_2014,
	title = {A {Data} {Model} for {Algorithmic} {Multiple} {Criteria} {Decision} {Analysis}},
	volume = {217},
	issn = {1572-9338},
	doi = {10.1007/s10479-014-1562-1},
	abstract = {Various software tools implementing multiple criteria decision analysis (MCDA) methods have appeared over the last decades. Although MCDA methods share common features, most of the implementing software have been developed independently from scratch. Majority of the tools have a proprietary storage format and exchanging data among software is cumbersome. Common data exchange standard would be useful for an analyst wanting to apply different methods on the same problem. The Decision Deck project has proposed to build components implementing MCDA methods in a reusable and interchangeable manner. A key element in this scheme is the XMCDA standard, a proposal that aims to standardize an XML encoding of common structures appearing in MCDA models, such as criteria and performance evaluations. Although XMCDA allows to present most data structures for MCDA models, it almost completely lacks data integrity checks. In this paper we present a new comprehensive data model for MCDA problems, implemented as an XML schema. The data model includes types that are sufficient to represent multi-attribute value/utility models, ELECTRE III/TRI models, and their stochastic extensions, and AHP. We also discuss use of the data model in algorithmic MCDA.},
	number = {1},
	journal = {Annals of Operations Research},
	author = {Cailloux, Olivier and Tervonen, Tommi and Verhaegen, Boris and Picalausa, François},
	year = {2014},
	pages = {77--94},
	url_Article = {https://hal.archives-ouvertes.fr/hal-00941128/document},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-00941128},
}

Various software tools implementing multiple criteria decision analysis (MCDA) methods have appeared over the last decades. Although MCDA methods share common features, most of the implementing software have been developed independently from scratch. Majority of the tools have a proprietary storage format and exchanging data among software is cumbersome. Common data exchange standard would be useful for an analyst wanting to apply different methods on the same problem. The Decision Deck project has proposed to build components implementing MCDA methods in a reusable and interchangeable manner. A key element in this scheme is the XMCDA standard, a proposal that aims to standardize an XML encoding of common structures appearing in MCDA models, such as criteria and performance evaluations. Although XMCDA allows to present most data structures for MCDA models, it almost completely lacks data integrity checks. In this paper we present a new comprehensive data model for MCDA problems, implemented as an XML schema. The data model includes types that are sufficient to represent multi-attribute value/utility models, ELECTRE III/TRI models, and their stochastic extensions, and AHP. We also discuss use of the data model in algorithmic MCDA.

@inproceedings{cailloux_eliciting_2014,
	IGNORED_COMMENT_series = {Frontiers in {Artificial} {Intelligence} and {Applications}},
	title = {Eliciting a {Suitable} {Voting} {Rule} via {Examples}},
	volume = {263},
	isbn = {978-1-61499-419-0},
	doi = {10.3233/978-1-61499-419-0-183},
	abstract = {We address the problem of specifying a voting rule by means of a series of examples. Each example consists of the answer to a simple question: how should the rule rank two alternatives, given the positions at which each voter ranks the two alternatives? To be able to formalise this elicitation problem, we develop a novel variant of classical social choice theory in terms of associations of alternatives with vectors of ranks rather than the common associations of voters with preference orders. We then define and study a class of voting rules suited for elicitation using such answers. Finally, we propose and experimentally evaluate several elicitation strategies for arriving at a good approximation of the target rule with a reasonable number of queries.},
	booktitle = {Proceedings of the 21st {European} {Conference} on {Artificial} {Intelligence} ({ECAI} 2014)},
	publisher = {IOS Press},
	author = {Cailloux, Olivier and Endriss, Ulle},
	editor = {Schaub, Torsten and Friedrich, Gerhard and O'Sullivan, Barry},
	year = {2014},
	pages = {183--188},
	url_Article = {http://www.illc.uva.nl/~ulle/pubs/files/CaillouxEndrissECAI2014.pdf},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-00998287},
	url_Presentation = {https://github.com/oliviercailloux/eliciting-voting-rules-pres-long},
	url_Short_presentation = {https://github.com/oliviercailloux/eliciting-voting-rules-pres-short}
}

We address the problem of specifying a voting rule by means of a series of examples. Each example consists of the answer to a simple question: how should the rule rank two alternatives, given the positions at which each voter ranks the two alternatives? To be able to formalise this elicitation problem, we develop a novel variant of classical social choice theory in terms of associations of alternatives with vectors of ranks rather than the common associations of voters with preference orders. We then define and study a class of voting rules suited for elicitation using such answers. Finally, we propose and experimentally evaluate several elicitation strategies for arriving at a good approximation of the target rule with a reasonable number of queries.

@article{cailloux_operational_2013,
	title = {Operational tools to build a multicriteria territorial risk scale with multiple stakeholders},
	keywords = {Preference modeling},
	volume = {120},
	issn = {0951-8320},
	doi = {10.1016/j.ress.2013.06.004},
	abstract = {Evaluating and comparing the threats and vulnerabilities associated with territorial zones according to multiple criteria (industrial activity, population, etc.) can be a time-consuming task and often requires the participation of several stakeholders. Rather than a direct evaluation of these zones, building a risk assessment scale and using it in a formal procedure permits to automate the assessment and therefore to apply it in a repeated way and in large-scale contexts and, provided the chosen procedure and scale are accepted, to make it objective. One of the main difficulties of building such a formal evaluation procedure is to account for the multiple decision makers' preferences. The procedure used in this article, Electre Tri, uses the performances of each territorial zone on multiple criteria, together with preferential parameters from multiple decision makers, to qualitatively assess their associated risk level. We also present operational tools in order to implement such a procedure in practice, and show their use on a detailed example.},
	urldate = {2013-09-07},
	journal = {Reliability Engineering \& System Safety},
	author = {Cailloux, Olivier and Mayag, Brice and Meyer, Patrick and Mousseau, Vincent},
	month = dec,
	year = {2013},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-00857929/},
	url_Article = {https://hal.archives-ouvertes.fr/hal-00857929/document},
	pages = {88--97}
}

Evaluating and comparing the threats and vulnerabilities associated with territorial zones according to multiple criteria (industrial activity, population, etc.) can be a time-consuming task and often requires the participation of several stakeholders. Rather than a direct evaluation of these zones, building a risk assessment scale and using it in a formal procedure permits to automate the assessment and therefore to apply it in a repeated way and in large-scale contexts and, provided the chosen procedure and scale are accepted, to make it objective. One of the main difficulties of building such a formal evaluation procedure is to account for the multiple decision makers' preferences. The procedure used in this article, Electre Tri, uses the performances of each territorial zone on multiple criteria, together with preferential parameters from multiple decision makers, to qualitatively assess their associated risk level. We also present operational tools in order to implement such a procedure in practice, and show their use on a detailed example.

@techreport{cailloux_dealing_2012,
	type = {Cahier d’Études et de {Recherche}},
	title = {Dealing with numerical imprecision in mathematical programs for {Electre} {Tri} models disaggregation},
	number = {2012-02},
	institution = {Laboratoire Génie Industriel, École Centrale Paris},
	author = {Cailloux, Olivier},
	month = mar,
	year = {2012},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-00985881},
	url_Article = {https://hal.archives-ouvertes.fr/hal-00985881/document}
}

@phdthesis{cailloux_elicitation_2012,
	address = {Paris},
	type = {{PhD} {Thesis}},
	title = {Élicitation indirecte de modèles de tri multicritère},
	abstract = {The field of MCDA aims to model in a formal way the preferences of a DM in order to bring informations that can help her in a decision problem. MCDA is interested in situations where the available options (called alternatives) are evaluated on multiple points of view.

This work suggests elicitation methods: ways of questioning a DM or a group of DMs in order to obtain one or several preference models. These methods rely on so-called disaggregation techniques, which use exemplary decisions as a basis for building the preference model. In our context, the preference models are sorting models: they determine a way of assigning alternatives to preference-ordered categories. We are interested in a class of sorting models called MR Sort.

We present a method that helps a group of DMs converge to a unique sorting model.  It uses mathematical programs. We also analyze in detail the difficulties due to numerical imprecision when implementing these programs, and we propose an algorithm allowing to compare two MR Sort models.

We introduce a novel way of interrogating the DM in order to take her hesitations into account, through the expression of degrees of credibility, when she gives assignment examples. Results of the method let the DM examine possible compromises between credibility and precision of the conclusions.

We propose a method to choose portfolios. It encompasses two dimensions: absolute evaluation, in order to ensure that the selected alternatives are sufficiently good, and balance of the resulting portfolio. We also explain how this method compares to affirmative action.

We describe the reusable software components that we have submitted to a web services platform, as well as functionalities developed in a library that implements the methods this work proposes.

A data scheme exists that aims to standardize encoding of data related to MCDA methods, in order to ease communication between software components. We propose a new approach aiming to solve some drawbacks of the current approach.

We develop as a perspective a proposal that aims to integrate preference modeling into the framework of realistic epistemology.},
	language = {French},
	school = {École Centrale Paris},
	author = {Cailloux, Olivier},
	month = nov,
	year = {2012},
	url_Theses.fr = {http://www.theses.fr/en/2012ECAP0043},
	IGNORED_COMMENT = {PDF on theses.fr - archives-ouvertes.fr incorrectly paginated},
	url_Manuscript = {https://github.com/oliviercailloux/doctorat/raw/master/phd.pdf}
}

The field of MCDA aims to model in a formal way the preferences of a DM in order to bring informations that can help her in a decision problem. MCDA is interested in situations where the available options (called alternatives) are evaluated on multiple points of view. This work suggests elicitation methods: ways of questioning a DM or a group of DMs in order to obtain one or several preference models. These methods rely on so-called disaggregation techniques, which use exemplary decisions as a basis for building the preference model. In our context, the preference models are sorting models: they determine a way of assigning alternatives to preference-ordered categories. We are interested in a class of sorting models called MR Sort. We present a method that helps a group of DMs converge to a unique sorting model. It uses mathematical programs. We also analyze in detail the difficulties due to numerical imprecision when implementing these programs, and we propose an algorithm allowing to compare two MR Sort models. We introduce a novel way of interrogating the DM in order to take her hesitations into account, through the expression of degrees of credibility, when she gives assignment examples. Results of the method let the DM examine possible compromises between credibility and precision of the conclusions. We propose a method to choose portfolios. It encompasses two dimensions: absolute evaluation, in order to ensure that the selected alternatives are sufficiently good, and balance of the resulting portfolio. We also explain how this method compares to affirmative action. We describe the reusable software components that we have submitted to a web services platform, as well as functionalities developed in a library that implements the methods this work proposes. A data scheme exists that aims to standardize encoding of data related to MCDA methods, in order to ease communication between software components. We propose a new approach aiming to solve some drawbacks of the current approach. We develop as a perspective a proposal that aims to integrate preference modeling into the framework of realistic epistemology.

@techreport{cailloux_indirect_2012,
	type = {Cahier d’Études et de {Recherche}},
	title = {Indirect elicitation of {MCDA} sorting models using valued assignment examples},
	number = {2012-04},
	institution = {Laboratoire Génie Industriel, École Centrale Paris},
	author = {Cailloux, Olivier and Dias, Luis and Mayag, Brice and Mousseau, Vincent},
	month = jul,
	year = {2012}
}

@article{cailloux_eliciting_2012,
	title = {Eliciting {ELECTRE} {TRI} category limits for a group of decision makers},
	keywords = {Preference modeling},
	volume = {223},
	issn = {0377-2217},
	doi = {10.1016/j.ejor.2012.05.032},
	abstract = {Multiple criteria sorting aims at assigning alternatives evaluated on several criteria to predefined ordered categories. In this paper, we consider a well known multiple criteria sorting method, ELECTRE TRI, which involves three types of preference parameters: (1) category limits defining the frontiers between consecutive categories, (2) weights and majority level specifying which coalitions form a majority, and (3) veto thresholds characterizing discordance effects. We propose an elicitation procedure to infer category limits from assignment example provided by multiple decision makers. The procedure computes a set of category limits common to all decision makers, with variable weights and vetoes for each decision maker. Hence, the method helps reaching a consensus among decision makers on the category limits, whereas finding a consensus on  weights and vetoes is left aside.
The inference procedure is based on mixed integer linear programming and performs well even for datasets corresponding to real-world decision problems. We provide an illustrative example of the method and analyze the performance of the proposed algorithms.},
	number = {1},
	journal = {European Journal of Operational Research},
	author = {Cailloux, Olivier and Meyer, Patrick and Mousseau, Vincent},
	month = nov,
	year = {2012},
	pages = {133--140},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-00739582},
	IGNORED_COMMENT = {also presented at The 21st International Conference on Multiple Criteria Decision Making, Jyväskylä, Finlande, June 2011: http://hal.archives-ouvertes.fr/hal-00609521},
	url_Article = {https://hal.archives-ouvertes.fr/hal-00739582/document}
}

Multiple criteria sorting aims at assigning alternatives evaluated on several criteria to predefined ordered categories. In this paper, we consider a well known multiple criteria sorting method, ELECTRE TRI, which involves three types of preference parameters: (1) category limits defining the frontiers between consecutive categories, (2) weights and majority level specifying which coalitions form a majority, and (3) veto thresholds characterizing discordance effects. We propose an elicitation procedure to infer category limits from assignment example provided by multiple decision makers. The procedure computes a set of category limits common to all decision makers, with variable weights and vetoes for each decision maker. Hence, the method helps reaching a consensus among decision makers on the category limits, whereas finding a consensus on weights and vetoes is left aside. The inference procedure is based on mixed integer linear programming and performs well even for datasets corresponding to real-world decision problems. We provide an illustrative example of the method and analyze the performance of the proposed algorithms.

@inproceedings{caelen_real-time_2011,
	address = {Athens, Greece},
	title = {Real-time prediction of an anesthetic monitor index using machine learning},
	abstract = {An anesthesiologist controls the level of consciousness of a patient undergoing surgery by appropriately dosing hypnotic drugs. The information provided by the monitoring devices may be utilized in order to accomplish this task. One such monitor provides a dimensionless quantity derived from the electroencephalogram called bispectral index (BIS), which could quantify the level of awareness of the patient. This article discusses the use of machine learning techniques to implement a predictive model of the BIS based on the variation of the hypnotic drugs. Such a model learned from a database of recorded operations can aid realtime decision making during the course of an operation.
In order to deal with inter-individual variability, the proposed model takes into account patient physiology as well as the reactions of the patient during the early phases of the operation. Two models of the bispectral index behavior are assessed and compared in this work: a linear predictor and a local learning predictor. These prediction models were software implemented and their accuracies were assessed by a computerized cross-validation study and were tested in real situations.},
	booktitle = {Proceedings of {The} {First} {International} {Workshop} on {Knowledge} {Discovery} in {Health} {Care} and {Medicine}},
	author = {Caelen, Olivier and Cailloux, Olivier and Ghoundiwal, Djamal and Miranda, Abhilash Alexander and Barvais, Luc and Bontempi, Gianluca},
	month = sep,
	year = {2011},
	pages = {78 -- 89}
}

An anesthesiologist controls the level of consciousness of a patient undergoing surgery by appropriately dosing hypnotic drugs. The information provided by the monitoring devices may be utilized in order to accomplish this task. One such monitor provides a dimensionless quantity derived from the electroencephalogram called bispectral index (BIS), which could quantify the level of awareness of the patient. This article discusses the use of machine learning techniques to implement a predictive model of the BIS based on the variation of the hypnotic drugs. Such a model learned from a database of recorded operations can aid realtime decision making during the course of an operation. In order to deal with inter-individual variability, the proposed model takes into account patient physiology as well as the reactions of the patient during the early phases of the operation. Two models of the bispectral index behavior are assessed and compared in this work: a linear predictor and a local learning predictor. These prediction models were software implemented and their accuracies were assessed by a computerized cross-validation study and were tested in real situations.

@inproceedings{cailloux_parameterize_2011,
	address = {Troyes, France},
	title = {Parameterize a territorial risk evaluation scale using multiple experts knowledge through risk assessment examples},
	isbn = {978-0-415-68379-1},
	abstract = {Evaluating and comparing the threats and vulnerabilities associated with territorial zones according to multiple criteria (industrial activity, population, etc.) can be a time-consuming task and often requires the participation of several experts and decision makers. Rather than a direct evaluation of these zones, building a risk evaluation scale and using it in a formal procedure permits to automate the assessment and therefore to apply it in a repeated way and in large-scale contexts and, provided the chosen procedure and scale are accepted, to make it objective. One of the main difficulty of building such a formal evaluation procedure is to account for the multiple experts knowledge and decision makers preferences. The procedure used in this article, ELECTRE TRI, uses the performances of each territorial zone on multiple criteria, together with preferential parameters, to qualitatively assess their associated risk level. The preferential parameters to be determined are the category limits, i.e. the limits on each criterion of the performance range associated with a given risk level, and the weights associated with the different criteria. To obtain these parameters with no direct questioning of the stakeholders, tools based on mathematical programming have been developed to deduce these preferential parameters from assessment examples. In this article, several such tools are applied together in order to build a complete example leading to the definition of a territorial risk evaluation scale taking into account the preferences of multiple stakeholders.},
	booktitle = {Advances in {Safety}, {Reliability} and {Risk} {Management}},
	publisher = {Taylor and Francis Group, London},
	author = {Cailloux, Olivier and Mousseau, Vincent},
	editor = {Bérenguer, Christophe and Grall, Antoine and Guedes Soares, Carlos},
	month = sep,
	year = {2011},
	pages = {2331--2339},
	url_HAL = {https://hal-ecp.archives-ouvertes.fr/hal-00614714/},
	url_Article = {https://hal-ecp.archives-ouvertes.fr/hal-00614714/document},
	url_Proceedings = {https://www.crcpress.com/Advances-in-Safety-Reliability-and-Risk-Management-ESREL-2011/Berenguer-Grall-Guedes-Soares/p/book/9780415683791},
	url_Conference = {http://www1.utt.fr/esrel2011/}
}

Evaluating and comparing the threats and vulnerabilities associated with territorial zones according to multiple criteria (industrial activity, population, etc.) can be a time-consuming task and often requires the participation of several experts and decision makers. Rather than a direct evaluation of these zones, building a risk evaluation scale and using it in a formal procedure permits to automate the assessment and therefore to apply it in a repeated way and in large-scale contexts and, provided the chosen procedure and scale are accepted, to make it objective. One of the main difficulty of building such a formal evaluation procedure is to account for the multiple experts knowledge and decision makers preferences. The procedure used in this article, ELECTRE TRI, uses the performances of each territorial zone on multiple criteria, together with preferential parameters, to qualitatively assess their associated risk level. The preferential parameters to be determined are the category limits, i.e. the limits on each criterion of the performance range associated with a given risk level, and the weights associated with the different criteria. To obtain these parameters with no direct questioning of the stakeholders, tools based on mathematical programming have been developed to deduce these preferential parameters from assessment examples. In this article, several such tools are applied together in order to build a complete example leading to the definition of a territorial risk evaluation scale taking into account the preferences of multiple stakeholders.

@inproceedings{mayag_mcda_2011,
	title = {{MCDA} tools and {Risk} {Analysis}: the {Decision} {Deck} {Project}},
	isbn = {978-0-415-68379-1},
	abstract = {Multiple Criteria Decision Aid (MCDA) aims at helping a decision maker (DM) in the representation of his preferences over a set of alternatives, on the basis of several criteria which are often contradictory. In addition to the presence of a DM, MCDA process requires a specification of criteria, alternatives and preferential information given by the DM. Hence many methods have been developed in order to solve MCDA problems (ELECTRE methods, AHP, etc.). The interconnexion between MCDA and risk analysis has been proved. MCDA methods can be used to solve risk analysis problems such as: * Computation of a risk scale: it can be done by using MCDA methods as ELECTRE TRI or by MACBETH methodology when the scale is quantitative; * The evaluation of remediation solutions after an accident. We present in this paper the Decision Deck (DD) project (http://www.decision-deck.org/) which aims at collaboratively developing Open Source software tools implementing MCDA. These tools constitute an open source platform available for all communities, not only for MCDA community. We show how MCDA methods implemented in Decision Deck can be useful for risk analysis, especially in risk assessment and remediation risk management. Thus, Decision Deck can be interpreted as a bridge between MCDA and risk analysis.},
	booktitle = {Advances in {Safety}, {Reliability} and {Risk} {Management}},
	publisher = {Taylor and Francis Group, London},
	author = {Mayag, Brice and Cailloux, Olivier and Mousseau, Vincent},
	editor = {Bérenguer, Christophe and Grall, Antoine and Guedes Soares, Carlos},
	month = sep,
	year = {2011},
	note = {Sept. 18-22, 2011, Troyes, France},
	pages = {2324--2330},
	url_HAL = {https://hal-ecp.archives-ouvertes.fr/hal-00614733/},
	url_Article = {https://hal-ecp.archives-ouvertes.fr/hal-00614733/document},
	url_Proceedings = {https://www.crcpress.com/Advances-in-Safety-Reliability-and-Risk-Management-ESREL-2011/Berenguer-Grall-Guedes-Soares/p/book/9780415683791},
	url_Conference = {http://www1.utt.fr/esrel2011/}
}

Multiple Criteria Decision Aid (MCDA) aims at helping a decision maker (DM) in the representation of his preferences over a set of alternatives, on the basis of several criteria which are often contradictory. In addition to the presence of a DM, MCDA process requires a specification of criteria, alternatives and preferential information given by the DM. Hence many methods have been developed in order to solve MCDA problems (ELECTRE methods, AHP, etc.). The interconnexion between MCDA and risk analysis has been proved. MCDA methods can be used to solve risk analysis problems such as: * Computation of a risk scale: it can be done by using MCDA methods as ELECTRE TRI or by MACBETH methodology when the scale is quantitative; * The evaluation of remediation solutions after an accident. We present in this paper the Decision Deck (DD) project (http://www.decision-deck.org/) which aims at collaboratively developing Open Source software tools implementing MCDA. These tools constitute an open source platform available for all communities, not only for MCDA community. We show how MCDA methods implemented in Decision Deck can be useful for risk analysis, especially in risk assessment and remediation risk management. Thus, Decision Deck can be interpreted as a bridge between MCDA and risk analysis.

@inproceedings{zheng_constrained_2011,
	address = {Rutgers, United States},
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {Constrained {Multicriteria} {Sorting} {Method} {Applied} to {Portfolio} {Selection}},
	volume = {6992},
	isbn = {978-3-642-24872-6},
	doi = {10.1007/978-3-642-24873-3_25},
	abstract = {The paper focuses on portfolio selection problems which aim at selecting a subset of alternatives considering not only the performance of the alternatives evaluated on multiple criteria, but also the performance of portfolio as a whole, on which balance over alternatives on specific attributes is required by the Decision Makers (DMs). We propose a two-level method to handle such decision situation. First, at the individual level, the alternatives are evaluated by the sorting model Electre Tri which assigns alternatives to predefined ordered categories by comparing alternatives to profiles separating the categories. The DMs’ preferences on alternatives are expressed by some assignment examples they can provide, which reduces the DMs’ cognitive efforts. Second, at the portfolio level, the DMs’ preferences express requirements on the composition of portfolio and are modeled as constraints on category size.
The method proceeds through the resolution of a Mixed Integer Program (MIP) and selects a satisfactory portfolio as close as possible to the DMs’ preference.
The usefulness of the proposed method is illustrated by an example which integrates a sorting model with assignment examples and constraints on the portfolio definition. The method can be used widely in portfolio selection situation where the decision should be made taking into account the individual alternative and portfolio performance simultaneously.},
	booktitle = {Proceedings of the 2nd {International} {Conference} on {Algorithmic} {Decision} {Theory}},
	publisher = {Springer},
	author = {Zheng, Jun and Cailloux, Olivier and Mousseau, Vincent},
	editor = {Brafman, Ronen I. and Roberts, Fred S. and Tsoukiàs, Alexis},
	month = oct,
	year = {2011},
	pages = {331--343},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-00951743},
	IGNORED_COMMENT = {also: https://hal-ecp.archives-ouvertes.fr/hal-00614734/, but the PDF is ugly},
	url_Article = {https://hal.archives-ouvertes.fr/hal-00951743/document}
}

The paper focuses on portfolio selection problems which aim at selecting a subset of alternatives considering not only the performance of the alternatives evaluated on multiple criteria, but also the performance of portfolio as a whole, on which balance over alternatives on specific attributes is required by the Decision Makers (DMs). We propose a two-level method to handle such decision situation. First, at the individual level, the alternatives are evaluated by the sorting model Electre Tri which assigns alternatives to predefined ordered categories by comparing alternatives to profiles separating the categories. The DMs’ preferences on alternatives are expressed by some assignment examples they can provide, which reduces the DMs’ cognitive efforts. Second, at the portfolio level, the DMs’ preferences express requirements on the composition of portfolio and are modeled as constraints on category size. The method proceeds through the resolution of a Mixed Integer Program (MIP) and selects a satisfactory portfolio as close as possible to the DMs’ preference. The usefulness of the proposed method is illustrated by an example which integrates a sorting model with assignment examples and constraints on the portfolio definition. The method can be used widely in portfolio selection situation where the decision should be made taking into account the individual alternative and portfolio performance simultaneously.

@inproceedings{cailloux_electre_2010,
	address = {Coimbra, Portugal},
	title = {{ELECTRE} and {PROMETHEE} {MCDA} methods as reusable software components},
	isbn = {978-989-95055-3-7},
	abstract = {Open source software components implementing features of the ELECTRE and PROMETHEE family of MCDA procedures have been developed at Université Libre de Bruxelles and École Centrale Paris, as part of the Decision Deck project. As these procedures share several computation routines, they have been implemented as a set of independent components which can then be assembled in various ways. Care has been taken to develop complete structures representing the underlying MCDA concepts, thereby providing easy to reuse artifacts. The goal was to make them easy to use for the end-user as well as for a developer usage, i.e. to allow building of more complex functionalities on top of these objects. The components deal with XMCDA conforming files (i.e., files conforming to the XMCDA grammar, a standard published by the Decision Deck consortium) in input and output and can also be helpful for a developer wanting to provide his own software with the ability to read or write such files. This article describes the architecture of the components and details some of their usage possibilities.},
	booktitle = {Proceedings of the 25th {Mini}-{EURO} {Conference} on {Uncertainty} and {Robustness} in {Planning} and {Decision} {Making} ({URPDM} 2010)},
	publisher = {University of Coimbra, Portugal},
	author = {Cailloux, Olivier},
	month = apr,
	year = {2010},
	url_HAL = {https://hal-ecp.archives-ouvertes.fr/hal-01079218},
	url_Article = {https://hal-ecp.archives-ouvertes.fr/hal-01079218/document}
}

Open source software components implementing features of the ELECTRE and PROMETHEE family of MCDA procedures have been developed at Université Libre de Bruxelles and École Centrale Paris, as part of the Decision Deck project. As these procedures share several computation routines, they have been implemented as a set of independent components which can then be assembled in various ways. Care has been taken to develop complete structures representing the underlying MCDA concepts, thereby providing easy to reuse artifacts. The goal was to make them easy to use for the end-user as well as for a developer usage, i.e. to allow building of more complex functionalities on top of these objects. The components deal with XMCDA conforming files (i.e., files conforming to the XMCDA grammar, a standard published by the Decision Deck consortium) in input and output and can also be helpful for a developer wanting to provide his own software with the ability to read or write such files. This article describes the architecture of the components and details some of their usage possibilities.

@inproceedings{cailloux_taxonomy_2007,
	address = {Marrakech, Morocco},
	title = {A taxonomy of clustering procedures},
	abstract = {In the field of multicriteria decision aid, considerable attention has been paid to supervised classification problems, especially to so-called sorting problems, where an order is assumed on the predefined classes. Recently, some non-supervised multicriteria classification procedures, also known as multicriteria clustering procedures, have been proposed aiming to discover data structures from a multicriteria perspective. We enlighten some properties of such approaches and their differences with regards to classical procedures, and we propose a taxonomy of this family of procedures. Moreover, we analyze extend to which these procedures differ from the multicriteria ranking problematic.},
	booktitle = {Proceedings of the 66th {Meeting} of the {European} {Working} {Group} on {MCDA}},
	author = {Cailloux, Olivier and Lamboray, Claude and Nemery, Philippe},
	year = {2007},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-00985860},
	url_Article = {https://hal.archives-ouvertes.fr/hal-00985860/document}
}

In the field of multicriteria decision aid, considerable attention has been paid to supervised classification problems, especially to so-called sorting problems, where an order is assumed on the predefined classes. Recently, some non-supervised multicriteria classification procedures, also known as multicriteria clustering procedures, have been proposed aiming to discover data structures from a multicriteria perspective. We enlighten some properties of such approaches and their differences with regards to classical procedures, and we propose a taxonomy of this family of procedures. Moreover, we analyze extend to which these procedures differ from the multicriteria ranking problematic.

@inproceedings{cailloux_fairness_2006,
	title = {Fairness in {Certified} {Electronic} {Mail}},
	isbn = {0-88986-590-6},
	abstract = {The growing use of the Internet promotes the replacement of traditional manual transactions by equivalent electronic services. Research was carried out to investigate enhanced services related to electronic mail. This paper points out that a certified email protocol has to provide the sender of a certified email with an evidence that this email has been either received or refused by its recipient, and proposes a new definition of the fairness property, specific to the certified email field. Finally, a new efficient certified email protocol respecting this property is presented.},
	booktitle = {Proceedings of the 2006 {International} {Conference} on {Networks} and {Communication} {Systems}},
	publisher = {ACTA Press},
	author = {Cailloux, Olivier and González-Deleito, Nicolás and Markowitch, Olivier},
	editor = {Prapinmonkolkarn, P. and Angkaew, T.},
	month = mar,
	year = {2006},
	pages = {298 -- 303},
	url_HAL = {https://hal.archives-ouvertes.fr/hal-00985829},
	url_Article = {https://hal.archives-ouvertes.fr/hal-00985829/document},
	url_Editor = {http://www.actapress.com/Abstract.aspx?paperId=23657},
}

The growing use of the Internet promotes the replacement of traditional manual transactions by equivalent electronic services. Research was carried out to investigate enhanced services related to electronic mail. This paper points out that a certified email protocol has to provide the sender of a certified email with an evidence that this email has been either received or refused by its recipient, and proposes a new definition of the fairness property, specific to the certified email field. Finally, a new efficient certified email protocol respecting this property is presented.

@misc{cailloux_analyse_2006,
	address = {Brussels, Belgium},
	type = {Master's {Thesis} ({Mémoire} de {Diplôme} d'Études {Approfondies} en {Sciences} {Appliquées})},
	title = {Analyse de données et aide multicritère à la décision : synergies},
	abstract = {Ce travail présente, de façon intégrée, les domaines du clustering, de la classification supervisée, et de l’aide multicritère à la décision, et plus particulièrement les procédures de tri. Il présente une critique d’un modèle de présentation bien établi, et nous proposons une définition de l’aide multicritère à la décision, ainsi que de la notion centrale de critère, originale. Nous présentons également une argumentation critique justifiant l’intransitivité des préférences, un sujet souvent très polémique. Nous analysons et critiquons Promethee TRI, une procédure de tri intégrant des idées du domaine de la classification supervisée.
La partie III présente une réflexion qui n’a pas été faite à notre connaissance, concernant la difficulté, plus grande que prévue, d’intégration de l’aide multicritère à la décision et des domaines plus classiques. Outre une vision nouvelle permettant d’intégrer le clustering et la classification supervisée dans un même raisonnement et facilitant la comparaison de procédures de tri avec le domaine classique, nous mettons au jour des différences de nature importantes entre les deux domaines, plus précisément dans la source d’information utilisée. Elles tiennent en deux points essentiels : une affirmation de préférence n’est pas réfutable, et il n’existe pas de façon parfaite de mesurer la préférence. Notre raisonnement montre que ces différences découlent de la différence de problématique dont traite chaque domaine.},
	language = {French},
	school = {Université Libre de Bruxelles},
	author = {Cailloux, Olivier},
	month = jun,
	year = {2006}
}

Ce travail présente, de façon intégrée, les domaines du clustering, de la classification supervisée, et de l’aide multicritère à la décision, et plus particulièrement les procédures de tri. Il présente une critique d’un modèle de présentation bien établi, et nous proposons une définition de l’aide multicritère à la décision, ainsi que de la notion centrale de critère, originale. Nous présentons également une argumentation critique justifiant l’intransitivité des préférences, un sujet souvent très polémique. Nous analysons et critiquons Promethee TRI, une procédure de tri intégrant des idées du domaine de la classification supervisée. La partie III présente une réflexion qui n’a pas été faite à notre connaissance, concernant la difficulté, plus grande que prévue, d’intégration de l’aide multicritère à la décision et des domaines plus classiques. Outre une vision nouvelle permettant d’intégrer le clustering et la classification supervisée dans un même raisonnement et facilitant la comparaison de procédures de tri avec le domaine classique, nous mettons au jour des différences de nature importantes entre les deux domaines, plus précisément dans la source d’information utilisée. Elles tiennent en deux points essentiels : une affirmation de préférence n’est pas réfutable, et il n’existe pas de façon parfaite de mesurer la préférence. Notre raisonnement montre que ces différences découlent de la différence de problématique dont traite chaque domaine.

@misc{cailloux_courrier_2003,
	address = {Brussels, Belgium},
	type = {Master's {Thesis} ({Mémoire} de {Licence} en {Informatique})},
	title = {Le courrier électronique recommandé : définition et étude de protocoles},
	abstract = {Un protocole de Courrier Électronique Recommandé sert à échanger un message (un courrier électronique) contre un reçu concernant ce message. Le fait que l’expéditeur puisse prouver qu’il a envoyé un message peut être utile dans des situations très diverses. Typiquement, il souhaite avoir la preuve qu’il a prévenu le destinataire avant d’entreprendre une action.
Nous analysons diverses propriétés que de tels protocoles devraient satisfaire et proposons de nouvelles définitions concernant des propriétés à notre avis importantes mais non introduites avant ce travail, à notre connaissance. Par exemple, malgré le fait qu’il soit important de pouvoir dater une preuve si on souhaite l’utiliser en justice, aucun des auteurs des protocoles analysés dans ce travail ne s’est préoccupé de cette propriété. Nous constatons de plus un oubli problématique dans la littérature existante : la possibilité que le destinataire refuse le courrier. Nous définissons une nouvelle propriété, l’assurance de l’expéditeur, pour pallier ce problème.
Sept protocoles de Courrier Électronique Recommandé sont analysés de façon critique, et plusieurs erreurs sont décrites. Nous proposons des corrections pour résoudre certains problèmes ou pour améliorer le respect de certaines propriétés. Une erreur commune à presque tous les protocoles est que les auteurs n’ont pas envisagé que, si les canaux utilisés ne permettent pas de déterminer une borne sur le temps d’envoi du message, Bob peut nier éternellement avoir reçu le courrier. Cette remarque importante est faite, à notre connaissance, pour la première fois dans ce travail.
Nous poursuivons la comparaison en étudiant l’applicabilité de ces protocoles sur Internet. Nous déterminons d’abord si les hypothèses sur les qualités de canaux nécessaires au fonctionnement des protocoles peuvent être satisfaites sur ce média. Nous définissons des qualités de canaux supplémentaires par rapport aux canaux habituellement utilisés dans la littérature, ce qui nous permet de montrer qu’Internet peut éventuellement être utilisé pour envoyer un Courrier Électronique Recommandé. C’est à notre connaissance la première fois qu’une réflexion est menée pour tenter de valider l’utilisation pratique, sur Internet, d’un protocole de Courrier Électronique Recommandé théorique.
Nous comparons en détail les protocoles analysés ci-dessus dans ce contexte d’utilisation plus précis. Nous examinons entre autres les différents mécanismes mis en oeuvre pour réduire le risque que Bob refuse le courrier et le coût probable d’utilisation du protocole (dépendant principalement de la charge sur la tierce partie de confiance).
Après cette étude théorique, plusieurs services de Courrier Électronique Recommandé actuellement utilisés sur Internet sont décrits et analysés. Nous constatons combien les solutions proposées sont souvent peu efficaces et peu sérieuses, s’adressant principalement à un utilisateur qui pense que le courrier qu’il s’apprête à envoyer n’a pas assez de valeur pour que cela vaille la peine d’exploiter une faille dans le protocole. Seul un des services proposés peut d’après nos observations être utilisé pour envoyer un courrier tout en garantissant l’équité. Comme il est basé sur le modèle postal, il satisfait également l’anonymat et l’assurance de l’expéditeur.},
	school = {Université Libre de Bruxelles},
	author = {Cailloux, Olivier},
	year = {2003}
}

Un protocole de Courrier Électronique Recommandé sert à échanger un message (un courrier électronique) contre un reçu concernant ce message. Le fait que l’expéditeur puisse prouver qu’il a envoyé un message peut être utile dans des situations très diverses. Typiquement, il souhaite avoir la preuve qu’il a prévenu le destinataire avant d’entreprendre une action. Nous analysons diverses propriétés que de tels protocoles devraient satisfaire et proposons de nouvelles définitions concernant des propriétés à notre avis importantes mais non introduites avant ce travail, à notre connaissance. Par exemple, malgré le fait qu’il soit important de pouvoir dater une preuve si on souhaite l’utiliser en justice, aucun des auteurs des protocoles analysés dans ce travail ne s’est préoccupé de cette propriété. Nous constatons de plus un oubli problématique dans la littérature existante : la possibilité que le destinataire refuse le courrier. Nous définissons une nouvelle propriété, l’assurance de l’expéditeur, pour pallier ce problème. Sept protocoles de Courrier Électronique Recommandé sont analysés de façon critique, et plusieurs erreurs sont décrites. Nous proposons des corrections pour résoudre certains problèmes ou pour améliorer le respect de certaines propriétés. Une erreur commune à presque tous les protocoles est que les auteurs n’ont pas envisagé que, si les canaux utilisés ne permettent pas de déterminer une borne sur le temps d’envoi du message, Bob peut nier éternellement avoir reçu le courrier. Cette remarque importante est faite, à notre connaissance, pour la première fois dans ce travail. Nous poursuivons la comparaison en étudiant l’applicabilité de ces protocoles sur Internet. Nous déterminons d’abord si les hypothèses sur les qualités de canaux nécessaires au fonctionnement des protocoles peuvent être satisfaites sur ce média. Nous définissons des qualités de canaux supplémentaires par rapport aux canaux habituellement utilisés dans la littérature, ce qui nous permet de montrer qu’Internet peut éventuellement être utilisé pour envoyer un Courrier Électronique Recommandé. C’est à notre connaissance la première fois qu’une réflexion est menée pour tenter de valider l’utilisation pratique, sur Internet, d’un protocole de Courrier Électronique Recommandé théorique. Nous comparons en détail les protocoles analysés ci-dessus dans ce contexte d’utilisation plus précis. Nous examinons entre autres les différents mécanismes mis en oeuvre pour réduire le risque que Bob refuse le courrier et le coût probable d’utilisation du protocole (dépendant principalement de la charge sur la tierce partie de confiance). Après cette étude théorique, plusieurs services de Courrier Électronique Recommandé actuellement utilisés sur Internet sont décrits et analysés. Nous constatons combien les solutions proposées sont souvent peu efficaces et peu sérieuses, s’adressant principalement à un utilisateur qui pense que le courrier qu’il s’apprête à envoyer n’a pas assez de valeur pour que cela vaille la peine d’exploiter une faille dans le protocole. Seul un des services proposés peut d’après nos observations être utilisé pour envoyer un courrier tout en garantissant l’équité. Comme il est basé sur le modèle postal, il satisfait également l’anonymat et l’assurance de l’expéditeur.