{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:41:37Z","timestamp":1743025297271,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319192819"},{"type":"electronic","value":"9783319192826"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19282-6_10","type":"book-chapter","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T07:05:56Z","timestamp":1430291156000},"page":"153-168","source":"Crossref","is-referenced-by-count":0,"title":["Parallelisation and Application of AD 3 as a Method for Solving Large Scale Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Cruz-Mencia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesus","family":"Cerquides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Espinosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Carlos","family":"Moure","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Rodriguez-Aguilar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"IBM ILOG CPLEX Optimizer, \n                      \n                        http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/\n                      \n                      \n                     (last 2010)","key":"10_CR1"},{"unstructured":"Aguiar, P., Xing, E.P., Figueiredo, M., Smith, N.A., Martins, A.: An augmented lagrangian approach to constrained map inference. In: Proceedings of the 28th International Conference on Machine Learning (ICML 2011), pp. 169\u2013176 (2011)","key":"10_CR2"},{"unstructured":"Andersson, A., Tenhunen, M., Ygge, F.: Integer programming for combinatorial auction winner determination. In: Proceedings of the Fourth International Conference on MultiAgent Systems, pp. 39\u201346. IEEE (2000)","key":"10_CR3"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.sorms.2010.07.001","volume":"16","author":"M.O. Ball","year":"2011","unstructured":"Ball, M.O.: Heuristics based on mathematical programming. Surveys in Operations Research and Management Science\u00a016(1), 21\u201338 (2011)","journal-title":"Surveys in Operations Research and Management Science"},{"unstructured":"Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization, 1st edn. Athena Scientific (1997)","key":"10_CR5"},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S. Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends\u00ae in Machine Learning\u00a03(1), 1\u2013122 (2011)","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"doi-asserted-by":"crossref","unstructured":"Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial auctions. MIT Press (2006)","key":"10_CR7","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S. Vries De","year":"2003","unstructured":"De Vries, S., Vohra, R.V.: Combinatorial auctions: A survey. INFORMS Journal on Computing\u00a015(3), 284\u2013309 (2003)","journal-title":"INFORMS Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., Chandra, T.: Efficient projections onto the l 1-ball for learning in high dimensions. In: Proceedings of the 25th International Conference on Machine Learning, pp. 272\u2013279. ACM (2008)","key":"10_CR9","DOI":"10.1145\/1390156.1390191"},{"issue":"1-3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J. Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the douglas?rachford splitting method and the proximal point algorithm for maximal monotone operators. Mathematical Programming\u00a055(1-3), 293\u2013318 (1992)","journal-title":"Mathematical Programming"},{"unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In: International Joint Conferences on Artificial Intelligence (IJCAI), pp. 548\u2013553 (1999)","key":"10_CR11"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D. Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Computers & Mathematics with Applications\u00a02(1), 17\u201340 (1976)","journal-title":"Computers & Mathematics with Applications"},{"unstructured":"Globerson, A., Jaakkola, T.S.: Fixing max-product: Convergent message passing algorithms for map lp-relaxations. In: Advances in Neural Information Processing Systems, pp. 553\u2013560 (2008)","key":"10_CR13"},{"doi-asserted-by":"crossref","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de dirichlet non lin\u00e9aires. ESAIM: Mathematical Modelling and Numerical Analysis-Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique 9(R2), 41\u201376 (1975)","key":"10_CR14","DOI":"10.1051\/m2an\/197509R200411"},{"unstructured":"Gu, Z., Rothberg, E., Bixby, R.: Gurobi 4.0.2. software (December 2010)","key":"10_CR15"},{"issue":"12","key":"10_CR16","doi-asserted-by":"publisher","first-page":"6294","DOI":"10.1109\/TIT.2010.2079014","volume":"56","author":"T. Hazan","year":"2010","unstructured":"Hazan, T., Shashua, A.: Norm-product belief propagation: Primal-dual message-passing for approximate inference. IEEE Transactions on Information Theory\u00a056(12), 6294\u20136316 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"10_CR17","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V. Kolmogorov","year":"2006","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a028(10), 1568\u20131583 (2006)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"doi-asserted-by":"crossref","unstructured":"Komodakis, N., Paragios, N., Tziritas, G.: Mrf optimization via dual decomposition: Message-passing revisited. In: IEEE 11th International Conference on Computer Vision, ICCV 2007, pp. 1\u20138. IEEE (2007)","key":"10_CR18","DOI":"10.1109\/ICCV.2007.4408890"},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1538902.1538906","volume":"56","author":"K. Leyton-Brown","year":"2009","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Empirical hardness models: Methodology and a case study on combinatorial auctions. Journal of the ACM (JACM)\u00a056(4), 22 (2009)","journal-title":"Journal of the ACM (JACM)"},{"doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: Proceedings of the 2nd ACM Conference on Electronic Commerce, pp. 66\u201376. ACM (2000)","key":"10_CR20","DOI":"10.1145\/352871.352879"},{"unstructured":"Martins, A.F.T.: The Geometry of Constrained Structured Prediction: Applications to Inference and Learning of Natural Language Syntax. PhD thesis, Columbia University (2012)","key":"10_CR21"},{"unstructured":"Martins, A.F.T., Figueiredo, M.A.T., Aguiar, P.M.Q., Smith, N.A., Xing, E.P.: Ad3: Alternating directions dual decomposition for map inference in graphical models. Journal of Machine Learning Research\u00a046 (2014) (to appear)","key":"10_CR22"},{"doi-asserted-by":"crossref","unstructured":"Miksik, O., Vineet, V., Perez, P., Torr, P.H.S.: Distributed non-convex admm-inference in large-scale random fields. In: British Machine Vision Conference, BMVC (2014)","key":"10_CR23","DOI":"10.5244\/C.28.4"},{"doi-asserted-by":"crossref","unstructured":"Parsons, S., Rodriguez-Aguilar, J.A., Klein, M.: Auctions and bidding: A guide for computer scientists. ACM Comput. Surv.\u00a043(2), 10:1\u201310:59 (2011)","key":"10_CR24","DOI":"10.1145\/1883612.1883617"},{"issue":"1","key":"10_CR25","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1613\/jair.2751","volume":"35","author":"S.D. Ramchurn","year":"2009","unstructured":"Ramchurn, S.D., Mezzetti, C., Giovannucci, A., Rodriguez-Aguilar, J.A., Dash, R.K., Jennings, N.R.: Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty. Journal of Artificial Intelligence Research\u00a035(1), 119 (2009)","journal-title":"Journal of Artificial Intelligence Research"},{"unstructured":"Ramchurn, S.D., Rogers, A., Macarthur, K., Farinelli, A., Vytelingum, P., Vetsikas, I., Jennings, N.R.: Agent-based coordination technologies in disaster management. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems: Demo Papers, pp. 1651\u20131652 (2008)","key":"10_CR26"},{"doi-asserted-by":"crossref","unstructured":"Roy, A., Mihailovic, I., Zwaenepoel, W.: X-stream: edge-centric graph processing using streaming partitions. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, pp. 472\u2013488. ACM (2013)","key":"10_CR27","DOI":"10.1145\/2517349.2522740"},{"unstructured":"Rush, A.M., Sontag, D., Collins, M., Jaakkola, T.: On dual decomposition and linear programming relaxations for natural language processing. In: Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing, pp. 1\u201311. Association for Computational Linguistics (2010)","key":"10_CR28"},{"unstructured":"Sandholm, T., Suri, S., Gilpin, A., Levine, D.: Cabob: A fast optimal algorithm for combinatorial auctions. In: International Joint Conference on Artificial Intelligence, vol.\u00a017, pp. 1102\u20131108 (2001)","key":"10_CR29"},{"doi-asserted-by":"crossref","unstructured":"Santos Jr., E.: On the generation of alternative explanations with implications for belief revision. In: Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence, pp. 339\u2013347. Morgan Kaufmann Publishers Inc. (1991)","key":"10_CR30","DOI":"10.1016\/B978-1-55860-203-8.50048-6"},{"issue":"4","key":"10_CR31","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1287\/inte.1040.0075","volume":"34","author":"Y. Sheffi","year":"2004","unstructured":"Sheffi, Y.: Combinatorial auctions in the procurement of transportation services. Interfaces\u00a034(4), 245\u2013252 (2004)","journal-title":"Interfaces"},{"key":"10_CR32","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-44631-1_14","volume-title":"Intelligent Agents VII. Agent Theories Architectures and Languages","author":"C. Sierra","year":"2001","unstructured":"Sierra, C., Lopez de Mantaras, R., Busquets, D.: Multiagent bidding mechanisms for robot qualitative navigation. In: Castelfranchi, C., Lesp\u00e9rance, Y. (eds.) ATAL 2000. LNCS (LNAI), vol.\u00a01986, pp. 198\u2013212. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"Smith, D., Eisner, J.: Dependency parsing by belief propagation. In: Proceedings of the Conference on Empirical Conference on Empirical Methods in Natural Language Processing, pp. 145\u2013156 (October 2008)","key":"10_CR33","DOI":"10.3115\/1613715.1613737"},{"unstructured":"Sontag, D., Meltzer, T., Globerson, A., Jaakkola, T.S., Weiss, Y.: Tightening lp relaxations for map using message passing. arXiv preprint arXiv:1206.3288 (2012)","key":"10_CR34"},{"unstructured":"Wainwright, M.J., Jaakkola, T.S., Willsky, A.S.: Tree-reweighted belief propagation algorithms and approximate ml estimation by pseudo-moment matching. In: Workshop on Artificial Intelligence and Statistics, vol.\u00a021, p. 97. Society for Artificial Intelligence and Statistics (2003)","key":"10_CR35"},{"key":"10_CR36","first-page":"1887","volume":"7","author":"C. Yanover","year":"2006","unstructured":"Yanover, C., Meltzer, T., Weiss, Y.: Linear programming relaxations and belief propagation \u2013 an empirical study. J. Mach. Learn. Res.\u00a07, 1887\u20131907 (2006)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19282-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:57:01Z","timestamp":1559156221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19282-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319192819","9783319192826"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19282-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}