default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNawal Benabbou
Person information
- affiliation: Sorbonne University, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Arwa Khannoussi, Alexandru-Liviu Olteanu, Patrick Meyer
, Nawal Benabbou:
A regret-based query selection strategy for the incremental elicitation of the criteria weights in an SRMP model. Oper. Res. 24(1): 12 (2024)- 2023
- [c21]Nathanaël Gross-Humbert, Nawal Benabbou, Aurélie Beynier, Nicolas Maudet:
On the Notion of Envy Among Groups of Agents in House Allocation Problems. ECAI 2023: 924-931 - [i3]Nawal Benabbou, Cassandre Leroy, Thibaut Lust:
RIGA: A Regret-Based Interactive Genetic Algorithm. CoRR abs/2311.06063 (2023) - 2022
- [j5]Nathanaël Gross-Humbert, Nawal Benabbou, Aurélie Beynier, Nicolas Maudet:
Sequential and Swap Mechanisms for Public Housing Allocation with Quotas and Neighbourhood-based Utilities. ACM Trans. Economics and Comput. 10(4): 15:1-15:24 (2022) - 2021
- [j4]Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick:
Finding Fair and Efficient Allocations for Matroid Rank Valuations. ACM Trans. Economics and Comput. 9(4): 21:1-21:41 (2021) - [c20]Nawal Benabbou, Cassandre Leroy, Thibaut Lust, Patrice Perny:
Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization. AAAI 2021: 12233-12240 - [c19]Nawal Benabbou, Cassandre Leroy, Thibaut Lust, Patrice Perny:
Interactive Optimization of Submodular Functions Under Matroid Constraints. ADT 2021: 307-322 - [c18]Nathanaël Gross-Humbert, Nawal Benabbou, Aurélie Beynier, Nicolas Maudet:
Sequential and Swap Mechanisms for Public Housing Allocation with Quotas and Neighbourhood-Based Utilities. AAMAS 2021: 1521-1523 - 2020
- [j3]Nawal Benabbou, Mithun Chakraborty, Xuan-Vinh Ho, Jakub Sliwinski, Yair Zick:
The Price of Quota-based Diversity in Assignment Problems. ACM Trans. Economics and Comput. 8(3): 14:1-14:32 (2020) - [c17]Nawal Benabbou, Cassandre Leroy, Thibaut Lust:
An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems. AAAI 2020: 2335-2342 - [c16]Nawal Benabbou, Cassandre Leroy, Thibaut Lust:
Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators. ECAI 2020: 419-426 - [c15]Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick:
Finding Fair and Efficient Allocations When Valuations Don't Add Up. SAGT 2020: 32-46 - [i2]Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick:
Finding Fair and Efficient Allocations When Valuations Don't Add Up. CoRR abs/2003.07060 (2020)
2010 – 2019
- 2019
- [j2]Nawal Benabbou, Mithun Chakraborty, Yair Zick:
Fairness and Diversity in Public Resource Allocation Problems. IEEE Data Eng. Bull. 42(3): 64-75 (2019) - [c14]Nawal Benabbou, Cassandre Leroy, Thibaut Lust, Patrice Perny:
Combining Local Search and Elicitation for Multi-Objective Combinatorial Optimization. ADT 2019: 1-16 - [c13]Nawal Benabbou, Mithun Chakraborty, Edith Elkind, Yair Zick:
Fairness Towards Groups of Agents in the Allocation of Indivisible Items. IJCAI 2019: 95-101 - [c12]Nawal Benabbou, Thibaut Lust:
A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences. SOCS 2019: 164-165 - [c11]Nawal Benabbou, Thibaut Lust:
An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information. SUM 2019: 221-235 - 2018
- [c10]Nawal Benabbou, Mithun Chakraborty, Xuan-Vinh Ho, Jakub Sliwinski, Yair Zick:
Diversity Constraints in Public Housing Allocation. AAMAS 2018: 973-981 - 2017
- [b1]Nawal Benabbou:
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). Pierre and Marie Curie University, Paris, France, 2017 - [j1]Nawal Benabbou, Patrice Perny, Paolo Viappiani:
Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems. Artif. Intell. 246: 152-180 (2017) - [c9]Nawal Benabbou, Patrice Perny:
Adaptive Elicitation of Preferences under Uncertainty in Sequential Decision Making Problems. IJCAI 2017: 4566-4572 - [c8]Hugo Gilbert, Nawal Benabbou, Patrice Perny, Olivier Spanjaard, Paolo Viappiani:
Incremental Decision Making Under Risk with the Weighted Expected Utility Model. IJCAI 2017: 4588-4594 - [i1]Nawal Benabbou, Mithun Chakraborty, Vinh Ho Xuan, Jakub Sliwinski, Yair Zick:
Diversity Constraints in Public Housing Allocation. CoRR abs/1711.10241 (2017) - 2016
- [c7]Nawal Benabbou, Patrice Perny:
Solving Multi-Agent Knapsack Problems Using Incremental Approval Voting. ECAI 2016: 1318-1326 - [c6]Nawal Benabbou, Serena Di Sabatino Di Diodoro, Patrice Perny, Paolo Viappiani:
Incremental Preference Elicitation in Multi-attribute Domains for Choice and Ranking with the Borda Count. SUM 2016: 81-95 - 2015
- [c5]Nawal Benabbou, Patrice Perny:
Incremental Weight Elicitation for Multiobjective State Space Search. AAAI 2015: 1093-1099 - [c4]Nawal Benabbou, Patrice Perny:
On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems. ADT 2015: 322-337 - [c3]Nawal Benabbou:
Possible Optimality and Preference Elicitation for Decision Making. ADT 2015: 561-566 - [c2]Nawal Benabbou, Patrice Perny:
Combining Preference Elicitation and Search in Multiobjective State-Space Graphs. IJCAI 2015: 297-303 - 2014
- [c1]Nawal Benabbou, Patrice Perny, Paolo Viappiani:
Incremental Elicitation of Choquet Capacities for Multicriteria Decision Making. ECAI 2014: 87-92
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
