{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T11:11:43Z","timestamp":1691752303634},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2015,6,13]],"date-time":"2015-06-13T00:00:00Z","timestamp":1434153600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10472-015-9462-x","type":"journal-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T03:13:49Z","timestamp":1434078829000},"page":"335-359","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computational social choice for coordination in agent networks"],"prefix":"10.1007","volume":"77","author":[{"given":"Anisse","family":"Ismaili","sequence":"first","affiliation":[]},{"given":"Patrice","family":"Perny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,13]]},"reference":[{"key":"9462_CR1","unstructured":"Arrow, K.J., Sen, A.K., Suzumura, K., (eds.): Handbook of Social Choice and Welfare, vol. 2. Elsevier (2012)"},{"key":"9462_CR2","doi-asserted-by":"publisher","unstructured":"Ausiello, G.: Complexity and approximation: Combinatorial optimization problems and their approximability properties. Springer Science & Business Media (1999)","DOI":"10.1007\/978-3-642-58412-1"},{"key":"9462_CR3","unstructured":"Bacchus, F., Grove, A.: Graphical models for preference and utility. In: Proceedings of the Eleventh conference on Uncertainty in artificial intelligence, pp. 3\u201310. Morgan Kaufmann Publishers Inc. (1995)"},{"key":"9462_CR4","unstructured":"Bertele, U., Brioschi, F.: Nonserial dynamic programming. Academic Press Inc. (1972)"},{"issue":"1-2","key":"9462_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1-2), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"9462_CR6","unstructured":"Braziunas, D., Boutilier, C.: Local utility elicitation in GAI models. In: Proceedings of the Twenty-first Conference on Uncertainty in Artificial Intelligence (UAI-05), pp. 42\u201349 (2005)"},{"key":"9462_CR7","doi-asserted-by":"crossref","unstructured":"Chapman, A.C., Farinelli, A., Munoz, E., Cote, de, Rogers, A., Jennings, N.R.: A distributed algorithm for optimising over pure strategy Nash equilibria. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7610"},{"key":"9462_CR8","doi-asserted-by":"publisher","unstructured":"Daskalakis, C., Papadimitriou, C.H.: Computing pure Nash equilibria in graphical games via Markov random fields. In: ACM-EC, pp. 91\u201399 (2006)","DOI":"10.1145\/1134707.1134718"},{"issue":"3","key":"9462_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artif. Intell. 38(3), 353\u2013366 (1989)","journal-title":"Artif. Intell."},{"issue":"4","key":"9462_CR10","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1137\/080724514","volume":"39","author":"I Diakonikolas","year":"2009","unstructured":"Diakonikolas, I., Yannakakis, M.: Small approximate pareto sets for biobjective shortest paths and other problems. SIAM J. Comput. 39(4), 1340\u20131371 (2009)","journal-title":"SIAM J. Comput."},{"key":"9462_CR11","doi-asserted-by":"crossref","unstructured":"Elkind, E., Goldberg, L.A., Goldberg, P.W.: Computing good Nash equilibria in graphical games (2007)","DOI":"10.1145\/1250910.1250935"},{"key":"9462_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.2307\/2525541","volume":"8","author":"PC Fishburn","year":"1967","unstructured":"Fishburn, P.C.: Interdependence and additivity in multivariate, unidimensional expected utility theory. Int. Econ. Rev. 8, 335\u2013342 (1967)","journal-title":"Int. Econ. Rev."},{"key":"9462_CR13","doi-asserted-by":"crossref","unstructured":"Gao, Y.: Treewidth of Erdos-r\u00e9nyi random graphs, random intersection graphs, and scale-free random graphs. Discrete Applied Mathematics (2011)","DOI":"10.1016\/j.dam.2011.10.013"},{"key":"9462_CR14","first-page":"3","volume":"33","author":"C Gonzales","year":"2008","unstructured":"Gonzales, C., Perny, P., Queiroz, S.: GAI-networks: optimization, ranking and collective choice in combinatorial domains. Found. Comput. Decis. Sci. 33, 3\u201324 (2008)","journal-title":"Found. Comput. Decis. Sci."},{"key":"9462_CR15","unstructured":"Inc. Gurobi Optimization. Gurobi optimizer reference manual (2015)"},{"key":"9462_CR16","unstructured":"Ismaili, A., Bampis, E., Maudet, N., Perny, P.: A study on the stability and efficiency of graphical games with unbounded treewidth. In: proceedings of AAMAS (2013)"},{"key":"9462_CR17","doi-asserted-by":"publisher","unstructured":"Jensen, F., Jensen, F.V., Dittmer, S.L.: From influence diagrams to junction trees. In: Proceedings of the Tenth international conference on Uncertainty in artificial intelligence, pp. 367\u2013373. Morgan Kaufmann Publishers Inc. (1994)","DOI":"10.1016\/B978-1-55860-332-5.50051-1"},{"key":"9462_CR18","unstructured":"Jiang, A.X., Safari, M.A.: Pure Nash equilibria: complete characterization of hard and easy graphical games. In: AAMAS, pp. 199\u2013206 (2010)"},{"key":"9462_CR19","doi-asserted-by":"publisher","unstructured":"Kearns, M.: Graphical games. In: Algorithmic Game Theory. Cambridge University Press, Cambridge, UK (2007)","DOI":"10.1017\/CBO9780511800481.009"},{"key":"9462_CR20","unstructured":"Kearns, M.J., Littman, M.L., Singh, S.P.: Graphical models for game theory. In: UAI (2001)"},{"key":"9462_CR21","doi-asserted-by":"publisher","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: STACS 99, pp. 404\u2013413. Springer (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9462_CR22","unstructured":"Kwisthout, J., Bodlaender, H.L., Gaag, L.C.V.D.: The necessity of bounded treewidth for efficient inference in bayesian networks. In: ECAI, vol. 215, pp. 237\u2013242 (2010)"},{"key":"9462_CR23","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.dam.2012.07.007","volume":"161","author":"J Lesca","year":"2013","unstructured":"Lesca, J., Minoux, M., Perny, P.: Compact versus Noncompact LP Formulations for minimizing Convex Choquet Integrals. Discret. Appl. Math. 161, 184\u2013199 (2013)","journal-title":"Discret. Appl. Math."},{"key":"9462_CR24","unstructured":"Lesca, J., Perny, P.: LP Solvable Models for Multiagent Fair Allocation problems. In: European Conference on Artificial Intelligence, pp. 387\u2013392 (2010)"},{"issue":"1\u20132","key":"9462_CR25","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0004-3702(99)00062-4","volume":"113","author":"AL Madsen","year":"1999","unstructured":"Madsen, A.L., propagation, F.V., Jensen, LAZY: A junction tree inference algorithm based on lazy inference. Artif. Intell. 113(1\u20132), 203\u2013245 (1999)","journal-title":"Artif. Intell."},{"key":"9462_CR26","unstructured":"Michel, G., Jean-Luc, M., Radko, M., Endre, P.: Aggregation Functions. Cambridge University Press (2009)"},{"key":"9462_CR27","unstructured":"Moulin, H.: Axioms of Cooperative Decision Making. Cambridge University Press (1991)"},{"issue":"3","key":"9462_CR28","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1287\/opre.16.3.682","volume":"16","author":"GM Katta","year":"1968","unstructured":"Katta, G.M.: An algorithm for ranking all the assignments in order of increasing cost. Oper. Res. 16(3), 682\u2013687 (1968)","journal-title":"Oper. Res."},{"issue":"2","key":"9462_CR29","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1008990218483","volume":"8","author":"D Nilsson","year":"1998","unstructured":"Nilsson, D.: An efficient algorithm for finding the M most probable configurations in probabilistic expert systems. Stat. Comput. 8(2), 159\u2013173 (1998)","journal-title":"Stat. Comput."},{"issue":"1","key":"9462_CR30","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/S0377-2217(02)00399-5","volume":"148","author":"W Ogryczak","year":"2003","unstructured":"Ogryczak, W., Sliwinski, T.: On solving linear programs with the ordered weighted averaging objective. Eur. J. Oper. Res. 148(1), 80\u201391 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9462_CR31","volume-title":"Inequalities: Theory of majorization and its applications","author":"I Olkin","year":"1979","unstructured":"Olkin, I., Marshall, A.W.: Inequalities: Theory of majorization and its applications. Academic, New York (1979)"},{"key":"9462_CR32","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on, pp. 86\u201392. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"9462_CR33","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Routing games. Algorithmic Game Theory, 18 (2007)","DOI":"10.1017\/CBO9780511800481.020"},{"issue":"2","key":"9462_CR34","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing J. ACM (JACM) 49(2), 236\u2013259 (2002)","journal-title":"J. ACM (JACM)"},{"key":"9462_CR35","unstructured":"Salehi-Abari, A., Boutilier, C.: Empathetic social choice on social networks. In: Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, pages 693\u2013700. International Foundation for Autonomous Agents and Multiagent Systems (2014)"},{"issue":"3","key":"9462_CR36","doi-asserted-by":"publisher","first-page":"571","DOI":"10.2307\/1911053","volume":"57","author":"D Schmeidler","year":"1989","unstructured":"Schmeidler, D.: Subjective probability and expected utility without additivity. Econometrica 57(3), 571\u2013587 (1989)","journal-title":"Econometrica"},{"key":"9462_CR37","doi-asserted-by":"crossref","unstructured":"Sen, A.K.: Social Choice Theory, vol. 3, pp. 1073\u20131181. Elsevier (1986)","DOI":"10.1016\/S1573-4382(86)03004-7"},{"key":"9462_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2307\/2554117","volume":"50","author":"AF Shorrocks","year":"1983","unstructured":"Shorrocks, A.F.: Ranking income distributions. Economica 50, 3\u201317 (1983)","journal-title":"Economica"},{"key":"9462_CR39","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/0165-4896(81)90018-4","volume":"1","author":"JA Weymark","year":"1981","unstructured":"Weymark, J.A.: Generalized Gini inequality indices. Math. Soc. Sci. 1, 409\u2013430 (1981)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"9462_CR40","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/21.87068","volume":"18","author":"RR Yager","year":"1988","unstructured":"Yager, R.R.: On ordered weighted averaging aggregation operators in multicriteria decisionmaking. IEEE Trans. Syst. Man Cybern. 18(1), 183\u2013190 (1988)","journal-title":"IEEE Trans. Syst. Man Cybern."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9462-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-015-9462-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9462-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T10:51:53Z","timestamp":1691751113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-015-9462-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,13]]},"references-count":40,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9462"],"URL":"https:\/\/doi.org\/10.1007\/s10472-015-9462-x","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,13]]}}}