{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:12:48Z","timestamp":1725570768114},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175718"},{"type":"electronic","value":"9783642175725"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17572-5_36","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T08:54:45Z","timestamp":1291625685000},"page":"432-443","source":"Crossref","is-referenced-by-count":0,"title":["The Good, The Bad and The Cautious: Safety Level Cooperative Games"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Bachrach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Polukarov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas R.","family":"Jennings","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. Journal of the ACM\u00a055(6) (2008)","DOI":"10.1145\/1455248.1455249"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Aumann, R.: Acceptable points in general cooperative n-person games. In: Cont. to the Theory of Games, Princeton, NJ, vol.\u00a0IV, pp. 287\u2013324 (1959)","DOI":"10.1515\/9781400882168-018"},{"key":"36_CR3","unstructured":"Bachrach, Y.: Honor among thieves - collusion in multi-unit auctions. In: AAMAS (2010)"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Elkind, E., Meir, R., Pasechnik, D., Zuckerman, M., Rothe, J., Rosenschein, J.: 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)","DOI":"10.1007\/978-3-642-04645-2_12"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Rosenschein, J.S.: Power in threshold network flow games. In: Autonomous Agents and Multi-Agent Systems (2009)","DOI":"10.1007\/s10458-008-9057-6"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Byde, A., Polukarov, M., Jennings, N.R.: Games with congestion-averse utilities. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol.\u00a05814, pp. 220\u2013232. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-04645-2_20"},{"key":"36_CR7","unstructured":"Conitzer, V., Sandholm, T.: Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains. In: AAAI (2004)"},{"key":"36_CR8","unstructured":"Elkind, E., Goldberg, L.A., Goldberg, P., Wooldridge, M.: Computational complexity of weighted threshold games. In: AAAI (2007)"},{"key":"36_CR9","unstructured":"Gillies, D.B.: Some theorems on n-person games. PhD thesis, Princeton University (1953)"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Hayrapetyan, A., Tardos, E., Wexler, T.: The effect of collusion in congestion games. In: STOC 2006 (2006)","DOI":"10.1145\/1132516.1132529"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/game.1997.0592","volume":"21","author":"R. Holzman","year":"1997","unstructured":"Holzman, R., Law-Yone, N.: Strong equilibrium in congestion games. Games and Economic Behavior\u00a021, 85\u2013101 (1997)","journal-title":"Games and Economic Behavior"},{"key":"36_CR12","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: A simple class of congestion games. In: AAAI 2005, pp. 489\u2013494 (2005)"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Milchtaich, I.: Congestion models of competition. American Naturalist (1996)","DOI":"10.1086\/285878"},{"key":"36_CR14","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)"},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"36_CR16","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing. J. ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/11944874_8","volume-title":"Internet and Network Economics","author":"O. Rozenfeld","year":"2006","unstructured":"Rozenfeld, O., Tennenholtz, M.: Strong and correlated strong equilibria in monotone congestion games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 74\u201386. Springer, Heidelberg (2006)"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: A value for n-person games. Cont. to the Theory of Games (1953)","DOI":"10.1515\/9781400881970-018"},{"key":"36_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-10841-9_61","volume-title":"Internet and Network Economics","author":"T. Voice","year":"2009","unstructured":"Voice, T., Polukarov, M., Byde, A., Jennings, N.R.: On the impact of strategy and utility structures on congestion-averse games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 600\u2013607. Springer, Heidelberg (2009)"},{"key":"36_CR20","unstructured":"Yokoo, M., Conitzer, V., Sandholm, T., Ohta, N., Iwasaki, A.: Coalitional games in open anonymous environments. In: AAAI 2005, pp. 509\u2013514 (2005)"},{"key":"36_CR21","unstructured":"Zuckerman, M., Faliszewski, P., Bachrach, Y., Elkind, E.: Manipulating the quota in weighted voting games. In: AAAI (2008)"}],"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-17572-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T18:31:55Z","timestamp":1553279515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17572-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175718","9783642175725"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17572-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}