2019/03/27 by Johanne Cohen, Cohen, Johanne, Daniel Cordeiro +3
Computer Science · Decision Sciences · #Auction Theory and Applications #Computer Science and Game Theory (cs.GT) #Distributed #FOS: Computer and information sciences #Optimization and Search Problems #Parallel #Peer-to-Peer Network Technologies #and Cluster Computing (cs.DC) #cs.DC #cs.GT
paper · pdf · doi:10.48550/arxiv.1903.11596
arXiv admin note: text overlap with arXiv:1606.07111
arxiv created 2019/03/27 · openalex publication_date 2019/03/27 · arxiv updated 2019/03/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present an algorithm for detecting service provider alliances. To perform this, we modelize a cooperative game-theoretic model for competitor service providers. A choreography (a peer-to-peer service composition model) needs a set of services to fulfill its requirements. Users must choose, for each requirement, which service providers will be used to enact the choreography at lowest cost. Due to the lack of centralization, vendors can form alliances to control the market. We propose a novel algorithm capable of detecting alliances among service providers, based on our findings showing that this game has an empty core, but a non-empty bargaining set.