On the Approximability of Combinatorial Exchange Problems
In a combinatorial exchange the goal is to find a feasible trade between potential buyers and sellers requesting and offering bundles of indivisible goods. We investigate the approximability of several optimization objectives in this setting and show that the problems of surplus and trade volume maximization are inapproximable even with free disposal and even if each agent’s bundle is of size at most 3. In light of the negative results for surplus maximization we consider the complementary goal of social cost minimization and present tight approximation results for this scenario. Considering the more general supply chain problem, in which each agent can be a seller and buyer simultaneously, we prove that social cost minimization remains inapproximable even with bundles of size 3, yet becomes polynomial time solvable for agents trading bundles of size 1 or 2. This yields a complete characterization of the approximability of supply chain and combinatorial exchange problems based on the size of traded bundles. We finally briefly address the problem of exchanges in strategic settings.
KeywordsSupply Chain Social Cost Combinatorial Auction Algorithm Cover Free Disposal
Unable to display preview. Download preview PDF.
- 3.Briest, P., Krysta, P., Vöcking, B.: Approximation Techniques for Utilitarian Mechanism Design. In: Proc. of STOC (2005)Google Scholar
- 10.Nisan, N., Segal, I.: The Communication Requirements of Efficient Allocations and Supporting Prices. Journal of Economic Theory (2006)Google Scholar
- 11.Parkes, D.C., Cavallo, R., Elprin, N., Juda, A., Lahaie, S., Lubin, B., Michael, L., Shneidman, J., Sultan, H.: ICE: An Iterative Combinatorial Exchange. In: Proc. of EC, pp. 249–258 (2005)Google Scholar
- 12.Parkes, D.C., Kalagnanam, J., Eso, M.: Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges. In: Proc. of IJCAI, pp. 1161–1168 (2001)Google Scholar
- 14.Roughgarden, T., Sundararajan, M.: New Trade-Offs in Cost-Sharing Mechanisms. Proc. of STOC, 79–88 (2006)Google Scholar
- 16.Sandholm, T., Suri, S.: Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. In: Proc. of AAAI/IAAI, pp. 90–97 (2000)Google Scholar