Show simple item record

dc.contributor.authorGourvès, Laurent*
dc.contributor.authorMonnot, Jérôme*
dc.contributor.authorPascual, Fanny*
dc.date.accessioned2017-01-04T16:09:15Z
dc.date.available2017-01-04T16:09:15Z
dc.date.issued2012
dc.identifier.issn1718-3235
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/16120
dc.language.isoenen
dc.subjectthéorie des graphesen
dc.subjectapproximation algorithm with performance guaranteeen
dc.subjectcomplexityen
dc.subjectmatching problemen
dc.subjectcooperationen
dc.subject.ddc003en
dc.subject.classificationjelC.C4.C44en
dc.titleCooperation in multiorganization matchingen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenWe 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.en
dc.relation.isversionofjnlnameAlgorithmic Operations Research
dc.relation.isversionofjnlvol7en
dc.relation.isversionofjnlissue2en
dc.relation.isversionofjnldate2012
dc.relation.isversionofjnlpages111-124en
dc.relation.isversionofdoi10.1007/978-3-540-93980-1_7en
dc.relation.isversionofjnlpublisherPreeminent Academic Facetsen
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2017-01-03T13:48:40Z
hal.person.labIds989*
hal.person.labIds989*
hal.person.labIds233*
hal.faultCode{"duplicate-entry":{"hal-01303906":{"doi":"1.0"}}}


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record