Solving Multi-agent Knapsack Problems Using Incremental Approval Voting - Sorbonne Université Access content directly
Conference Papers Year : 2016

Solving Multi-agent Knapsack Problems Using Incremental Approval Voting

Nawal Benabbou
Patrice Perny

Abstract

In this paper, we study approval voting for multi-agent knapsack problems under incomplete preference information. The agents consider the same set of feasible knapsacks, implicitly defined by a budget constraint, but they possibly diverge in the utilities they attach to items. Individual utilities being difficult to assess precisely and to compare, we collect approval statements on knapsacks from the agents with the aim of determining the optimal solutions by approval voting. We first propose a search procedure based on mixed-integer programming to explore the space of utilities compatible with the known part of preferences in order to determine or approximate the set of possible approval winners. Then, we propose an incremen-tal procedure combining preference elicitation and search in order to determine the set of approval winners without requiring the full elic-itation of the agents' preferences. Finally, the practical efficiency of these procedures is illustrated by various numerical tests.
Fichier principal
Vignette du fichier
ecai16v3.pdf (275.46 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01344022 , version 1 (28-07-2016)

Identifiers

  • HAL Id : hal-01344022 , version 1

Cite

Nawal Benabbou, Patrice Perny. Solving Multi-agent Knapsack Problems Using Incremental Approval Voting. 22nd European Conference on Artificial Intelligence (ECAI'16), Aug 2016, La Haye, Netherlands. ⟨hal-01344022⟩
165 View
259 Download

Share

Gmail Mastodon Facebook X LinkedIn More