{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:31:39Z","timestamp":1725456699396},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642353109"},{"type":"electronic","value":"9783642353116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35311-6_2","type":"book-chapter","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T02:32:28Z","timestamp":1354588348000},"page":"15-29","source":"Crossref","is-referenced-by-count":4,"title":["Agent Failures in Totally Balanced Games and Convex Games"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Bachrach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Kash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nisarg","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Bachrach, Y., Meir, R., Feldman, M., Tennenholtz, M.: Solving cooperative reliability games. In: UAI, pp. 27\u201334 (2011)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Meir, R., Jung, K., Kohli, P.: Coalitional structure generation in skill games (2010)","DOI":"10.1609\/aaai.v24i1.7620"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Meir, R., Zuckerman, M., Rothe, J., Rosenschein, J.: The cost of stability in weighted voting games. In: AAMAS (2009)","DOI":"10.1007\/978-3-642-04645-2_12"},{"key":"2_CR4","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, 205\u2013228 (2000)","journal-title":"Review of Economic Design"},{"issue":"2","key":"2_CR5","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":"2_CR6","unstructured":"Caillou, P., Aknine, S., Pinson, S.: Multi-agent models for searching pareto optimal solutions to the problem of forming and dynamic restructuring of coalitions. In: ECAI, pp. 13\u201317 (2002)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational aspects of cooperative game theory. Synth. Lect. on Artif. Intell. and Machine Learning (2011)","DOI":"10.2200\/S00355ED1V01Y201107AIM016"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Chalkiadakis, G., Markakis, E., Boutilier, C.: Coalition formation under uncertainty: bargaining equilibria and the Bayesian core. In: AAMAS (2007)","DOI":"10.1145\/1329125.1329203"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Deng, X., Fang, Q., Sun, X.: Finding nucleolus of flow game. J. Comb. Opt. (2009)","DOI":"10.1007\/s10878-008-9138-0"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s101070050005","volume":"87","author":"X. Deng","year":"2000","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H., Zang, W.: Totally balanced combinatorial optimization games. Math. Prog.\u00a087, 441\u2013452 (2000)","journal-title":"Math. Prog."},{"key":"2_CR11","unstructured":"Gillies, D.: Some Theorems on n-Person Games. PhD thesis, Princeton U. (1953)"},{"key":"2_CR12","doi-asserted-by":"publisher","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. Prog.\u00a021, 1\u201318 (1981)","journal-title":"Math. Prog."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Kalai, E., Zemel, E.: Totally balanced games and games of flow. MOR (1982)","DOI":"10.1287\/moor.7.3.476"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Kannan, R., Sarangi, S., Iyengar, S.: A simple model for reliable query reporting in sensor networks. In: Information Fusion, vol.\u00a02, pp. 1070\u20131075 (2002)","DOI":"10.1109\/ICIF.2002.1020930"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Kern, W., Paulusma, D.: Matching games: The least core and the nucleolus. MOR (2003)","DOI":"10.1287\/moor.28.2.294.14477"},{"key":"2_CR16","unstructured":"Kuipers, J.: A Polynomial Time Algorithm for Computing the Nucleolus of Convex Games. Reports in Operations Research and Systems Theory (1996)"},{"key":"2_CR17","unstructured":"Myerson, R.B.: Game Theory: Analysis of Conflict. Harvard U. Press (1997)"},{"key":"2_CR18","unstructured":"Osborne, M., Rubinstein, A.: A course in game theory. The MIT press (1994)"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/BF01681356","volume":"9","author":"G. Owen","year":"1975","unstructured":"Owen, G.: On the core of linear production games. Math. Prog.\u00a09, 358\u2013370 (1975)","journal-title":"Math. Prog."},{"issue":"15","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1016\/j.dam.2011.01.019","volume":"159","author":"M. Penn","year":"2011","unstructured":"Penn, M., Polukarov, M., Tennenholtz, M.: Congestion games with failures. Discrete Applied Mathematics\u00a0159(15), 1508\u20131525 (2011)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-642-03816-7_54","volume-title":"Mathematical Foundations of Computer Science 2009","author":"E. Resnick","year":"2009","unstructured":"Resnick, E., Bachrach, Y., Meir, R., Rosenschein, J.S.: The Cost of Stability in Network Flow Games. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 636\u2013650. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0004-3702(97)00030-1","volume":"94","author":"T. Sandholm","year":"1997","unstructured":"Sandholm, T., Lesser, V.: Coalitions among computationally bounded agents. Artif. Intell.\u00a094(1-2), 99\u2013137 (1997)","journal-title":"Artif. Intell."},{"key":"2_CR23","first-page":"11","volume":"1","author":"L. Shapley","year":"1971","unstructured":"Shapley, L.: Cores of convex games. IJGT\u00a01, 11\u201326 (1971)","journal-title":"IJGT"},{"issue":"1","key":"2_CR24","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0022-0531(69)90008-8","volume":"1","author":"L. Shapley","year":"1969","unstructured":"Shapley, L., Shubik, M.: On market games. JET\u00a01(1), 9\u201325 (1969)","journal-title":"JET"},{"key":"2_CR25","first-page":"111","volume":"1","author":"L. Shapley","year":"1971","unstructured":"Shapley, L., Shubik, M.: The assignment game I: The core. IJGT\u00a01, 111\u2013130 (1971)","journal-title":"IJGT"},{"key":"2_CR26","first-page":"119","volume":"23","author":"T. Solymosi","year":"1994","unstructured":"Solymosi, T., Raghavan, T.: An algorithm for finding the nucleolus of assignment games. IJGT\u00a023, 119\u2013143 (1994)","journal-title":"IJGT"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01721088","volume":"6","author":"S.H. Tijs","year":"1984","unstructured":"Tijs, S.H., Parthasarathy, T., Potters, J., Prasad, V.: Permutation games: Another class of totally balanced games. OR Spectrum\u00a06, 119\u2013123 (1984)","journal-title":"OR Spectrum"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35311-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T07:43:58Z","timestamp":1687851838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35311-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353109","9783642353116"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}