• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Cooperation in multiorganization matching

Thumbnail
Date
2012
Dewey
Recherche opérationnelle
Sujet
théorie des graphes; approximation algorithm with performance guarantee; complexity; matching problem; cooperation
JEL code
C.C4.C44
Journal issue
Algorithmic Operations Research
Volume
7
Number
2
Publication date
2012
Article pages
111-124
Publisher
Preeminent Academic Facets
DOI
http://dx.doi.org/10.1007/978-3-540-93980-1_7
URI
https://basepub.dauphine.fr/handle/123456789/16120
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Gourvès, Laurent
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Monnot, Jérôme
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Pascual, Fanny
233 Laboratoire d'Informatique de Paris 6 [LIP6]
Type
Article accepté pour publication ou publié
Abstract (EN)
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.