• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Finding a collective set of items: From proportional multirepresentation to group recommendation

Skowron, Piotr; Faliszewski, Piotr; Lang, Jérôme (2016), Finding a collective set of items: From proportional multirepresentation to group recommendation, Artificial Intelligence, 241, p. 191-216. 10.1016/j.artint.2016.09.003

Type
Article accepté pour publication ou publié
Date
2016
Journal name
Artificial Intelligence
Number
241
Publisher
Elsevier
Pages
191-216
Publication identifier
10.1016/j.artint.2016.09.003
Metadata
Show full item record
Author(s)
Skowron, Piotr
Oxford University
Faliszewski, Piotr
Department of Automatics [AGH-UST]
Lang, Jérôme
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
We consider the following problem: There is a set of items (e.g., movies) and a group of agents (e.g., passengers on a plane); each agent has some intrinsic utility for each of the items. Our goal is to pick a set of K items that maximize the total derived utility of all the agents (i.e., in our example we are to pick K movies that we put on the plane's entertainment system). However, the actual utility that an agent derives from a given item is only a fraction of its intrinsic one, and this fraction depends on how the agent ranks the item among the chosen, available, ones. We provide a formal specification of the model and provide concrete examples and settings where it is applicable. We show that the problem is hard in general, but we show a number of tractability results for its natural special cases.
Subjects / Keywords
Proportional representation; Ordered weighted average; Chamberlin–Courant rule; Computational complexity; Computational social choice; Approximation; Elections; Voting

Related items

Showing items related by title and author.

  • Thumbnail
    Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation 
    Skowron, Piotr; Faliszewski, Piotr; Lang, Jérôme (2015) Communication / Conférence
  • Thumbnail
    Multi-attribute proportional representation 
    Lang, Jérôme; Skowron, Piotr (2018) Article accepté pour publication ou publié
  • Thumbnail
    Multi-Attribute Proportional Representation 
    Lang, Jérôme; Skowron, Piotr (2016) Communication / Conférence
  • Thumbnail
    Online Approval Committee Elections 
    Do, Virginie; Hervouin, Matthieu; Lang, Jérôme; Skowron, Piotr (2022) Communication / Conférence
  • Thumbnail
    How Hard Is It for a Party to Nominate an Election Winner? 
    Faliszewski, Piotr; Gourvès, Laurent; Lang, Jérôme; Lesca, Julien; Monnot, Jérôme (2016) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo