AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Active Preference Learning Based on Generalized Gini Functions: Application to the Multiagent Knapsack Problem

Nadjet Bourdache, Patrice Perny

AAAI 2019 · Learning theory and algorithms › Submodular and game algorithms · approach: Matching markets and welfare · 16 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use Algorithm 1 (extreme-points regret optimization, S1) instead of interactive branch and boundfair multiagent knapsack elicitation · MKP computation timecomputation time (s): 94.21 -> 8.3 (n=10,p=20); 374.03 -> 411.7 (n=10,p=100)Mixed
use Algorithm 1 (S1) instead of interactive branch and boundfair multiagent knapsack elicitation · MKP number of queriesnumber of queries: 7.1 -> 4.7 (n=10,p=20); 9.6 -> 23.1 (n=10,p=100)Mixed
use S1 (current solution strategy) instead of random query selection (ablation)Algorithm 1 · MKP n=10, p=50queries to MMR below 10% of initial: about 5 vs more than 30Improved
use S2 (interval halving) instead of random query selection (ablation)Algorithm 1 · MKP n=10, p=50queries to MMR below 10% of initial: approximatively 17 vs more than 30Improved
use S1 instead of S2 query strategy (ablation)Algorithm 1 · MKP n=10, p=50queries to MMR below 10% of initial: 17 -> 5Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy