Nawal Benabbou

Orcid: 0000-0002-4589-4162

Affiliations:
  • Sorbonne University, Paris, France


According to our database1, Nawal Benabbou authored at least 28 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A regret-based query selection strategy for the incremental elicitation of the criteria weights in an SRMP model.
Oper. Res., March, 2024

2023
RIGA: A Regret-Based Interactive Genetic Algorithm.
CoRR, 2023

On the Notion of Envy Among Groups of Agents in House Allocation Problems.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022
Sequential and Swap Mechanisms for Public Housing Allocation with Quotas and Neighbourhood-based Utilities.
ACM Trans. Economics and Comput., December, 2022

2021
Finding Fair and Efficient Allocations for Matroid Rank Valuations.
ACM Trans. Economics and Comput., 2021

Interactive Optimization of Submodular Functions Under Matroid Constraints.
Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
The Price of Quota-based Diversity in Assignment Problems.
ACM Trans. Economics and Comput., 2020

Finding Fair and Efficient Allocations When Valuations Don't Add Up.
Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Fairness and Diversity in Public Resource Allocation Problems.
IEEE Data Eng. Bull., 2019

An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information.
Proceedings of the Scalable Uncertainty Management - 13th International Conference, 2019

A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Fairness Towards Groups of Agents in the Allocation of Indivisible Items.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Combining Local Search and Elicitation for Multi-Objective Combinatorial Optimization.
Proceedings of the Algorithmic Decision Theory - 6th International Conference, 2019

2018
Diversity Constraints in Public Housing Allocation.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Procédures de décision par élicitation incrémentale de préférences en optimisation multicritère, multi-agents et dans l'incertain. (Decision processes based on incremental preference elicitation for multicriteria optimization, collective decision making and decision making under uncertainty).
PhD thesis, 2017

Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems.
Artif. Intell., 2017

Incremental Decision Making Under Risk with the Weighted Expected Utility Model.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Adaptive Elicitation of Preferences under Uncertainty in Sequential Decision Making Problems.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Incremental Preference Elicitation in Multi-attribute Domains for Choice and Ranking with the Borda Count.
Proceedings of the Scalable Uncertainty Management - 10th International Conference, 2016

Solving Multi-Agent Knapsack Problems Using Incremental Approval Voting.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015
Combining Preference Elicitation and Search in Multiobjective State-Space Graphs.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Possible Optimality and Preference Elicitation for Decision Making.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Incremental Weight Elicitation for Multiobjective State Space Search.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Incremental Elicitation of Choquet Capacities for Multicriteria Decision Making.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014


  Loading...