{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:33Z","timestamp":1725487653741},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540733225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73325-6_35","type":"book-chapter","created":{"date-parts":[[2007,7,17]],"date-time":"2007-07-17T04:05:23Z","timestamp":1184645123000},"page":"354-363","source":"Crossref","is-referenced-by-count":5,"title":["Toward a Large Scale E-Market: A Greedy and Local Search Based Winner Determination"],"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":"35_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":"35_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":"35_CR3","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1111\/j.1475-3995.2004.00480.x","volume":"11","author":"R. Epstein","year":"2004","unstructured":"Epstein, R., Henriquez, L., Catalan, J., Weintraub, G.Y., Martinez, C., Espejo, F.: A combinatorial auction improves school meals in chile: A case of or in developing counteries. International Transactions in Operational Research\u00a011, 593\u2013612 (2004)","journal-title":"International Transactions in Operational Research"},{"key":"35_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9780262033428.001.0001","volume-title":"Combinatorial Auctions","author":"P. Cramton","year":"2005","unstructured":"Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press, Cambridge (2005)"},{"key":"35_CR5","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 (IJCAI99), pp. 548\u2013553 (1999)"},{"key":"35_CR6","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":"35_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1145\/501158.501172","volume-title":"Proc. of the Third ACM Conference on Electronic Commerce (EC 2001)","author":"E. Zurel","year":"2001","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. ACM Press, New York (2001)"},{"key":"35_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(IAT2006), pp. 618\u2013621 (2006)","DOI":"10.1109\/IAT.2006.123"},{"issue":"3","key":"35_CR9","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":"35_CR10","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 (2000)","DOI":"10.1145\/352871.352879"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1145\/1109557.1109675","volume-title":"SODA \u201906: 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 \u201906: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 1064\u20131073. ACM Press, New York (2006)"},{"key":"35_CR12","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\u201905), pp. 595\u2013604 (2005)","DOI":"10.1109\/SFCS.2005.76"},{"key":"35_CR13","unstructured":"Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proc. of the AAAI2000 (2000)"},{"key":"35_CR14","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 HICSS2005 (2005)","DOI":"10.1109\/HICSS.2005.34"}],"container-title":["Lecture Notes in Computer Science","New Trends in Applied Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73325-6_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:13:36Z","timestamp":1605762816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73325-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540733225"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73325-6_35","relation":{},"subject":[]}}