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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. In: Proc. of FOCS 2004, pp. 295–304 (2004)
Barahona, F., Pulleyblank, W.R.: Exact arborescences, matchings, and cycles. Discrete Appl. Math. 16, 91–99 (1987)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Karzanov, A.V.: Maximum matching of given weight in complete and complete bipartite graphs. Cybernetics 23, 8–13 (1987) (translation from Kibernetika 1, 711 (1987))
Laoutaris, N., Telelis, O., Zissimopoulos, V., Stavrakakis, I.: Distributed Selfish Replication. IEEE Trans. Parallel Distrib. Syst. 17(12), 1401–1413 (2006)
Leff, A., Wolf, L., Yu, P.S.: Efficient LRU-based buffering in a LAN remote caching architecture. IEEE Trans. Parallel Distrib. Syst. 7(2), 191–206 (1996)
Mulmuley, K., Vazirani, U., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica 7, 105–113 (1987)
Papadimitriou, C.H., Yannakakis, M.: The complexity of restricted spanning tree problems. J. ACM 29, 285–309 (1982)
Pascual, F., Rzadca, K., Trystram, D.: Cooperation in multi-organization scheduling. In: Kermarrec, A.-M., Bougé, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 224–233. Springer, Heidelberg (2007)
Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)
Pentico, D.W.: Assignment problems: A golden anniversary survey. EJOR 176, 774–793 (2007)
Schultz, A.S., Stier Moses, N.: On the performance of user equilibria in traffic networks. In: Proc. of SODA 2003, pp. 86–87 (2003)
Shapley, L.S., Shubik, M.: The assignment game I: The core. International Journal of Game Theory 1, 111–130 (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gourvès, L., Monnot, J., Pascual, F. (2009). Cooperation in Multiorganization Matching. In: Bampis, E., Skutella, M. (eds) Approximation and Online Algorithms. WAOA 2008. Lecture Notes in Computer Science, vol 5426. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93980-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-93980-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93979-5
Online ISBN: 978-3-540-93980-1
eBook Packages: Computer ScienceComputer Science (R0)