Object Allocation via Swaps along a Social Network - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Object Allocation via Swaps along a Social Network

Résumé

This article deals with object allocation where each agent receives a single item. Starting from an initial endowment, the agents can be better off by exchanging their objects. However, not all trades are likely because some participants are unable to communicate. By considering that the agents are embedded in a social network, we propose to study the allocations emerging from a sequence of simple swaps between pairs of neighbors in the network. This model raises natural questions regarding (i) the reachability of a given assignment, (ii) the ability of an agent to obtain a given object, and (iii) the search of Pareto-efficient allocations. We investigate the complexity of these problems by providing, according to the structure of the social network, polynomial and NP-complete cases.
Fichier principal
Vignette du fichier
object_a.pdf (148.29 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01741519 , version 1 (30-05-2018)

Identifiants

Citer

Laurent Gourvès, Julien Lesca, Anaelle Wilczynski. Object Allocation via Swaps along a Social Network. 26th International Joint Conference on Artificial Intelligence (IJCAI’17), Aug 2017, Melbourne, Australia. pp.213-219, ⟨10.24963/ijcai.2017/31⟩. ⟨hal-01741519⟩
206 Consultations
149 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More