Skip to Main content Skip to Navigation
Conference papers

Object Allocation via Swaps along a Social Network

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01741519
Contributor : Christine Okret-Manville Connect in order to contact the contributor
Submitted on : Wednesday, May 30, 2018 - 4:39:20 PM
Last modification on : Wednesday, November 17, 2021 - 12:27:15 PM
Long-term archiving on: : Friday, August 31, 2018 - 12:34:23 PM

File

object_a.pdf
Publisher files allowed on an open archive

Identifiers

Citation

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⟩

Share

Metrics

Les métriques sont temporairement indisponibles