{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:11:51Z","timestamp":1743073911421,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540793083"},{"type":"electronic","value":"9783540793090"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79309-0_9","type":"book-chapter","created":{"date-parts":[[2008,4,19]],"date-time":"2008-04-19T06:31:27Z","timestamp":1208586687000},"page":"83-94","source":"Crossref","is-referenced-by-count":5,"title":["On the Approximability of Combinatorial Exchange Problems"],"prefix":"10.1007","author":[{"given":"Moshe","family":"Babaioff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Briest","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Krysta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon, N., Moshkovitz, D., Safra, M.: Algorithmic Construction of Sets for k-Restrictions. ACM Transactions on Algorithms\u00a02, 153\u2013177 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.dss.2004.08.008","volume":"39","author":"M. Babaioff","year":"2005","unstructured":"Babaioff, M., Walsh, W.E.: Incentive-Compatible, Budget-Balanced, yet Highly Efficient Auctions for Supply Chain Formation. Decision Support Systems\u00a039, 123\u2013149 (2005)","journal-title":"Decision Support Systems"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation Techniques for Utilitarian Mechanism Design. In: Proc. of STOC (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"9_CR4","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. John Wiley, Chichester (1998)"},{"key":"9_CR5","volume-title":"Combinatorial Auctions","author":"P. Cramton","year":"2006","unstructured":"Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press, Cambridge (2006)"},{"key":"9_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, New York (1979)"},{"issue":"5","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/585265.585266","volume":"49","author":"D. Lehmann","year":"2002","unstructured":"Lehmann, D., O\u2019Callaghan, L.I., Shoham, Y.: Truth Revelation in Approximately Efficient Combinatorial Auctions. J. of the ACM\u00a049(5), 1\u201326 (2002)","journal-title":"J. of the ACM"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0531(83)90048-0","volume":"29","author":"R.B. Myerson","year":"1983","unstructured":"Myerson, R.B., Satterthwaite, M.A.: Efficient Mechanisms for Bilateral Trading. Journal of Economic Theory\u00a029, 265\u2013281 (1983)","journal-title":"Journal of Economic Theory"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/3-540-45465-9_74","volume-title":"Automata, Languages and Programming","author":"N. Nisan","year":"2002","unstructured":"Nisan, N.: The Communication Complexity of Approximate Set Packing and Covering. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 868\u2013875. Springer, Heidelberg (2002)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Nisan, N., Segal, I.: The Communication Requirements of Efficient Allocations and Supporting Prices. Journal of Economic Theory (2006)","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013258 (2005)","DOI":"10.1145\/1064009.1064036"},{"key":"9_CR12","unstructured":"Parkes, D.C., Kalagnanam, J., Eso, M.: Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges. In: Proc. of IJCAI, pp. 1161\u20131168 (2001)"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/S0097539793260763","volume":"28","author":"S. Rajagopalan","year":"1998","unstructured":"Rajagopalan, S., Vazirani, V.V.: Primal-Dual RNC Approximation Algorithms for (multi)Set (multi)Cover and Covering Integer Programs. SIAM J. of Computing\u00a028(2), 525\u2013540 (1998)","journal-title":"SIAM J. of Computing"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: New Trade-Offs in Cost-Sharing Mechanisms. Proc. of STOC, 79\u201388 (2006)","DOI":"10.1145\/1132516.1132528"},{"issue":"1-2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T. Sandholm","year":"2002","unstructured":"Sandholm, T.: Algorithm for Optimal Winner Determination in Combinatorial Auctions. Artificial Intelligence\u00a0135(1-2), 1\u201354 (2002)","journal-title":"Artificial Intelligence"},{"key":"9_CR16","unstructured":"Sandholm, T., Suri, S.: Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. In: Proc. of AAAI\/IAAI, pp. 90\u201397 (2000)"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/544741.544760","volume-title":"Proc. of AAMAS","author":"T. Sandholm","year":"2002","unstructured":"Sandholm, T., Suri, S., Gilpin, A., Levine, D.: Winner Determination in Combinatorial Auction Generalizations. In: Proc. of AAMAS, Bologna, Italy, pp. 69\u201376. ACM Press, New York (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79309-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T20:32:30Z","timestamp":1738182750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-79309-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540793083","9783540793090"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79309-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}