Matching is as easy as matrix inversion
Combinatorica
Exact arborescences, matchings and cycles
Discrete Applied Mathematics
Efficient LRU-Based Buffering in a LAN Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
The complexity of restricted spanning tree problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the performance of user equilibria in traffic networks
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Distributed Selfish Replication
IEEE Transactions on Parallel and Distributed Systems
Cooperation in multi-organization scheduling
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
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.