Cooperation in Multiorganization Matching - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Cooperation in Multiorganization Matching

Laurent Gourvès
  • Function : Author
Jérôme Monnot
Fanny Pascual
  • Function : Author
  • PersonId : 855950


We study a problem involving a set of organizations. Each organization has its own pool of clients who either supply or demand one unit of an indivisible product. Knowing the profit induced by each buyer-seller pair, an organization’s task is to conduct such transactions within its database of clients in order to maximize the amount of the transactions. Inter-organizations transactions are allowed: in this situation, two clients from distinct organizations can trade and their organizations share the induced profit. Since maximizing the overall profit leads to unacceptable situations where an organization can be penalized, we study the problem of maximizing the overall profit such that no organization gets less than it can obtain on its own. Complexity results, an approximation algorithm and a matching inapproximation bound are given.

Dates and versions

hal-01303906 , version 1 (18-04-2016)



Laurent Gourvès, Jérôme Monnot, Fanny Pascual. Cooperation in Multiorganization Matching. 6th Workshop on Approximation and Online Algorithms, Sep 2008, Karlsruhe, Germany. pp.78-91, ⟨10.1007/978-3-540-93980-1_7⟩. ⟨hal-01303906⟩
21 View
0 Download



Gmail Facebook X LinkedIn More