{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:16:48Z","timestamp":1743034608424,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642021572"},{"type":"electronic","value":"9783642021589"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02158-9_7","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T11:36:06Z","timestamp":1245238566000},"page":"55-67","source":"Crossref","is-referenced-by-count":10,"title":["Power Indices in Spanning Connectivity Games"],"prefix":"10.1007","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[]},{"given":"Oded","family":"Lachish","sequence":"additional","affiliation":[]},{"given":"Mike","family":"Paterson","sequence":"additional","affiliation":[]},{"given":"Rahul","family":"Savani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods\u00a08(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math.\u00a023(1), 11\u201324 (1989)","journal-title":"Discrete Appl. Math."},{"key":"7_CR3","unstructured":"Aziz, H.: Complexity of comparison of influence of players in simple games. In: Proceedings of the Second International Workshop on Computational Social Choice (COMSOC 2008), pp. 61\u201372 (2008)"},{"key":"7_CR4","unstructured":"Aziz, H., Lachich, O., Paterson, M., Savani, R.: Wiretapping: the nucleolus of connectivity (submitted, 2009)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.5802\/jtnb.344","volume":"14","author":"R. Bacher","year":"2002","unstructured":"Bacher, R.: Determinants of matrices related to the Pascal triangle. J. Th\u00e9or. des Nombres Bordeaux\u00a014, 19\u201341 (2002)","journal-title":"J. Th\u00e9or. des Nombres Bordeaux"},{"key":"7_CR6","unstructured":"Bachrach, Y., Markakis, E., Procaccia, A.D., Rosenschein, J.S., Saberi, A.: Approximating power indices. In: AAMAS 2008: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, pp. 943\u2013950 (2008)"},{"key":"7_CR7","first-page":"1","volume-title":"AAMAS 2007: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems","author":"Y. Bachrach","year":"2007","unstructured":"Bachrach, Y., Rosenschein, J.S.: Computing the Banzhaf power index in network flow games. In: AAMAS 2007: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, pp. 1\u20137. ACM Press, New York (2007)"},{"key":"7_CR8","unstructured":"Bachrach, Y., Rosenschein, J.S., Porat, E.: Power and stability in connectivity games. In: AAMAS 2008: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, pp. 999\u20131006 (2008)"},{"key":"7_CR9","volume-title":"Surveys in Combinatorics","author":"R.A. Bailey","year":"1997","unstructured":"Bailey, R.A.: Surveys in Combinatorics. Cambridge University Press, Cambridge (1997)"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1109\/TR.1986.4335422","volume":"35","author":"M.O. Ball","year":"1986","unstructured":"Ball, M.O.: Computational complexity of network reliability analysis: An overview. IEEE Transactions on Reliability\u00a035(3), 230\u2013239 (1986)","journal-title":"IEEE Transactions on Reliability"},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02579075","volume":"9","author":"P. Borm","year":"2001","unstructured":"Borm, P., Hamers, H., Hendrickx, R.: Operations research games: A survey. TOP: An Official Journal of the Spanish Society of Statistics and Operations Research\u00a09(2), 139\u2013199 (2001)","journal-title":"TOP: An Official Journal of the Spanish Society of Statistics and Operations Research"},{"key":"7_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/b106453","volume-title":"Network Analysis: Methodological Foundations","author":"U. Brandes","year":"2005","unstructured":"Brandes, U., Erlebach, T.: Network Analysis: Methodological Foundations. Springer, Heidelberg (2005)"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.ejor.2006.02.020","volume":"178","author":"Y. Crama","year":"2007","unstructured":"Crama, Y., Leruth, L.: Control and voting power in corporate networks: Concepts and computational aspects. European Journal of Operational Research\u00a0178(3), 879\u2013893 (2007)","journal-title":"European Journal of Operational Research"},{"key":"7_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4871-0","volume-title":"Cooperative Game Theory and Applications: Cooperative Games Arising from Combinatorial Optimization Problems","author":"I. Curiel","year":"1997","unstructured":"Curiel, I.: Cooperative Game Theory and Applications: Cooperative Games Arising from Combinatorial Optimization Problems. Springer, Heidelberg (1997)"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01753239","volume":"7","author":"J. Deegan","year":"1978","unstructured":"Deegan, J., Packel, E.: A new index of power for simple n-person games. International Journal of Game Theory\u00a07(2), 113\u2013123 (1978)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/moor.4.2.99","volume":"4","author":"P. Dubey","year":"1979","unstructured":"Dubey, P., Shapley, L.S.: Mathematical properties of the Banzhaf power index. Mathematics of Operations Research\u00a04(2), 99\u2013131 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-68880-8_18","volume-title":"Algorithmic Aspects in Information and Management","author":"P. Faliszewski","year":"2008","unstructured":"Faliszewski, P., Hemaspaandra, L.A.: The complexity of power-index comparison. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol.\u00a05034, pp. 177\u2013187. Springer, Heidelberg (2008)"},{"key":"7_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"C. Godsil","year":"2001","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory. Springer, Heidelberg (2001)"},{"issue":"4","key":"7_CR19","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s001820050085","volume":"27","author":"D. Granot","year":"1998","unstructured":"Granot, D., Maschler, M.: Spanning network games. International Journal of Game Theory\u00a027(4), 467\u2013500 (1998)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"7_CR20","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1111\/j.1467-9248.1982.tb00537.x","volume":"30","author":"M. Holler","year":"1982","unstructured":"Holler, M.: Forming coalitions and measuring voting power. Political Studies\u00a030(2), 262\u2013271 (1982)","journal-title":"Political Studies"},{"key":"7_CR21","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2006","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 3rd edn. Springer, Germany (2006)","edition":"3"},{"issue":"3","key":"7_CR22","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing\u00a08(3), 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"7_CR23","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/BF01240156","volume":"21","author":"A. Nouweland van den","year":"1993","unstructured":"van den Nouweland, A., Tijs, S., Maschler, M.: Monotonic games are spanning network games. International Journal of Game Theory\u00a021(4), 419\u2013427 (1993)","journal-title":"International Journal of Game Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02158-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:59:20Z","timestamp":1558267160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02158-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021572","9783642021589"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02158-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}