{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:22:57Z","timestamp":1725751377571},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642413919"},{"type":"electronic","value":"9783642413926"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41392-6_4","type":"book-chapter","created":{"date-parts":[[2013,10,9]],"date-time":"2013-10-09T03:30:26Z","timestamp":1381289426000},"page":"38-49","source":"Crossref","is-referenced-by-count":5,"title":["Reliability Weighted Voting Games"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Bachrach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nisarg","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-02158-9_7","volume-title":"Algorithmic Aspects in Information and Management","author":"H. Aziz","year":"2009","unstructured":"Aziz, H., Lachish, O., Paterson, M., Savani, R.: Power indices in spanning connectivity games. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol.\u00a05564, pp. 55\u201367. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Markakis, E., Resnick, E., Procaccia, A., Rosenschein, J., Saberi, A.: Approximating power indices: theoretical and empirical analysis. In: AAMAS, pp. 105\u2013122 (2010)","key":"4_CR2","DOI":"10.1007\/s10458-009-9078-9"},{"unstructured":"Bachrach, Y., Meir, R., Feldman, M., Tennenholtz, M.: Solving cooperative reliability games. In: UAI, pp. 27\u201334 (2011)","key":"4_CR3"},{"doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Rosenschein, J.: Power in threshold network flow games. In: AAMAS, pp. 106\u2013132 (2009)","key":"4_CR4","DOI":"10.1007\/s10458-008-9057-6"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-04645-2_12","volume-title":"Algorithmic Game Theory","author":"Y. Bachrach","year":"2009","unstructured":"Bachrach, Y., Elkind, E., Meir, R., Pasechnik, D., Zuckerman, M., Rothe, J., Rosenschein, J.S.: The cost of stability in coalitional games. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol.\u00a05814, pp. 122\u2013134. Springer, Heidelberg (2009)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-35311-6_2","volume-title":"Internet and Network Economics","author":"Y. Bachrach","year":"2012","unstructured":"Bachrach, Y., Kash, I., Shah, N.: Agent failures in totally balanced games and convex games. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol.\u00a07695, pp. 15\u201329. Springer, Heidelberg (2012)"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s100580000019","volume":"5","author":"V. Bala","year":"2000","unstructured":"Bala, V., Goyal, S.: A strategic analysis of network reliability. Review of Economic Design\u00a05(3), 205\u2013228 (2000)","journal-title":"Review of Economic Design"},{"key":"4_CR8","first-page":"317","volume":"19","author":"J.F. Banzhaf","year":"1964","unstructured":"Banzhaf, J.F.: Weighted voting doesn\u2019t work: A mathematical analysis. Rutgers Law Review\u00a019, 317 (1964)","journal-title":"Rutgers Law Review"},{"issue":"1","key":"4_CR9","first-page":"289","volume":"83","author":"M.R. Baye","year":"1993","unstructured":"Baye, M.R., Kovenock, D., De Vries, C.G.: Rigging the lobbying process: an application of the all-pay auction. The American Economic Review\u00a083(1), 289\u2013294 (1993)","journal-title":"The American Economic Review"},{"key":"4_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4393-0","volume-title":"Cooperative games on combinatorial structures","author":"J.M. Bilbao","year":"2000","unstructured":"Bilbao, J.M.: Cooperative games on combinatorial structures. Kluwer Academic, Boston (2000)"},{"issue":"2","key":"4_CR11","first-page":"181","volume":"13","author":"P. Billand","year":"2011","unstructured":"Billand, P., Bravard, C., Sarangi, S.: Nash networks with imperfect reliability and heterogeous players. IGTR\u00a013(2), 181\u2013194 (2011)","journal-title":"IGTR"},{"key":"4_CR12","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22000-5_1","volume-title":"Agent and Multi-Agent Systems: Technologies and Applications","author":"M. Wooldridge","year":"2011","unstructured":"Wooldridge, M.: Computational aspects of cooperative game theory. In: O\u2019Shea, J., Nguyen, N.T., Crockett, K., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2011. LNCS (LNAI), vol.\u00a06682, p. 1. Springer, Heidelberg (2011)"},{"unstructured":"Conitzer, V., Sandholm, T.: Computing shapley values, manipulating value division schemes, and checking core membership in multi-issue domains. In: AAAI, pp. 219\u2013225 (2004)","key":"4_CR13"},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","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. MOR\u00a019(2), 257\u2013266 (1994)","journal-title":"MOR"},{"issue":"3","key":"4_CR15","first-page":"131","volume":"4","author":"P. Dubey","year":"1975","unstructured":"Dubey, P.: On the uniqueness of the shapley value. IJGT\u00a04(3), 131\u2013139 (1975)","journal-title":"IJGT"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10472-009-9162-5","volume":"56","author":"E. Elkind","year":"2009","unstructured":"Elkind, E., Goldberg, L., Goldberg, P., Wooldridge, M.: On the computational complexity of weighted voting games. Ann. Math. Artif. Intell.\u00a056(2), 109\u2013131 (2009)","journal-title":"Ann. Math. Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Fatima, S.S., Wooldridge, M., Jennings, N.R.: A randomized method for the Shapley value for the voting game. In: AAMAS, pp. 955\u2013962 (2007)","key":"4_CR17","DOI":"10.1145\/1329125.1329316"},{"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":"4_CR18"},{"unstructured":"Gillies, D.B.: Some theorems on n-person games. PhD thesis, Princeton University (1953)","key":"4_CR19"},{"doi-asserted-by":"crossref","unstructured":"Kannan, R., Sarangi, S., Iyengar, S.: A simple model for reliable query reporting in sensor networks. In: Information Fusion, pp. 1070\u20131075 (2002)","key":"4_CR20","DOI":"10.1109\/ICIF.2002.1020930"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0453-4514(00)88752-9","volume":"43","author":"Y. Matsui","year":"2000","unstructured":"Matsui, Y., Matsui, T.: A survey of algorithms for calculating power indices of weighted majority games. Journal of the Operations Research Society of Japan\u00a043, 71\u201386 (2000)","journal-title":"Journal of the Operations Research Society of Japan"},{"doi-asserted-by":"crossref","unstructured":"Meir, R., Tennenholtz, M., Bachrach, Y., Key, P.: Congestion games with agent failures. In: AAAI, pp. 1401\u20131407 (2012)","key":"4_CR22","DOI":"10.1609\/aaai.v26i1.8244"},{"doi-asserted-by":"crossref","unstructured":"Penn, M., Polukarov, M., Tennenholtz, M.: Congestion games with failures. In: EC, pp. 259\u2013268 (2005)","key":"4_CR23","DOI":"10.1145\/1064009.1064037"},{"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)","key":"4_CR24","DOI":"10.1017\/CBO9780511528446.003"},{"doi-asserted-by":"crossref","unstructured":"Shapley, L., Shubik, M.: Quasi-cores in a monetary economy with nonconvex preferences. Econometrica: Journal of the Econometric Society, 805\u2013827 (1966)","key":"4_CR25","DOI":"10.2307\/1910101"},{"issue":"1","key":"4_CR26","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/bs.3830230104","volume":"23","author":"H. Young","year":"1978","unstructured":"Young, H.: The allocation of funds in lobbying and campaigning. Behavioral Science\u00a023(1), 21\u201331 (1978)","journal-title":"Behavioral Science"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41392-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T06:26:50Z","timestamp":1688538410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41392-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642413919","9783642413926"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41392-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}