{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:57:52Z","timestamp":1757541472525},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,16]],"date-time":"2012-11-16T00:00:00Z","timestamp":1353024000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s10472-012-9323-9","type":"journal-article","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T14:24:20Z","timestamp":1352989460000},"page":"1-30","source":"Crossref","is-referenced-by-count":4,"title":["Proof systems and transformation games"],"prefix":"10.1007","volume":"67","author":[{"given":"Yoram","family":"Bachrach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Zuckerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Wooldridge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey S.","family":"Rosenschein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,16]]},"reference":[{"key":"9323_CR1","volume-title":"Handbook of Game Theory, with Economic Applications, vol. 2","year":"1994","unstructured":"Aumann, R.J., Hart, S. (eds.): Handbook of Game Theory, with Economic Applications, vol. 2. North-Holland, Amsterdam (1994)"},{"issue":"1","key":"9323_CR2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1613\/jair.3166","volume":"40","author":"H Aziz","year":"2011","unstructured":"Aziz, H., Bachrach, Y., Elkind, E., Paterson, M.: False-name manipulations in weighted voting games. J. Artif. Intell. Res. 40(1), 57\u201393 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"9323_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Lachish, O., Paterson, M., Savani, R.: Power indices in spanning connectivity games. In: Algorithmic Aspects in Information and Management, pp. 55\u201367 (2009)","DOI":"10.1007\/978-3-642-02158-9_7"},{"key":"9323_CR4","unstructured":"Aziz, H., Paterson, M.: False name manipulations in weighted voting games: splitting, merging and annexation. In: Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems, pp. 409\u2013416. International Foundation for Autonomous Agents and Multiagent Systems (2009)"},{"key":"9323_CR5","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Walsh, W.E.: Incentive-Compatible, Budget-Balanced, yet Highly Efficient Auctions for Supply Chain Formation. Decision Support Systems (2005)","DOI":"10.1016\/j.dss.2004.08.008"},{"key":"9323_CR6","unstructured":"Bachrach, Y.: Honor among thieves: collusion in multi-unit auctions. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, pp. 617\u2013624. International Foundation for Autonomous Agents and Multiagent Systems (2010)"},{"key":"9323_CR7","unstructured":"Bachrach, Y.: The least-core of threshold network flow games. Math. Found. Comput. Sci. 1, 36\u201347 (2011)"},{"key":"9323_CR8","unstructured":"Bachrach, Y., Elkind, E.: Divide and conquer: false-name manipulations in weighted voting games. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 975\u2013982. International Foundation for Autonomous Agents and Multiagent Systems (2008)"},{"key":"9323_CR9","unstructured":"Bachrach, Y., Elkind, E., Faliszewski, P.: Coalitional voting manipulation: a game-theoretic perspective. In: The 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 49\u201354 (2011)"},{"key":"9323_CR10","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Elkind, E., Meir, R., Pasechnik, D., Zuckerman, M., Rothe, J., Rosenschein, J.S.: The cost of stability in coalitional games. In: Algorithmic Game Theory, pp. 122\u2013134 (2009)","DOI":"10.1007\/978-3-642-04645-2_12"},{"key":"9323_CR11","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Kash, I., Shah, N.: Agent failures in totally balanced games and convex games. In: Proceedings of the 8th Workshop on Internet and Network Economics (2012)","DOI":"10.1007\/978-3-642-35311-6_2"},{"key":"9323_CR12","doi-asserted-by":"crossref","unstructured":"Bachrach Y., Key, P., Zadimoghaddam, M.: Collusion in VCG path procurement auctions. In: Internet and Network Economics, pp. 38\u201349 (2010)","DOI":"10.1007\/978-3-642-17572-5_4"},{"issue":"2","key":"9323_CR13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10458-009-9078-9","volume":"20","author":"Y Bachrach","year":"2010","unstructured":"Bachrach, Y., Markakis, E., Resnick, E., Procaccia, A.D., Rosenschein, J.S., Saberi, A.: Approximating power indices: theoretical and empirical analysis. Journal of Autonomous Agents and Multi-Agent Systems 20(2), 105\u2013122 (2010)","journal-title":"Journal of Autonomous Agents and Multi-Agent Systems"},{"key":"9323_CR14","unstructured":"Bachrach, Y., Meir, R., Feldman, M., Tennenholtz, M.: Solving cooperative reliability games. UAI (2011)"},{"key":"9323_CR15","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Meir, R., Jung, K., Kohli, P.: Coalitional structure generation in skill games. In: Proceedings of the 24th Conference on Artificial Intelligence (AAAI-2010) (2010)","DOI":"10.1609\/aaai.v24i1.7620"},{"key":"9323_CR16","unstructured":"Bachrach, Y., Meir, R., Zuckerman, M., Rothe, J., Rosenschein, J.S.: The cost of stability in weighted voting games. In: Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems, pp. 1289\u20131290. International Foundation for Autonomous Agents and Multiagent Systems (2009)"},{"key":"9323_CR17","unstructured":"Bachrach, Y., Porat, E.: Path disruption games. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, pp. 1123\u20131130. International Foundation for Autonomous Agents and Multiagent Systems (2010)"},{"key":"9323_CR18","unstructured":"Bachrach, Y., Rosenschein, J.S.: Coalitional skill games. In: AAMAS-08 (2008)"},{"issue":"1","key":"9323_CR19","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/s10458-008-9057-6","volume":"18","author":"Y Bachrach","year":"2009","unstructured":"Bachrach, Y., Rosenschein, J.S.: Power in threshold network flow games. Journal of Autonomous Agents and Multi-Agent Systems 18(1), 106\u2013132 (2009)","journal-title":"Journal of Autonomous Agents and Multi-Agent Systems"},{"key":"9323_CR20","unstructured":"Bachrach, Y., Rosenschein, J.S., Porat, E.: Power and stability in connectivity games. In: AAMAS-08 (2008)"},{"key":"9323_CR21","unstructured":"Bachrach, Y., Zuckerman, M., Wooldridge, M., Rosenschein, J.S.: Proof systems and transformation games. Math. Found. Comput. Sci. 1, 78\u201389 (2010)"},{"key":"9323_CR22","first-page":"317","volume":"19","author":"JF Banzhaf","year":"1965","unstructured":"Banzhaf, J.F.: Weighted voting doesn\u2019t work: a mathematical analysis. Rutgers Law Rev. 19, 317\u2013343 (1965)","journal-title":"Rutgers Law Rev."},{"key":"9323_CR23","unstructured":"Cerquides, J., Endriss, U., Giovannucci, A., Rodr\u00edguez-Aguilar, J.A.: Bidding languages and winner determination for mixed multi-unit combinatorial auctions. Institute for Logic, Language and Computation (ILLC), University of Amsterdam (2006)"},{"key":"9323_CR24","first-page":"117","volume-title":"Proceedings of the 3rd International Conference on Embedded Software (EMSOFT) (LNCS vol. 2855)","author":"A Chakrabarti","year":"2003","unstructured":"Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Resource interfaces. In: Proceedings of the 3rd International Conference on Embedded Software (EMSOFT) (LNCS vol. 2855), pp. 117\u2013133. Springer-Verlag, Berlin, Germany (2003)"},{"key":"9323_CR25","doi-asserted-by":"crossref","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational Aspects of Cooperative Game Theory. Morgan & Claypool (2011)","DOI":"10.2200\/S00355ED1V01Y201107AIM016"},{"issue":"3","key":"9323_CR26","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1287\/mnsc.1040.0329","volume":"51","author":"R Chen","year":"2005","unstructured":"Chen, R., Roundy, R., Zhang, R., Janakiraman, G.: Efficient auction mechanisms for supply chain procurement. Manage. Sci. 51(3), 467\u2013482 (2005)","journal-title":"Manage. Sci."},{"key":"9323_CR27","unstructured":"Conitzer, V., Sandholm, T.: Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains. In: Proc. of AAAI-04 (2004)"},{"key":"9323_CR28","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Complexity of determining nonemptiness of the core. In: Proceedings ACM EC-03, pp. 230\u2013231 (2003)","DOI":"10.1145\/779950.779973"},{"key":"9323_CR29","unstructured":"Cormen, T.H.: Introduction to Algorithms. The MIT Press (2001)"},{"key":"9323_CR30","doi-asserted-by":"crossref","unstructured":"de\u00a0Kok, A.G., Graves, S.C.: Information sharing and supply chain coordination. In: Supply Chain Management: Design, Coordination and Operation, p. 341 (2003)","DOI":"10.1016\/S0927-0507(03)11007-9"},{"issue":"2","key":"9323_CR31","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.19.2.257","volume":"19","author":"X Deng","year":"1994","unstructured":"Deng, X., Papadimitriou, C.H.: On the complexity of cooperative solution concepts. Math. Oper. Res. 19(2), 257\u2013266 (1994)","journal-title":"Math. Oper. Res."},{"key":"9323_CR32","doi-asserted-by":"crossref","unstructured":"Denzinger, J., Kronenburg, M.: Planning for distributed theorem proving. In: Proc. KI-96 (LNAI vol. 1137), pp. 43\u201356 (1996)","DOI":"10.1007\/3-540-61708-6_45"},{"issue":"1","key":"9323_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00133625","volume":"32","author":"A Dinar","year":"1992","unstructured":"Dinar, A., Ratner, A., Yaron, D.: Evaluating cooperative game theory in water resources. Theory Decis. 32(1), 1\u201320 (1992)","journal-title":"Theory Decis."},{"issue":"4","key":"9323_CR34","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"RG Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R., Victoria\u00a0University of\u00a0Wellington. Mathematics\u00a0Dept.: Fixed-parameter tractability and completeness I: basic results. SIAM J. Comput. 24(4), 873\u2013921 (1995)","journal-title":"SIAM J. Comput."},{"key":"9323_CR35","unstructured":"Dunne, P.E., van\u00a0der Hoek, W., Kraus, S., Wooldridge, M.: Cooperative boolean games. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1015\u20131022. International Foundation for Autonomous Agents and Multiagent Systems (2008)"},{"key":"9323_CR36","unstructured":"Elkind, E., Goldberg, L., Goldberg, P., Wooldridge, M.: Computational complexity of weighted threshold games. In: AAAI-2007 (2007)"},{"key":"9323_CR37","unstructured":"Engel, Y., Brafman, R., Domshlak, C., Tennenholtz, M.: Planning games. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (2009)"},{"key":"9323_CR38","unstructured":"Ephrati, E., Pollack, M.E., Rosenschein, J.S.: A tractable heuristic that maximizes global utility through local plan combination. In: The 1st International Conference on Multiagent Systems, pp. 94\u2013101. San Francisco, California (1995)"},{"key":"9323_CR39","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/A:1018924209812","volume":"20","author":"E Ephrati","year":"1997","unstructured":"Ephrati, E., Rosenschein, J.S.: A heuristic technique for multiagent planning. Ann. Math. Artif. Intell. 20, 13\u201367. Spring (1997)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9323_CR40","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Hemaspaandra, L.: The complexity of power-index comparison. In: Algorithmic Aspects in Information and Management, pp. 177\u2013187 (2008)","DOI":"10.1007\/978-3-540-68880-8_18"},{"key":"9323_CR41","volume-title":"Multi-Agent Rationality MAAMAW-97","author":"M Fisher","year":"1997","unstructured":"Fisher, M., Wooldridge, M.: Distributed problem-solving as concurrent theorem proving. In: Multi-Agent Rationality MAAMAW-97. Springer-Verlag, Berlin, Germany (1997)"},{"key":"9323_CR42","doi-asserted-by":"crossref","unstructured":"Gabarro, J., Garcia, A., Clint, M., Kilpatrick, P., Stewart, A.: Bounded site failures: an approach to unreliable grid environments. In: Making Grids Work, pp. 175\u2013187 (2008)","DOI":"10.1007\/978-0-387-78448-9_14"},{"key":"9323_CR43","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)"},{"key":"9323_CR44","volume-title":"Logical Foundations of Artificial Intelligence","author":"MR Genesereth","year":"1987","unstructured":"Genesereth, M.R., Nilsson, N.: Logical Foundations of Artificial Intelligence. Morgan Kaufmann Publishers, San Mateo, CA (1987)"},{"key":"9323_CR45","volume-title":"Automated Planning: Theory and Practice","author":"M Ghallab","year":"2004","unstructured":"Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann Publishers, San Mateo, CA (2004)"},{"key":"9323_CR46","unstructured":"Gillies, D.B.: Some theorems on n-person games. PhD thesis, Princeton University (1953)"},{"key":"9323_CR47","doi-asserted-by":"crossref","unstructured":"Giovannucci, A., Rodriguez-Aguilar, J.A., Cerquides, J., Endriss, U.: Winner determination for mixed multi-unit combinatorial auctions via petri nets. In: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, p. 104. ACM (2007)","DOI":"10.1145\/1329125.1329253"},{"issue":"1","key":"9323_CR48","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/1345037.1345052","volume":"7","author":"A Giovannucci","year":"2007","unstructured":"Giovannucci, A., Rodriguez-Aguilar, J.A., Vinyals, M., Cerquides, J., Endriss, U.: Mixed multi-unit combinatorial auctions for supply chain management. ACM SIGecom Exchanges 7(1), 58\u201360 (2007)","journal-title":"ACM SIGecom Exchanges"},{"key":"9323_CR49","doi-asserted-by":"crossref","unstructured":"Giovannucci, A., Vinyals, M., Rodriguez-Aguilar, J.A., Cerquides, J.: Computationally-efficient winner determination for mixed multi-unit combinatorial auctions. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1071\u20131078. International Foundation for Autonomous Agents and Multiagent Systems (2008)","DOI":"10.1145\/1329125.1329253"},{"issue":"1","key":"9323_CR50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comp. Sci. 50(1), 1\u2013102 (1987)","journal-title":"Theor. Comp. Sci."},{"issue":"1","key":"9323_CR51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584227","volume":"21","author":"D Granot","year":"1981","unstructured":"Granot, D., Huberman, G.: Minimum cost spanning tree games. Math. Program. 21(1), 1\u201318 (1981)","journal-title":"Math. Program."},{"key":"9323_CR52","unstructured":"Harrenstein, P., van\u00a0der Hoek, W., Meyer, J.J., Witteveen, C.: Boolean games. In: Proceedings of the 8th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 287\u2013298. Morgan Kaufmann Publishers Inc. (2001)"},{"key":"9323_CR53","unstructured":"Lenat, D.B.: BEINGS: knowledge as interacting experts. In: IJCAI-75, pp. 126\u2013133 (1975)"},{"issue":"8","key":"9323_CR54","doi-asserted-by":"crossref","first-page":"1467","DOI":"10.1287\/mnsc.1070.0851","volume":"54","author":"L Li","year":"2008","unstructured":"Li, L., Zhang, H.: Confidentiality and information sharing in supply chain coordination. Manage. Sci. 54(8), 1467\u20131481 (2008)","journal-title":"Manage. Sci."},{"issue":"1\u20132","key":"9323_CR55","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0304-3975(00)00251-6","volume":"263","author":"Y Matsui","year":"2001","unstructured":"Matsui, Y., Matsui, T.: NP-completeness for calculating power indices of weighted majority games. Theor. Comp. Sci. 263(1\u20132), 305\u2013310 (2001)","journal-title":"Theor. Comp. Sci."},{"key":"9323_CR56","doi-asserted-by":"crossref","unstructured":"Meir, R., Bachrach, Y., Rosenschein, J.: Minimal subsidies in expense sharing games. In: Algorithmic Game Theory, pp. 347\u2013358 (2010)","DOI":"10.1007\/978-3-642-16170-4_30"},{"key":"9323_CR57","unstructured":"Meir, R., Rosenschein, J.S., Malizia, E.: Subsidies, stability, and restricted cooperation in coalitional games. In: Proc. of 22nd IJCAI (2011)"},{"key":"9323_CR58","doi-asserted-by":"crossref","unstructured":"Meir, R., Tennenholtz, M., Bachrach, Y., Key, P.: Congestion games with agent failures. In: 26th AAAI Conference on Artificial Intelligence (2012)","DOI":"10.1609\/aaai.v26i1.8244"},{"key":"9323_CR59","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press (1994)"},{"issue":"3","key":"9323_CR60","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1257\/aer.98.3.897","volume":"98","author":"M Ostrovsky","year":"2008","unstructured":"Ostrovsky, M.: Stability in supply chain networks. Am. Econ. Rev. 98(3), 897\u2013923 (2008)","journal-title":"Am. Econ. Rev."},{"issue":"4","key":"9323_CR61","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1002\/nav.3800220409","volume":"22","author":"G Owen","year":"1975","unstructured":"Owen, G.: Multilinear extensions and the Banzhaf Value. Nav. Res. Logist. Q. 22(4), 741\u2013750 (1975)","journal-title":"Nav. Res. Logist. Q."},{"key":"9323_CR62","volume-title":"Introduction to the Theory of Cooperative Games","author":"B Peleg","year":"2002","unstructured":"Peleg, B., Sudholter, P.: Introduction to the Theory of Cooperative Games, 2nd edn. Springer-Verlag, Berlin, Germany (2002)","edition":"2"},{"key":"9323_CR63","doi-asserted-by":"crossref","unstructured":"Penn, M., Polukarov, M., Tennenholtz, M.: Congestion games with failures. In: Proceedings of the 6th ACM Conference on Electronic Commerce, pp. 259\u2013268. ACM (2005)","DOI":"10.1145\/1064009.1064037"},{"issue":"1","key":"9323_CR64","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.geb.2009.03.004","volume":"67","author":"M Penn","year":"2009","unstructured":"Penn, M., Polukarov, M., Tennenholtz, M.: Congestion games with load-dependent failures: identical resources. Games. Econom. Behav. 67(1), 156\u2013173 (2009)","journal-title":"Games. Econom. Behav."},{"issue":"9","key":"9323_CR65","first-page":"1727","volume":"42","author":"LD Qiu","year":"1998","unstructured":"Qiu, L.D., Tao, Z.: Policy on international r&d cooperation: subsidy or tax? Eur. Econ. Rev. 42(9), 1727\u20131750 (1998)","journal-title":"Econ. Rev."},{"key":"9323_CR66","unstructured":"Resnick, E., Bachrach, Y., Meir, R., Rosenschein, J.: The cost of stability in network flow games. Math. Found. Comput. Sci. 1, 636\u2013650 (2009)"},{"issue":"6","key":"9323_CR67","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D Schmeidler","year":"1969","unstructured":"Schmeidler, D.: The nucleolus of a characteristic function game. SIAM J. Appl. Math. 17(6), 1163\u20131170 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"9323_CR68","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: A value for n-person games. In: Contrib. to the Theory of Games, pp. 31\u201340 (1953)","DOI":"10.1017\/CBO9780511528446.003"},{"key":"9323_CR69","doi-asserted-by":"crossref","first-page":"787","DOI":"10.2307\/1951053","volume":"48","author":"LS Shapley","year":"1954","unstructured":"Shapley, L.S., Shubik, M.: A method for evaluating the distribution of power in a committee system. Am. Polit. Sci. Rev. 48, 787\u2013792 (1954)","journal-title":"Am. Polit. Sci. Rev."},{"issue":"4","key":"9323_CR70","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.tre.2004.07.001","volume":"41","author":"JB Sheu","year":"2005","unstructured":"Sheu, J.B., Chou, Y.H., Hu, C.C.: An integrated logistics operational model for green-supply chain management. Transp. Res., Part E Logist. Trans. Rev. 41(4), 287\u2013313 (2005)","journal-title":"Transp. Res., Part E Logist. Trans. Rev."},{"key":"9323_CR71","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511811654","volume-title":"Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations","author":"Y Shoham","year":"2008","unstructured":"Shoham, Y., Leyton-Brown, K.: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press, Cambridge, England (2008)"},{"key":"9323_CR72","unstructured":"Shrot, T., Aumann, Y., Kraus, S.: On agent types in coalition formation problems. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, pp. 757\u2013764. International Foundation for Autonomous Agents and Multiagent Systems (2010)"},{"issue":"3","key":"9323_CR73","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1108\/14637150210428989","volume":"8","author":"TM Simatupang","year":"2002","unstructured":"Simatupang, T.M., Wright, A.C., Sridharan, R.: The knowledge of coordination for supply chain integration. Bus. Process. Manag. J. 8(3), 289\u2013308 (2002)","journal-title":"Bus. Process. Manag. J."},{"issue":"2","key":"9323_CR74","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"SP Vadhan","year":"2002","unstructured":"Vadhan, S.P.: The complexity of counting in sparse, regular, and planar graphs. SIAM J. Comput. 31(2), 398\u2013427 (2002)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9323_CR75","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s001860200222","volume":"56","author":"M Voorneveld","year":"2002","unstructured":"Voorneveld, M., Grahn, S.: Cost allocation in shortest path games. Math. Method Oper. Res. 56(2), 323\u2013340 (2002)","journal-title":"Math. Method Oper. Res."},{"key":"9323_CR76","unstructured":"Wagman, L., Conitzer, V.: Optimal false-name-proof voting rules with costly voting. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 190\u2013195 (2008)"},{"issue":"10","key":"9323_CR77","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1016\/j.artint.2006.03.003","volume":"170","author":"M Wooldridge","year":"2006","unstructured":"Wooldridge, M., Dunne, P.E.: On the computational complexity of coalitional resource games. Artif. Intell. 170(10), 853\u2013871 (2006)","journal-title":"Artif. Intell."},{"key":"9323_CR78","doi-asserted-by":"crossref","unstructured":"Yokoo, M., Conitzer, V., Sandholm, T., Ohta, N., Iwasaki, A.: Coalitional games in open anonymous environments. In: IJCAI-05 (2005)","DOI":"10.1007\/11780496_6"},{"key":"9323_CR79","unstructured":"Zuckerman, M., Faliszewski, P., Bachrach, Y., Elkind, E.: Manipulating the quota in weighted voting games. In: The 23rd National Conference on Artificial Intelligence (AAAI-2008) (2008)"},{"key":"9323_CR80","doi-asserted-by":"crossref","unstructured":"Zuckerman, M., Faliszewski, P., Conitzer, V., Rosenschein, J.: An NTU cooperative game theoretic view of manipulating elections. In: Internet and Network Economics, pp. 363\u2013374 (2011)","DOI":"10.1007\/978-3-642-25510-6_31"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-012-9323-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-012-9323-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-012-9323-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T20:19:20Z","timestamp":1687810760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-012-9323-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,16]]},"references-count":80,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9323"],"URL":"https:\/\/doi.org\/10.1007\/s10472-012-9323-9","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,16]]}}}