Latest Research Activities


Contributions to Algorithmic Decision Theory


The Digraph3 collection of Python 3.5 modules

All our algorithmic research is actually implemented in Python3 and published with an extensive technical documentation and tutorials covering various topics like:


UL HPC big data ranking records

In the context of the ongoing GDRI-Algodec "Algorithmic Decision Theory" supported by the CNRS and the FNR, we develop multicriteria ranking algorithms for large sets of potential decision alternatives: up to several millions of alternatives evaluated on multiple incommensurable ordinal performance criteria. This research is motivated by the development of a visualization tool - a heat map - for performance tables showing the decision alternatives linearly ordered form the best to the worst, and the individual performances colored by quantiles equivalence classes (see picture below).

heat map example
Example heat map from a CloudCom 2015 conference paper by Shyam Wagele et al.

By using Python3.5 multiprocessing resources and the Digraph3 multicriteria software library, we may linearly rank without ties on the UL HPC gaia-80 machine with 120 single threaded cores and a CPU memory of 2.5 TB, in less than three hours (2h55') a huge set of 2.5 millions of decision alternatives evaluated on 21 performance criteria by balancing an economic, an ecological and a societal decision objective. Data input is, on the one side, a 2500000x21 performance tableau of size 5GB, and on the other side, a theoretical outranking space consisting of 6.25 trillions (6.25 x 1012) of pairwise comparisons. A "small" set of 1000 decision alternatives, in a similar setting, may thus be ranked typically in less than a second.

UL HCP node gaia-80 connected

On confident outrankings with multiple criteria of uncertain significance

When modelling preferences following the bipolar-valued outranking approach, the sign of the majority margins do sharply distribute validation and invalidation of pairwise outranking situations. How can we be confident in the resulting outranking digraph, when we acknowledge the usual imprecise knowledge of criteria significance weights and a small majority margin? To answer this question, we propose to model the significance weights as random variables following more or less widespread distributions around a central weight value that corresponds to the given deterministic weight. As the bipolarly valued random credibility of an outranking statement results from a simple sum of positive or negative independent and similarly distributed random variables, we may apply the CLT for computing likelihoods that a given majority margin is indeed positive, respectively negative. To test the effective convergence of the CLT likelihoods, we apply Monte Carlo simulations of outranking digraph constructions. Our computational results confirm a satisfactory convergence even for a random performance tableau with only seven criteria.

confident outranking picture

Building a multiple criteria quantiles sorting recommendation

We apply order statistics for sorting a set of n potential deicison actions, evaluated on p incommensurable performance criteria, into k quantile equivalence classes, based on pairwise outranking characteristics involving the quantile class limits observed on each criterion. Thus we may implement a weak ordering algorithm of linear complexity O(npk).

Background picture

The Rubis progressive best choice recommendation

The main concern of the RUBIS method is tackling the choice problem in the context of multiple criteria decision aiding. Its genuine purpose is to help a decision maker to determine a single best decision alternative. Methodologically we focus on pairwise comparisons of these alternatives which lead to the concept of bipolar-valued outranking digraph. The work is centred around a set of five pragmatic principles which are required in the context of a progressive decision aiding methodology. Their thorough study and implementation in the outranking digraph lead us to define a choice recommendation as an extension of the classical digraph kernel concept.

K-Sorting: A multiple ordinal criteria approach for supervised categorical sorting

Practical applications concern European University Rankings, FNR foresight topics ranking, Selection of Master students, etc.


Luxembourg Decision Sciences


SCImago (Scopus) Country Rank

International visibility1996-2015
H Index 20
Documents 232
Citable Documents 219
Citations 1545
Self Citations 176
Citations per Document 6,66
%Luxembourg/%world (2015) 3.0

Creative Commons LicenseRaymond Bisdorff. Best seen with Firefox. Valid XHTML 1.0 Strict Valid CSS!

ADT Events:
forthcoming
ADT 2017
past
Graphs-Decisions

RIA Servers: Leopold-Loewenheim
Ernst-Schroeder

D4 Webapps Designer:

D4 Webapps Designer

D3 XMCDA Server:

D3 Web Server