{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:14:40Z","timestamp":1725531280924},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642016387"},{"type":"electronic","value":"9783642016394"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-01639-4_17","type":"book-chapter","created":{"date-parts":[[2009,4,20]],"date-time":"2009-04-20T06:12:15Z","timestamp":1240207935000},"page":"195-206","source":"Crossref","is-referenced-by-count":2,"title":["Fast Partial Reallocation in Combinatorial Auctions for Iterative Resource Allocation"],"prefix":"10.1007","author":[{"given":"Naoki","family":"Fukuta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayuki","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1287\/mnsc.1040.0336","volume":"51","author":"T. Sandholm","year":"2005","unstructured":"Sandholm, T., Suri, S., Gilpin, A., Levine, D.: Cabob: A fast optimal algorithm for winner determination in combinatorial auctions. Management Science\u00a051(3), 374\u2013390 (2005)","journal-title":"Management Science"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"McMillan, J.: Selling spectrum rights. The Journal of Economic Perspectives (1994)","DOI":"10.1257\/jep.8.3.145"},{"key":"17_CR3","volume-title":"Combinatorial Auctions","author":"P. Cramton","year":"2006","unstructured":"Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press, Cambridge (2006)"},{"key":"17_CR4","unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: Optimal and approximate approarches. In: Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 548\u2013553 (1999)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D. Lehmann","year":"2002","unstructured":"Lehmann, D., O\u2019Callaghan, L.I., Shoham, Y.: Truth revelation in rapid, approximately efficient combinatorial auctions. Journal of the ACM\u00a049, 577\u2013602 (2002)","journal-title":"Journal of the ACM"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Zurel, E., Nisan, N.: An efficient approximate allocation algorithm for combinatorial auctions. In: Proc. of the Third ACM Conference on Electronic Commerce (EC 2001), pp. 125\u2013136 (2001)","DOI":"10.1145\/501158.501172"},{"key":"17_CR7","unstructured":"Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proc. of the AAAI 2000, pp. 22\u201329 (2000)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Fukuta, N., Ito, T.: Towards better approximation of winner determination for combinatorial auctions with large number of bids. In: Proc. of The 2006 WIC\/IEEE\/ACM International Conference on Intelligent Agent Technology(IAT 2006), pp. 618\u2013621 (2006)","DOI":"10.1109\/IAT.2006.123"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Fukuta, N., Ito, T.: Short-time approximation on combinatorial auctions \u2013 a comparison on approximated winner determination algorithms. In: Proc. of The 3rd International Workshop on Data Engineering Issues in E-Commerce and Services (DEECS 2007), pp. 42\u201355 (June 2007)","DOI":"10.1145\/1278380.1278386"},{"key":"17_CR10","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: The Proc. 6th ACM Conf. on Electronic Commerce (EC 2005) (2005)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Fukuta, N., Ito, T.: Periodical resource allocation using approximated combinatorial auctions. In: Proc. of The 2007 WIC\/IEEE\/ACM International Conference on Intelligent Agent Technology (IAT 2007) (2007)","DOI":"10.1109\/IAT.2007.35"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: Proc. of EC 2000, pp. 66\u201376 (2000)","DOI":"10.1145\/352871.352879"},{"issue":"3","key":"17_CR13","first-page":"284","volume":"15","author":"S. Vries de","year":"2003","unstructured":"de Vries, S., Vohra, R.V.: Combinatorial auctions: A survey. International Transactions in Operational Research\u00a015(3), 284\u2013309 (2003)","journal-title":"International Transactions in Operational Research"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1145\/1109557.1109675","volume-title":"SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm","author":"S. Dobzinski","year":"2006","unstructured":"Dobzinski, S., Schapira, M.: An improved approximation algorithm for combinatorial auctions with submodular bidders. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 1064\u20131073. ACM Press, New York (2006)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 595\u2013604 (2005)","DOI":"10.1109\/SFCS.2005.76"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Guo, Y., Lim, A., Rodrigues, B., Zhu, Y.: A non-exact approach and experiment studies on the combinatorial auction problem. In: Proc. of HICSS 2005, p. 82.1 (2005)","DOI":"10.1109\/HICSS.2005.34"}],"container-title":["Lecture Notes in Computer Science","Agent Computing and Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01639-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T17:53:01Z","timestamp":1684950781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01639-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642016387","9783642016394"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01639-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}