Cooperation in multiorganization matching

Authors

  • Laurent Gourvès CNRS, LAMSADE UMR 7243, F-75016 Paris, France
  • Jérôme Monnot PSL, Universit Paris-Dauphine, LAMSADE UMR 7243, F-75016 Paris, France
  • Fanny Pascual LIP6, Université Pierre et Marie Curie - UMR CNRS, 4 place Jussieu, 75005 Paris, France

Abstract

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.

Downloads

Published

2012-12-12

How to Cite

Gourvès, L., Monnot, J., & Pascual, F. (2012). Cooperation in multiorganization matching . Algorithmic Operations Research, 7(2). Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/20400

Issue

Vol. 7 No. 2 (2012)

Section

Articles

License

The copyright of the submitted article is hereby transferred to “Preeminent Academic Facets Inc. (the “publisher”) to the extent possible by the laws in the respective countries of the author(s). The author(s) retain all other rights including the following: 1. Any patents and trademark rights. 2. Right to post a pre-print version of the paper on the author’s personal website which is not used for commercial purposes. The author(s) warrant that the work is original, it has not been published elsewhere, it is not currently under consideration for publication in any form, and it does not infringe any copyright laws. The signing author or agent further warrants that all authors, if applicable, have been informed of the terms of this agreement and obtained the approval and authority to sign the agreement.