{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:59:04Z","timestamp":1794380344321,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642118180","type":"print"},{"value":"9783642118197","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11819-7_18","type":"book-chapter","created":{"date-parts":[[2010,8,16]],"date-time":"2010-08-16T08:04:34Z","timestamp":1281945874000},"page":"233-246","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Winner Approximation for a Series of Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Naoki","family":"Fukuta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takayuki","family":"Ito","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Combinatorial Auctions","author":"P. Cramton","year":"2006","unstructured":"Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. The MIT Press, Cambridge (2006)"},{"issue":"3","key":"18_CR2","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"},{"issue":"3","key":"18_CR3","first-page":"45","volume":"28","author":"T. Sandholm","year":"2007","unstructured":"Sandholm, T.: Expressive commerce and its application to sourcing: How we conducted $35 billion of generalized combinatorial auctions. AI Magazine\u00a028(3), 45\u201358 (2007)","journal-title":"AI Magazine"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"McMillan, J.: Selling spectrum rights. The Journal of Economic Perspectives (1994)","DOI":"10.1257\/jep.8.3.145"},{"key":"18_CR5","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), pp. 434\u2013441 (2007)","DOI":"10.1109\/IAT.2007.35"},{"key":"18_CR6","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":"18_CR7","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":"18_CR8","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":"18_CR9","unstructured":"Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proc. of the Proc. of 17th National Conference on Artificial Intelligence (AAAI 2000), pp. 22\u201329 (2000)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Thomadakis, M.E., Liu, J.C.: On the efficient scheduling of non-periodic tasks in hard real-time systems. In: Proc. of IEEE Real-Time Systems Symp., pp. 148\u2013151 (1999)","DOI":"10.1109\/REAL.1999.818836"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Andrew, L.L., Hanly, S.V., Mukhtar, R.G.: Active queue management for fair resource allocation in wireless networks. IEEE Transactions on Mobile Computing, 231\u2013246 (2008)","DOI":"10.1109\/TMC.2007.70724"},{"issue":"5","key":"18_CR12","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/TPDS.2007.70776","volume":"19","author":"T. Xie","year":"2008","unstructured":"Xie, T., Qin, X.: Security-aware resource allocation for real-time parallel jobs on homogeneous and heterogeneous clusters. IEEE Transactions on Parallel and Distributed Systems\u00a019(5), 682\u2013697 (2008)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"7","key":"18_CR13","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TPDS.2004.15","volume":"15","author":"L. Xiao","year":"2004","unstructured":"Xiao, L., Chen, S., Zhang, X.: Adaptive memory allocations in clusters to handle unexpectedly large data-intensive jobs. IEEE Transactions on Parallel and Distributed Systems\u00a015(7), 577\u2013592 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"18_CR14","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"},{"issue":"1","key":"18_CR15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.3233\/WIA-2009-0154","volume":"7","author":"N. Fukuta","year":"2009","unstructured":"Fukuta, N., Ito, T.: Fine-grained efficient resource allocation using approximated combinatorial auctions\u2013a parallel greedy winner approximation for large-scale problems. Web Intelligence and Agent Systems: An International Journal\u00a07(1), 43\u201363 (2009)","journal-title":"Web Intelligence and Agent Systems: An International Journal"},{"key":"18_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-89674-6_20","volume-title":"Intelligent Agents and Multi-Agent Systems","author":"N. Fukuta","year":"2008","unstructured":"Fukuta, N., Ito, T.: Performance analysis about parallel greedy approximation on combinatorial auctions. In: Bui, T.D., Ho, T.V., Ha, Q.T. (eds.) PRIMA 2008. LNCS (LNAI), vol.\u00a05357, pp. 173\u2013184. Springer, Heidelberg (2008)"},{"key":"18_CR17","unstructured":"Fukuta, N., Ito, T.: Fast partial reallocation in combinatorial auctions for iterative resource allocation. In: Proc. of 10th Pacific Rim International Workshop on Multi-Agents (PRIMA2007), pp. 196\u2013207 (2007)"},{"key":"18_CR18","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 (2007)","DOI":"10.1145\/1278380.1278386"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: Proc. of ACM Conference on Electronic Commerce (EC 2000), pp. 66\u201376 (2000)","DOI":"10.1145\/352871.352879"},{"key":"18_CR20","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\u201354 (2002)","journal-title":"Artificial Intelligence"},{"key":"18_CR21","first-page":"507","volume-title":"Combinatorial Auctions","author":"D. Lehmann","year":"2006","unstructured":"Lehmann, D., M\u00fcller, R., Sandholm, T.: The winner determination problem. In: Cramton, P., Shoham, Y., Steinberg, R. (eds.) Combinatorial Auctions, pp. 507\u2013538. MIT Press, Cambridge (2006)"},{"key":"18_CR22","unstructured":"Boutiler, C., Goldszmidt, M., Sabata, B.: Sequential auctions for the allocation of resources with complementarities. In: Proc. of International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 527\u2013534 (1999)"},{"key":"18_CR23","unstructured":"Koenig, S., Tovey, C., Zheng, X., Sungur, I.: Sequential bundle-bid single-sale auction algorithms for decentralized control. In: Proc. of International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1359\u20131365 (2007)"},{"key":"18_CR24","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)"},{"issue":"3","key":"18_CR25","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":"18_CR26","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1145\/1109557.1109675","volume-title":"Proc. of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (SODA 2006)","author":"S. Dobzinski","year":"2006","unstructured":"Dobzinski, S., Schapira, M.: An improved approximation algorithm for combinatorial auctions with submodular bidders. In: Proc. of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (SODA 2006), pp. 1064\u20131073. ACM Press, New York (2006)"},{"key":"18_CR27","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":"18_CR28","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 the 38th Hawaii International Conference on System Sciences (HICSS 2005), p. 82.1 (2005)","DOI":"10.1109\/HICSS.2005.34"}],"container-title":["Communications in Computer and Information Science","Agents and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11819-7_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T17:30:18Z","timestamp":1685727018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11819-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118180","9783642118197"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11819-7_18","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-11819-7","asserted-by":"object"}]},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}