{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:57:05Z","timestamp":1743069425788,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_12","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"137-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On Hedonic Games with Common Ranking Property"],"prefix":"10.1007","author":[{"given":"Bugra","family":"Caskurlu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatih Erdem","family":"Kizilkaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"987","DOI":"10.2307\/1912943","volume":"48","author":"JH Dreze","year":"1980","unstructured":"Dreze, J.H., Greenberg, J.: Hedonic coalitions: optimality and stability. Econometrica 48(4), 987 (1980)","journal-title":"Econometrica"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.2307\/1885113","volume":"103","author":"J Farrell","year":"1988","unstructured":"Farrell, J., Scotchmer, S.: Partnerships. Q. J. Econ. 103(2), 279 (1988)","journal-title":"Q. J. Econ."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/j.geb.2013.08.006","volume":"82","author":"H Aziz","year":"2013","unstructured":"Aziz, H., Brandt, F., Harrenstein, P.: Pareto optimality in coalition formation. Games Econ. Behav. 82, 562\u2013581 (2013)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","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."},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9 (1962)","journal-title":"Am. Math. Mon."},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"RW Irving","year":"1985","unstructured":"Irving, R.W.: An efficient algorithm for the stable roommates problem. J. Algorithms 6(4), 577\u2013595 (1985)","journal-title":"J. Algorithms"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01770064","volume":"8","author":"PP Shenoy","year":"1979","unstructured":"Shenoy, P.P.: On coalition formation: a game-theoretical approach. Int. J. Game Theory 8(3), 133\u2013164 (1979)","journal-title":"Int. J. Game Theory"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s00224-009-9176-8","volume":"45","author":"M Olsen","year":"2009","unstructured":"Olsen, M.: Nash stability in additively separable hedonic games and community structures. Theory Comput. Syst. 45(4), 917\u2013925 (2009)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/game.2001.0877","volume":"38","author":"A Bogomolnaia","year":"2002","unstructured":"Bogomolnaia, A., Jackson, M.O.: The stability of hedonic coalition structures. Games Econ. Behav. 38(2), 201\u2013230 (2002)","journal-title":"Games Econ. Behav."},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.artint.2012.09.006","volume":"195","author":"H Aziz","year":"2013","unstructured":"Aziz, H., Brandt, F., Seedig, H.G.: Computing desirable partitions in additively separable hedonic games. Artif. Intell. 195, 316\u2013334 (2013)","journal-title":"Artif. Intell."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s003550000067","volume":"18","author":"S Banerjee","year":"2001","unstructured":"Banerjee, S., Konishi, H., S\u00f6nmez, T.: Core in a simple coalition formation game. Soc. Choice Welf. 18(1), 135\u2013153 (2001)","journal-title":"Soc. Choice Welf."},{"key":"12_CR12","unstructured":"Elkind, E., Wooldridge, M.: Hedonic coalition nets. In: The Proceedings of AAMAS 2009, vol. 1, pp. 417\u2013424 (2009)"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games Econ. Behav. 14(1), 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"issue":"4","key":"12_CR15","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"12_CR16","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Heidelberg (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/S0097539792228289","volume":"23","author":"M Bellare","year":"1994","unstructured":"Bellare, M., Goldwasser, S.: The complexity of decision versus search. SIAM J. Comput. 23(1), 97\u2013119 (1994)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","volume":"7","author":"M Dyer","year":"1986","unstructured":"Dyer, M., Frieze, A.: Planar 3DM is NP-complete. J. Algorithms 7(2), 174\u2013184 (1986)","journal-title":"J. Algorithms"},{"issue":"2\u20133","key":"12_CR19","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.tcs.2005.03.007","volume":"339","author":"C Bazgan","year":"2005","unstructured":"Bazgan, C., Escoffier, B., Paschos, V.T.: Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Theor. Comput. Sci. 339(2\u20133), 272\u2013292 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"12_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1\u20132), 123\u2013134 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR21","unstructured":"Larson, A.: What Is a Partnership. Expertlaw.com (2018). https:\/\/www.expertlaw.com\/library\/business\/partnership.html. Accessed 28 Oct 2018"},{"key":"12_CR22","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of Computational Complexity. Twelfth Annual IEEE Conference (1997)"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.): Algorithmic Game Theory (2007)","DOI":"10.1017\/CBO9780511800481"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:56:13Z","timestamp":1710334573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}