{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:10:47Z","timestamp":1767237047190},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,7,19]],"date-time":"2008-07-19T00:00:00Z","timestamp":1216425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10458-008-9057-6","type":"journal-article","created":{"date-parts":[[2008,7,18]],"date-time":"2008-07-18T00:39:07Z","timestamp":1216341547000},"page":"106-132","source":"Crossref","is-referenced-by-count":26,"title":["Power in threshold network flow games"],"prefix":"10.1007","volume":"18","author":[{"given":"Yoram","family":"Bachrach","sequence":"first","affiliation":[]},{"given":"Jeffrey S.","family":"Rosenschein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,7,19]]},"reference":[{"key":"9057_CR1","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., & Rosenschein, J. S. (2007). Computing the Banzhaf power index in network flow games. In The 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007) (pp. 323\u2013329). Honolulu: Hawaii.","DOI":"10.1145\/1329125.1329433"},{"key":"9057_CR2","first-page":"317","volume":"19","author":"J.F. Banzhaf","year":"1965","unstructured":"Banzhaf J.F. (1965). Weighted voting doesn\u2019t work: A mathematical analysis. Rutgers Law Review 19: 317\u2013343","journal-title":"Rutgers Law Review"},{"key":"9057_CR3","doi-asserted-by":"crossref","unstructured":"Bilbao, J. M. (2000). Cooperative games on combinatorial structures. Kluwer Publishers.","DOI":"10.1007\/978-1-4615-4393-0"},{"key":"9057_CR4","doi-asserted-by":"crossref","unstructured":"Bilbao, J. M., Fernandez, J. R., Jimenez Losada, A., & Lopez, J. J. (2000). Generating functions for computing power indices efficiently. TOP (pp. 191\u2013213).","DOI":"10.1007\/BF02628555"},{"key":"9057_CR5","doi-asserted-by":"crossref","unstructured":"Conitzer, V., & Sandholm, T. (2003). Complexity of determining nonemptiness of the core. In Proceedings ACM EC-03 (pp. 230\u2013231).","DOI":"10.1145\/779928.779973"},{"key":"9057_CR6","unstructured":"Conitzer, V., & Sandholm, T. (2004). Computing shapley values, manipulating value division schemes, and checking core membership in multi-issue domains. In Proceedings of the AAAI-04."},{"issue":"2","key":"9057_CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.19.2.257","volume":"19","author":"X. Deng","year":"1994","unstructured":"Deng X. and Papadimitriou C.H. (1994). On the complexity of cooperative solution concepts. Mathematics of Operations Research 19(2): 257\u2013266","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"9057_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/moor.4.2.99","volume":"4","author":"P. Dubey","year":"1979","unstructured":"Dubey P. and Shapley L. (1979). Mathematical properties of the Banzhaf power index. Mathematics of Operations Research 4(2): 99\u2013131","journal-title":"Mathematics of Operations Research"},{"key":"9057_CR9","unstructured":"Ephrati, E., & Rosenschein, J. S. (1991). The Clarke Tax as a consensus mechanism among automated agents. In Proceedings of the Ninth National Conference on Artificial Intelligence (pp. 173\u2013178). California: Anaheim."},{"key":"9057_CR10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/A:1018924209812","volume":"20","author":"E. Ephrati","year":"1997","unstructured":"Ephrati E. and Rosenschein J.S. (1997). A heuristic technique for multiagent planning. Annals of Mathematics and Artificial Intelligence 20: 13\u201367","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9057_CR11","doi-asserted-by":"crossref","unstructured":"Fatima, S. S., Wooldridge, M., & Jennings, N. R. (2007). A randomized method for the Shapley value for the voting game. In The 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007) (pp. 955\u2013962). Hawaii: Honolulu.","DOI":"10.1145\/1329125.1329316"},{"key":"9057_CR12","volume-title":"Flows in networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"Ford L.R. Jr., and Fulkerson D.R. (1962). Flows in networks. Princeton University Press, Princeton"},{"key":"9057_CR13","unstructured":"Fortune, S., Hopcroft, J., & Wyllie, J. (1980). The directed subgraph homeomorphism problem. TCS: Theoretical Computer Science, 10."},{"key":"9057_CR14","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. Freeman Press."},{"key":"9057_CR15","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Mundhe, M., Hernandez, K., & Sen, S. (1999). Voting for movies: The anatomy of a recommender system. In Proceedings of the 3rd Annual Conference on Autonomous Agents (pp. 434\u2013435).","DOI":"10.1145\/301136.301303"},{"key":"9057_CR16","unstructured":"Gillies, D. B. (1953). Some theorems on n-person games. PhD thesis, Princeton University."},{"key":"9057_CR17","doi-asserted-by":"crossref","unstructured":"Haynes, T., Sen, S., Arora, N., & Nadella, R. (1997). An automated meeting scheduling system that utilizes user preferences. In Proceedings of the 1st International Conference on Autonomous Agents (pp. 308\u2013315).","DOI":"10.1145\/267658.267733"},{"key":"9057_CR18","unstructured":"Hemaspaandra, E., Hemaspaandra, L., & Rothe, J. (2005). Anyone but him: The complexity of precluding an alternative. In Proceedings of the 20th National Conference on Artificial Intelligence. Pittsburgh."},{"key":"9057_CR19","unstructured":"Kalai, E., & Zemel, E. (1980). On totally balanced games and games of flow. Discussion Papers 413, Northwestern University, Center for Mathematical Studies in Economics and Management Science, January 1980. http:\/\/ideas.repec.org\/p\/nwu\/cmsems\/413.html ."},{"key":"9057_CR20","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1287\/opre.30.5.998","volume":"30","author":"E. Kalai","year":"1982","unstructured":"Kalai E. and Zemel E. (1982). Generalized network problems yielding totally balanced games. Operations Research 30: 998\u20131008","journal-title":"Operations Research"},{"key":"9057_CR21","unstructured":"Laruelle, A. (1999). On the choice of a power index. Papers 99-10, Valencia\u2014Instituto de Investigaciones Economicas."},{"issue":"1\u20134","key":"9057_CR22","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1023\/A:1016324824094","volume":"109","author":"D. Leech","year":"2002","unstructured":"Leech D. (2002). Voting power in the governance of the international monetary fund. Annals of Operations Research 109(1\u20134): 375\u2013397","journal-title":"Annals of Operations Research"},{"issue":"6","key":"9057_CR23","first-page":"831","volume":"49","author":"D. Leech","year":"2003","unstructured":"Leech D. (2003). Computing power indices for large voting games. Journal of Management Science 49(6): 831\u2013837","journal-title":"Journal of Management Science"},{"issue":"3","key":"9057_CR24","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s003550100137","volume":"18","author":"M. Machover","year":"2001","unstructured":"Machover M. and Felsenthal D.S. (2001). The treaty of nice and qualified majority voting. Social Choice and Welfare 18(3): 431\u2013464","journal-title":"Social Choice and Welfare"},{"key":"9057_CR25","unstructured":"Mann, I., & Shapley, L. S. (1960). Values of large games, iv: Evaluating the electoral college by Monte-Carlo techniques. Technical report, The Rand Corporation, Santa Monica, CA."},{"key":"9057_CR26","unstructured":"Mann, I., & Shapley, L. S. (1962). Values of large games, VI: Evaluating the electoral college exactly. Technical report, The Rand Corporation, Santa Monica, CA."},{"key":"9057_CR27","first-page":"71","volume":"43","author":"Y. Matsui","year":"2000","unstructured":"Matsui Y. and Matsui T. (2000). A survey of algorithms for calculating power indices of weighted majority games. Journal of the Operations Research Society of Japan 43: 71\u201386","journal-title":"Journal of the Operations Research Society of Japan"},{"issue":"1\u20132","key":"9057_CR28","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. and Matsui T. (2001). NP-completeness for calculating power indices of weighted majority games. Theoretical Computer Science 263(1\u20132): 305\u2013310","journal-title":"Theoretical Computer Science"},{"key":"9057_CR29","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan N. and Ronen A. (2001). Algorithmic mechanism design. Games and Economic Behavior 35: 166\u2013196","journal-title":"Games and Economic Behavior"},{"key":"9057_CR30","volume-title":"A course in game theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne M.J. and Rubenstein A. (1994). A course in game theory. The MIT Press, Cambridge, Massachusetts"},{"issue":"4","key":"9057_CR31","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1002\/nav.3800220409","volume":"22","author":"G. Owen","year":"1975","unstructured":"Owen G. (1975). Multilinear extensions and the Banzhaf value. Naval Research Logistics Quarterly 22(4): 741\u2013750","journal-title":"Naval Research Logistics Quarterly"},{"key":"9057_CR32","doi-asserted-by":"crossref","unstructured":"Procaccia, A. D., & Rosenschein, J. S. (2006). Junta distributions and the average-case complexity of manipulating elections. In The 5th International Joint Conference on Autonomous Agents and Multiagent Systems (pp. 497\u2013504). Hakodate, Japan.","DOI":"10.1145\/1160633.1160726"},{"key":"9057_CR33","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J.S. Provan","year":"1983","unstructured":"Provan J.S. and Ball M.O. (1983). The complexity of counting cuts and of computing the probability that a graph is connected. SICOMP: SIAM Journal on Computing 12: 777\u2013788","journal-title":"SICOMP: SIAM Journal on Computing"},{"key":"9057_CR34","unstructured":"Rosenschein, J. S., & Genesereth, M. R. (1985). Deals among rational agents. In Proceedings of the 9th International Joint Conference on Artificial Intelligence (pp. 91\u201399). Los Angeles, California."},{"key":"9057_CR35","doi-asserted-by":"crossref","unstructured":"Roughgarden, T. (2001). Designing networks for selfish users is hard. In FOCS (pp. 472\u2013481).","DOI":"10.1109\/SFCS.2001.959923"},{"key":"9057_CR36","unstructured":"Sandholm, T., & Lesser, V. (1995). Issues in automated negotiation and electronic commerce: Extending the contract net framework. In Proceedings of the 1st International Conference on Multiagent Systems (ICMAS-95) (pp. 328\u2013335). San Francisco."},{"key":"9057_CR37","doi-asserted-by":"crossref","unstructured":"Shapley, L. S. (1953). A value for n-person games. Contributions to the Theory of Games (pp. 31\u201340).","DOI":"10.1515\/9781400881970-018"},{"key":"9057_CR38","doi-asserted-by":"crossref","first-page":"787","DOI":"10.2307\/1951053","volume":"48","author":"L.S. Shapley","year":"1954","unstructured":"Shapley L.S. and Shubik M. (1954). A method for evaluating the distribution of power in a committee system. American Political Science Review 48: 787\u2013792","journal-title":"American Political Science Review"},{"key":"9057_CR39","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01718820","volume":"30","author":"P. Straffin","year":"1977","unstructured":"Straffin P. (1977). Homogeneity, independence and power indices. Public Choice 30: 107\u2013118","journal-title":"Public Choice"},{"key":"9057_CR40","unstructured":"Sun, X., & Fang, Q. (2005). Core stability of flow games. In J. Akiyama, W. Y. C. Chen, M. Kano, X. Li, & Q. Yu, (Eds.), CJCDGCGT, Lecture Notes in Computer Science (Vol. 4381, pp. 189\u2013199). Springer."},{"key":"9057_CR41","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant L.G. (1979). The complexity of enumeration and reliability problems. SIAM Journal on Computing 8: 410\u2013421","journal-title":"SIAM Journal on Computing"},{"key":"9057_CR42","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1145\/212094.212128","volume":"27","author":"M.P. Wellman","year":"1995","unstructured":"Wellman M.P. (1995). The economic approach to artificial intelligence. ACM Computing Surveys 27: 360\u2013362","journal-title":"ACM Computing Surveys"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-008-9057-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-008-9057-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-008-9057-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:28:24Z","timestamp":1559150904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-008-9057-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,19]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["9057"],"URL":"https:\/\/doi.org\/10.1007\/s10458-008-9057-6","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,19]]}}}