Greedy local improvement and weighted set packing approximation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On Local Search for Weighted k-Set Packing
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges
Proceedings of the 8th ACM conference on Electronic commerce
| Hi-index | 0.00 |
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets. We consider two main models of one-shot markets and exchange markets over time. For one-shot markets, we study three main variants of the problem: one-to-one exchange market problem, exchange market problem with short cycles, and probabilistic exchange market problem. We show that all the above problems are NP-hard, and propose heuristics and approximation algorithms for these problems. Experiments show that the number of items exchanged will increase when exchanges through cycles are allowed. Exploring algorithms for markets over time is an interesting direction for future work.