{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:13:16Z","timestamp":1746245596856,"version":"3.40.4"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319074542"},{"type":"electronic","value":"9783319074559"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07455-9_1","type":"book-chapter","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T08:05:21Z","timestamp":1400573121000},"page":"1-10","source":"Crossref","is-referenced-by-count":1,"title":["Multi-agent Learning for Winner Determination in Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Fu-Shiung","family":"Hsieh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Shiang","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Andersson, A., Tenhunen, M., Ygge, F.: Integer programming for combinatorial auction winner determination. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence, pp. 39\u201346 (2000)"},{"issue":"6","key":"1_CR2","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/TRA.2002.805653","volume":"18","author":"R.W. Beard","year":"2002","unstructured":"Beard, R.W., McLain, T.W., Goodrich, M.A., Anderson, E.P.: Coordinated target assignment and intercept for unmanned air vehicles. IEEE Transactions on Robotics and Automation\u00a018(6), 911\u2013922 (2002)","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"de Vries, S., Vohra, R.V.: Combinatorial Auctions: A Survey. INFORMS Journal on Computing\u00a0(3), 284\u2013309 (2003)","DOI":"10.1287\/ijoc.15.3.284.16077"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Perugini, D., Lambert, D., Sterling, L., Pearce, A.: From Single Static to Multiple Dynamic Combinatorial Auctions. In: IEEE\/WIC\/ACM International Conference on Intelligent Agent Technology, September 19-22, pp. 443\u2013446 (2005)","DOI":"10.1109\/IAT.2005.77"},{"key":"1_CR5","unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In: Sixteenth International Joint Conference on Artificial Intelligence, pp. 548\u2013553 (1999)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L.: Lagrangian relaxation method for solving integer programming problems. Management Science\u00a027, 1\u201318 (1981)","journal-title":"Management Science"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Gonen, R., Lehmann, D.: Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics. In: The Proceedings of the Second ACM Conference on Electronic Commerce (EC 2000), pp. 13\u201320 (2000)","DOI":"10.1145\/352871.352873"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Guo, Y., Lim, A., Rodrigues, B., Tang, J.: Using a Lagrangian heuristic for a combinatorial auction problem. In: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)","DOI":"10.1109\/ICTAI.2005.126"},{"key":"1_CR9","first-page":"39","volume-title":"Nonlinear Assignment Problems: Algorithms and Applications","author":"R.A. Murphey","year":"1999","unstructured":"Murphey, R.A.: Target-based weapon target assignment problems. In: Pardalos, P.M., Pitsoulis, L.S. (eds.) Nonlinear Assignment Problems: Algorithms and Applications, pp. 39\u201353. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"1_CR10","unstructured":"Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence, pp. 22\u201329 (2000)"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.dss.2009.08.009","volume":"48","author":"F.-S. Hsieh","year":"2010","unstructured":"Hsieh, F.-S.: Combinatorial reverse auction based on revelation of Lagrangian multipliers. Decision Support Systems\u00a048(2), 323\u2013330 (2010)","journal-title":"Decision Support Systems"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., Kumar, A., Jha, K., Orlin, J.B.: Exact and heuristic methods for the weapon-target assignment problem. Technical Report #4464-03, MIT, Sloan School of Management Working Papers (2003)","DOI":"10.2139\/ssrn.489802"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0167-9236(02)00004-0","volume":"34","author":"J.L. Jones","year":"2002","unstructured":"Jones, J.L., Koehler, G.J.: Combinatorial auctions using rule-based bids. Decision Support Systems\u00a034, 59\u201374 (2002)","journal-title":"Decision Support Systems"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1287\/mnsc.49.11.1485.20585","volume":"49","author":"A. Peke\u010d","year":"2003","unstructured":"Peke\u010d, A., Rothkopf, M.H.: Combinatorial auction design. Management Science\u00a049, 1485\u20131503 (2003)","journal-title":"Management Science"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"B.T. Polyak","year":"1969","unstructured":"Polyak, B.T.: Minimization of Unsmooth Functionals. USSR Computational Math. and Math. Physics\u00a09, 14\u201329 (1969)","journal-title":"USSR Computational Math. and Math. Physics"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M. Rothkopf","year":"1998","unstructured":"Rothkopf, M., Peke\u010d, A., Harstad, R.: Computationally manageable combinational auctions. Management Science\u00a044, 1131\u20131147 (1998)","journal-title":"Management Science"},{"key":"1_CR17","unstructured":"Sandholm, T.: An algorithm for optimal winner determination in combinatorial auctions. In: Proc. IJCAI 1999, Stockholm, pp. 542\u2013547 (1999)"},{"issue":"1-2","key":"1_CR18","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":"1_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0167-9236(99)00066-4","volume":"28","author":"T. Sandholm","year":"2000","unstructured":"Sandholm, T.: Approaches to winner determination in combinatorial auctions. Decision Support Systems\u00a028, 165\u2013176 (2000)","journal-title":"Decision Support Systems"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-1-4613-0303-9_9","volume-title":"Handbook of Combinatorial Optimization","author":"R.R. Vemuganti","year":"1998","unstructured":"Vemuganti, R.R.: Applications of set covering, set packing and set partitioning models: a survey. In: Du, D.-Z. (ed.) Handbook of Combinatorial Optimization, vol.\u00a01, pp. 573\u2013746. Kluwer Academic Publishers, Netherlands (1998)"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cor.2007.08.001","volume":"36","author":"S. Yanga","year":"2007","unstructured":"Yanga, S., Segrea, A.M., Codenottib, B.: An optimal multiprocessor combinatorial auction solver. Computers & Operations Research\u00a036, 149\u2013166 (2007)","journal-title":"Computers & Operations Research"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ejor.2003.11.018","volume":"164","author":"M. Xia","year":"2005","unstructured":"Xia, M., Stallaert, J., Whinston, A.B.: Solving the combinatorial double auction problem. European Journal of Operational Research\u00a0164, 239\u2013251 (2005)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"1_CR23","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.elerap.2012.02.003","volume":"11","author":"F.-S. Hsieh","year":"2012","unstructured":"Hsieh, F.-S., Lin, J.-B.: Assessing the benefits of group-buying based combinatorial reverse auctions. Electronic Commerce Research and Applications\u00a011(4), 407\u2013419 (2012)","journal-title":"Electronic Commerce Research and Applications"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1007\/s00170-011-3843-z","volume":"62","author":"F.-S. Hsieh","year":"2012","unstructured":"Hsieh, F.-S., Lin, J.-B.: Virtual enterprises partner selection based on reverse auction. International Journal of Advanced Manufacturing Technology\u00a062, 847\u2013859 (2012)","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Gordon, G.J., Varakantham, P.R., Yeoh, W., Lau, H.C., Aravamudhan, A.S., Cheng, S.-F.: Lagrangian relaxation for large-scale multi-agent planning. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2012), vol.\u00a03, pp. 1227\u20131228 (2012)","DOI":"10.1109\/WI-IAT.2012.252"},{"issue":"7","key":"1_CR26","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.artint.2006.12.006","volume":"171","author":"J. Geoffrey","year":"2007","unstructured":"Geoffrey, J.: Gordon, Agendas for multi-agent learning. Artificial Intelligence\u00a0171(7), 392\u2013401 (2007)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TAC.1986.1104206","volume":"31","author":"R. Akella","year":"1986","unstructured":"Akella, R., Kumar, P.R.: Optimal control of production rate in a failure-prone manufacturing systems. IEEE Transactions on Automatic Control\u00a031(2), 116\u2013126 (1986)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"1_CR28","volume-title":"Manufacturing Systems Engineering","author":"S.B. Gershwin","year":"1994","unstructured":"Gershwin, S.B.: Manufacturing Systems Engineering. Prentice-Hall, Englewood Cliffs (1994)"},{"issue":"4","key":"1_CR29","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1080\/05695558308974659","volume":"15","author":"J. Kimemia","year":"1983","unstructured":"Kimemia, J., Gershwin, S.B.: An algorithm for the computer control of a fexible manufacturing system. IIE Transactions\u00a015(4), 353\u2013362 (1983)","journal-title":"IIE Transactions"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01158930","volume":"13","author":"P.R. Kumar","year":"1993","unstructured":"Kumar, P.R.: Re-entrant lines. Queueing Systems: Theory and Applications\u00a013, 87\u2013110 (1993)","journal-title":"Queueing Systems: Theory and Applications"},{"issue":"2","key":"1_CR31","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.cor.2004.06.005","volume":"33","author":"E. Altman","year":"2005","unstructured":"Altman, E., Boulogne, T., El Azouzi, R., Jim\u00e9nez, T., Wynter, L.: A survey on networking games in telecommunications. Computers and Operations Research\u00a033(2), 286\u2013311 (2005)","journal-title":"Computers and Operations Research"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1287\/opre.46.6.776","volume":"46","author":"E. Altman","year":"1998","unstructured":"Altman, E., Shimkin, N.: Individual equilibrium and learning in processor sharing systems. Operations Research\u00a046, 776\u2013784 (1998)","journal-title":"Operations Research"},{"issue":"3","key":"1_CR33","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/9.989076","volume":"47","author":"R. La","year":"2002","unstructured":"La, R., Anantharam, V.: Optimal routing control: Repeated game approach. IEEE Transactions on Automatic Control\u00a047(3), 437\u2013450 (2002)","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"5","key":"1_CR34","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/90.251910","volume":"1","author":"A. Orda","year":"1993","unstructured":"Orda, A., Rom, R., Shimkin, N.: Competitive routing in multi-user communication networks. IEEE\/ACM Trans. Networking\u00a01(5), 510\u2013521 (1993)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"1_CR35","volume-title":"Selish Routing and the Price of Anarchy","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)"}],"container-title":["Lecture Notes in Computer Science","Modern Advances in Applied Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07455-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T23:50:20Z","timestamp":1746229820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07455-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319074542","9783319074559"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07455-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}