• 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

Service Exchange Problem

Lesca, Julien; Taiki, Todo (2018), Service Exchange Problem, in Lang, Jérôme, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, AAAI Press / IJCAI : Palo Alto (USA), p. 354–360

View/Open
0049.pdf (170.3Kb)
Type
Communication / Conférence
Date
2018
Conference title
27th International Joint Conference on Artificial Intelligence (IJCAI’18)
Conference date
2018-07
Conference city
Stockholm
Conference country
Sweden
Book title
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence
Book author
Lang, Jérôme
Publisher
AAAI Press / IJCAI
Published in
Palo Alto (USA)
ISBN
978-0-9992411-2-7
Pages
354–360
Metadata
Show full item record
Author(s)
Lesca, Julien
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Taiki, Todo
Dept. Informatics, ISEE, Kyushu University
Abstract (EN)
In this paper, we study the service exchange problem where each agent is willing to provide her service in order to receive in exchange the service of someone else. We assume that agent’s preference depends both on the service that she receives and the person who receives her service. This framework is an extension of the housing market problem to preferences including a degree of externalities.We investigate the complexity of computing an in-dividually rational and Pareto efficient allocation of services to agents for ordinal preferences, and the complexity of computing an allocation which maximizes either the utility sum or the utility of theleast served agent for cardinal preferences.
Subjects / Keywords
Multi-agent Systems; Agent-based; Economic Paradigms; Auctions; Market-Based Systems; Computational Social Choice; Resource Allocation

Related items

Showing items related by title and author.

  • Thumbnail
    A Complexity Approach for Core-Selecting Exchange under Conditionally Lexicographic Preferences 
    Fujita, Etsushi; Lesca, Julien; Sonoda, Akihisa; Todo, Taiki; Yokoo, Makoto (2018) Article accepté pour publication ou publié
  • Thumbnail
    A Complexity Approach for Core-Selecting Exchange with Multiple Indivisible Goods under Lexicographic Preferences 
    Lesca, Julien; Fujita, Etsushi; Sonoda, Akihisa; Todo, Taiki; Yokoo, Makoto (2015) Communication / Conférence
  • Thumbnail
    Local Envy-Freeness in House Allocation Problems 
    Beynier, Aurélie; Chevaleyre, Yann; Gourvès, Laurent; Lesca, Julien; Maudet, Nicolas; Wilczynski, Anaëlle (2018) Communication / Conférence
  • Thumbnail
    Local envy-freeness in house allocation problems 
    Beynier, Aurélie; Chevaleyre, Yann; Gourvès, Laurent; Harutyunyan, Ararat; Lesca, Julien; Maudet, Nicolas; Wilczynski, Anaëlle (2019) Article accepté pour publication ou publié
  • Thumbnail
    On the Problem of Assigning PhD Grants 
    Cechlárová, Katarína; Gourvès, Laurent; Lesca, Julien (2019) 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