Solving multi-agent knapsack problems using incremental approval voting

DOI10.3233/978-1-61499-672-9-1318MaRDI QIDQ4576250zbMATH OpenFDO

Authors Nawal Benabbou, Patrice Perny

Publication date 12 July 2018

Full work available at URL https://doi.org/10.3233/978-1-61499-672-9-1318

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 7368387
• Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem
• An improved interactive hybrid method for the linear multi-objective knapsack problem
• Multicriteria approval: application of approval voting concepts to MCDM problems
• Preference elicitation and robust winner determination for single- and multi-winner social choice

Cited in

(5)

• Combining local search and elicitation for multi-objective combinatorial optimization
• An interactive polyhedral approach for multi-objective combinatorial optimization with incomplete preference information
• More effort towards multiagent knapsack
• Approval-based committee voting under incomplete information
• Worst-case fair guarantees when spending a common budget

This page was built for publication: Solving multi-agent knapsack problems using incremental approval voting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576250)