Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fatma Essghaier

dblp:148/5042 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0003-2934-6024ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Multi-agent systems · 77% Knowledge representation and reasoning · 23%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems › multi-agent decision making
collective decision-making
0.212015
Egalitarian Collective Decision Making under Qualitative Possibilistic Uncertainty: Principles and Characterization · AAAI 2015
Algorithmic game theory and mechanism design
social choice
0.212015
Egalitarian Collective Decision Making under Qualitative Possibilistic Uncertainty: Principles and Characterization · AAAI 2015
Knowledge, reasoning and agents › Knowledge representation and reasoning › uncertainty reasoning
possibilistic reasoning
0.112015
Egalitarian Collective Decision Making under Qualitative Possibilistic Uncertainty: Principles and Characterization · AAAI 2015

Methods — techniques the papers use, named apart from their topics

possibilistic uncertainty modeling · 0.4axiomatic characterization · 0.4
YearPublicationVenuePosition
2025 Optimization of Physical and Financial Flows in the Inventory Routing Problem
abstract
Although supply chain optimization has traditionally focused on operational efficiency, financial dimensions often receive less attention. In particular, standard formulations of the Inventory Routing Problem (IRP) aim to minimize transportation and inventory costs, without accounting for financial flows or their impact on overall financial viability. To address this gap, we introduce the Operational Cash Requirement (OCR) as a dynamic indicator that captures the influence of financing strategies on inventory and routing decisions over time. This paper presents a new mixed-integer linear programming (MILP) formulation that integrates OCR into the IRP by explicitly modeling payment and collection delays. The model captures the interaction between physical and financial flows and extends the objective function to account for the financial resources required to support operational activities. Computational experiments on small-scale instances using an exact method demonstrate that incorporating financial constraints can significantly affect operational decisions, highlighting the importance of considering cash flow dynamics in logistics planning to better align operational and financial performance.
Khouloud Dorgham, Fatma Essghaier, Najet Boussaa, Issam Nouaouri
SoMeT2
2021 Truck to door assignment in a shared cross-dock under uncertainty
Fatma Essghaier, Hamid Allaoui, Gilles Goncalves
Expert Syst. Appl.1
2019 Solving sequential collective decision problems under qualitative uncertainty
Nahla Ben Amor, Fatma Essghaier, Hélène Fargier
Int. J. Approx. Reason.2
2017 Algorithms for Multi-criteria Optimization in Possibilistic Decision Trees
Nahla Ben Amor, Fatma Essghaier, Hélène Fargier
ECSQARU2
2015 Egalitarian Collective Decision Making under Qualitative Possibilistic Uncertainty: Principles and Characterization
abstract
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 collective utility function allows toget rid of the Timing Effect. Making a step further,we prove that if both the agents’ preferences and thecollective ranking of the decisions satisfy Dubois andPrade’s axioms (1995), and particularly risk aversion,and Pareto Unanimity, then the egalitarian collectiveaggregation is compulsory. This result can be seen asan ordinal counterpart of Harsanyi’s theorem (1955).
Nahla Ben Amor, Fatma Essghaier, Hélène Fargier
AAAI2
2014 Solving Multi-criteria Decision Problems under Possibilistic Uncertainty Using Optimistic and Pessimistic Utilities
Nahla Ben Amor, Fatma Essghaier, Hélène Fargier
IPMU (3)2