Explanipedia

Toward a Research Agenda on Digital Media and Humanity Well-Being Open

Chavalarias David, Antonio A. Casilli, Alexandre Delanoë, Mélanie Dulong de Rosnay, Béatrice de Gelder , et al. · 2023

In the 2020s, an American citizen will spend an average of 6h35 a day on social media, compared to 3h35 for television. As for social networks, which were non-existent less than 20 years ago, about 40\% of US citizens use them at least onc…

A New Dynamic Community-Based Recommender System Open

Sabrine Ben Abdrabbah, Nahla Ben Amor, Raouia Ayachi · 2023

Approximating voting rules from truncated ballots Open

Manel Ayadi, Nahla Ben Amor, Jérôme Lang · 2022

Solving possibilistic games with incomplete information Open

Nahla Ben Amor, Hélène Fargier, Régis Sabbadin, Meriem Trabelsi · 2022

Possibilistic Preference Networks and Lexicographic Preference Trees – A Comparison Open

Nahla Ben Amor, Didier Dubois, Henri Prade, Syrine Saidi · 2022

Ordinal Polymatrix Games with Incomplete Information Open

Nahla Ben Amor, Hélène Fargier, Régis Sabbadin, Meriem Trabelsi · 2020

Possibilistic games with incomplete information (Π-games) constitute a suitable framework for the representation of ordinal games under incomplete knowledge. However, representing a Π-game in standard normal form requires an extensive expr…

Approximating Voting Rules from Truncated Ballots Open

Manel Ayadi, Nahla Ben Amor, Jérôme Lang · 2020

Classical voting rules assume that ballots are complete preference orders over candidates. However, when the number of candidates is large enough, it is too costly to ask the voters to rank all candidates. We suggest to fix a rank k, to as…

Ordinal Graph-Based Games Open

Arij Azzabi, Nahla Ben Amor, Hélène Fargier, Régis Sabbadin · 2020

Strategies in Case-Based Argumentation-Based Negotiation: An Application for the Tourism Domain Open

Rihab Bouslama, Jaume Jordán, Stella Heras, Nahla Ben Amor · 2020

Single Transferable Vote: Incomplete Knowledge and Communication Issues Open

Manel Ayadi, Nahla Ben Amor, Jérôme Lang, Dominik Peters · 2019

Single Transferable Vote (STV) is used in large political elections around the world. It is easy to understand and has desirable normative properties such as clone-proofness. However, voters need to report full rankings, which can make it …

Possibilistic Games with Incomplete Information Open

Nahla Ben Amor, Hélène Fargier, Régis Sabbadin, Meriem Trabelsi · 2019

Bayesian games offer a suitable framework for games where the utility degrees are additive in essence. This approach does nevertheless not apply to ordinal games, where the utility degrees do not capture more than a ranking, nor to situati…

Solving sequential collective decision problems under qualitative uncertainty Open

Nahla Ben Amor, Fatma Essghaier, Hélène Fargier · 2019

Scalable Uncertainty Management Open

Nahla Ben Amor, Benjamin Quost, Martin Theobald · 2019

Lexicographic refinements in stationary possibilistic Markov Decision Processes Open

Nahla Ben Amor, Zeineb El Khalfi, Hélène Fargier, Régis Sabbadin · 2018

Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes Open

Nahla Ben Amor, Zeineb El Khalfi, Hélène Fargier, Régis Sabbadin · 2018

Representation of Multiple Agent Preferences Open

Nahla Ben Amor, Didier Dubois, Henri Prade, Syrine Saidi · 2018

The Communication Burden of Single Transferable Vote, in Practice Open

Manel Ayadi, Nahla Ben Amor, Jérôme Lang · 2018

Possibilistic preference networks Open

Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade · 2017

Equilibria in Ordinal Games: A Framework based on Possibility Theory. Open

Nahla Ben Amor, Hélène Fargier, Régis Sabbadin · 2017

The present paper proposes the first definition of mixed equilibrium for ordinal games. This definition naturally extends possibilistic (single agent) decision theory. This allows us to provide a unifying view of single and multi-agent qua…

Efficient Policies for Stationary Possibilistic Markov Decision Processes Open

Nahla Ben Amor, Zeineb El Khalfi, Hélène Fargier, Régis Sabaddin · 2017

Représentation graphique de préférences multiagents Open

Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade · 2016

Cet article propose une représentation graphique de préférences multi-agents, basée sur la th´eorie des possibilités. C’est une contrepartie graphique de la logique possibiliste multi-agents. Nous proposons d’abord une représentation graph…

Possibilistic Networks: Parameters Learning from Imprecise Data and Evaluation strategy Open

Maroua Haddad, Philippe Leray, Nahla Ben Amor · 2016

There has been an ever-increasing interest in multidisciplinary research on representing and reasoning with imperfect data. Possibilistic networks present one of the powerful frameworks of interest for representing uncertain and imprecise …

Probabilistic relational model benchmark generation: Principle and application Open

Mouna Ben Ishak, Philippe Leray, Nahla Ben Amor · 2016

The validation of any database mining methodology goes through an evaluation process where benchmarks availability is essential. In this paper, we aim to randomly generate relational database benchmarks that allow to check probabilistic de…

A Hybrid Approach for Probabilistic Relational Models Structure Learning Open

Mouna Ben Ishak, Philippe Leray, Nahla Ben Amor · 2016

Preference Modeling with Possibilistic Networks and Symbolic Weights: A Theoretical Study Open

Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade · 2016

The use of possibilistic networks for representing conditional preference statements on discrete variables has been proposed only recently. The approach uses non-instantiated possibility weights to define conditional preference tables. Mor…

Lexicographic Refinements in Possibilistic Decision Trees Open

Nahla Ben Amor, Zeineb El Khalfi, Hélène Fargier, Régis Sabbadin · 2016

Possibilistic decision theory has been proposed twenty years ago and has had several extensions since then. Because of the lack of decision power of possibilistic decision theory, several refinements have then been proposed. Unfortunately,…

Graphical Models for Preference Representation: An Overview Open

Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade · 2016

Décision collective sous incertitude possibiliste. Principes et axiomatisation Open

Nahla Ben Amor, Fatma Essghaier, Hélène Fargier · 2015

International audience

Egalitarian Collective Decision Making under Qualitative Possibilistic Uncertainty: Principles and Characterization Open

Nahla Ben Amor, Fatma Essghaier, Hélène Fargier · 2015

This paper raises the question of collective decisionmaking under possibilistic uncertainty; We study fouregalitarian decision rules and show that in the contextof a possibilistic representation of uncertainty, the useof an egalitarian col…

Evaluating Product-Based Possibilistic Networks Learning Algorithms Open

Maroua Haddad, Philippe Leray, Nahla Ben Amor · 2015

Nahla Ben Amor YOU? Author Swipe