{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:41:59Z","timestamp":1725864119774},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533536"},{"type":"electronic","value":"9783662533543"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_3","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T22:43:34Z","timestamp":1472942614000},"page":"27-39","source":"Crossref","is-referenced-by-count":1,"title":["The Parallel Complexity of Coloring Games"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Ducoffe","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.geb.2003.10.003","volume":"49","author":"C Ballester","year":"2004","unstructured":"Ballester, C.: NP-completeness in hedonic games. Games Econ. Behav. 49(1), 1\u201330 (2004)","journal-title":"Games Econ. Behav."},{"key":"3_CR2","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics. Springer, London (2008)"},{"issue":"1","key":"3_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0165-4896(02)00082-3","volume":"45","author":"N Burani","year":"2003","unstructured":"Burani, N., Zwicker, W.S.: Coalition formation games with separable preferences. Math. Soc. Sci. 45(1), 27\u201352 (2003)","journal-title":"Math. Soc. Sci."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Chatzigiannakis, I., Koninis, C., Panagopoulou, P.N., Spirakis, P.G.: Distributed game-theoretic vertex coloring. In: OPODIS 2010, pp. 103\u2013118 (2010)","DOI":"10.1007\/978-3-642-17653-1_9"},{"issue":"3","key":"3_CR5","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/BF01206637","volume":"4","author":"A Condon","year":"1994","unstructured":"Condon, A.: A theory of strict P-completeness. Comput. Complex. 4(3), 220\u2013241 (1994)","journal-title":"Comput. Complex."},{"key":"3_CR6","unstructured":"Ducoffe, G., Mazauric, D., Chaintreau, A.: The complexity of hedonic coalitions under bounded cooperation (submitted)"},{"issue":"1","key":"3_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C.H., Shenker, S.: Sharing the cost of multicast transmissions. J. Comput. Syst. Sci. 63(1), 21\u201341 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Gairing, M., Savani, R.: Computing stable outcomes in hedonic games. In: SAGT 2010, pp. 174\u2013185 (2010)","DOI":"10.1007\/978-3-642-16170-4_16"},{"key":"3_CR9","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-Completeness Theory","author":"R Greenlaw","year":"1995","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Oxford (1995)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Karloff, H., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: SODA 2010, pp. 938\u2013948 (2010)","DOI":"10.1137\/1.9781611973075.76"},{"issue":"5788","key":"3_CR11","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.1127207","volume":"313","author":"M Kearns","year":"2006","unstructured":"Kearns, M., Suri, S., Montfort, N.: An experimental study of the coloring problem on human subject networks. Science 313(5788), 824\u2013827 (2006)","journal-title":"Science"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1016\/j.geb.2013.10.002","volume":"82","author":"J Kleinberg","year":"2013","unstructured":"Kleinberg, J., Ligett, K.: Information-sharing in social networks. Games Econ. Behav. 82, 702\u2013716 (2013)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"3_CR13","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1287\/opre.1120.1137","volume":"61","author":"JR Marden","year":"2013","unstructured":"Marden, J.R., Wierman, A.: Distributed welfare games. Oper. Res. 61(1), 155\u2013168 (2013)","journal-title":"Oper. Res."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Panagopoulou, P.N., Spirakis, P.G.: A game theoretic approach for efficient graph coloring. In: ISAAC 2008, pp. 183\u2013195 (2008)","DOI":"10.1007\/978-3-540-92182-0_19"},{"key":"3_CR15","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"2003","unstructured":"Papadimitriou, C.H.: Computational Complexity. Wiley, Reading (2003)"},{"key":"3_CR16","unstructured":"Vassilevska Williams, V.: Fine-Grained algorithms and complexity (invited talk). In: STACS 2016 (2016)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T18:50:08Z","timestamp":1657219808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}