{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:22:20Z","timestamp":1742977340233,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89543-3_4","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"37-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Singleton Congestion Games with\u00a0Resilience Against Collusion"],"prefix":"10.1007","author":[{"given":"Bugra","family":"Caskurlu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d6zg\u00fcn","family":"Ekici","sequence":"additional","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":[[2021,10,20]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Altman, E., et al.: Blockchain competition between miners: a game theoretic perspective. Front. Blockchain 2 (2020)","DOI":"10.3389\/fbloc.2019.00026"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00224-013-9463-2","volume":"53","author":"E Anshelevich","year":"2013","unstructured":"Anshelevich, E., Caskurlu, B., Hate, A.: Partition equilibrium always exists in resource selection games. Theory Comput. Syst. 53(1), 73\u201385 (2013)","journal-title":"Theory Comput. Syst."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-19457-3_1","volume-title":"Robotics Research","author":"J van den Berg","year":"2011","unstructured":"van den Berg, J., Guy, S.J., Lin, M., Manocha, D.: Reciprocal n-body collision avoidance. In: Pradalier, C., Siegwart, R., Hirzinger, G. (eds.) Robotics Research, pp. 3\u201319. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19457-3_1"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-030-17402-6_7","volume-title":"Algorithms and Complexity","author":"V Bil\u00f2","year":"2019","unstructured":"Bil\u00f2, V., Gourv\u00e8s, L., Monnot, J.: Project games. In: Heggernes, P. (ed.) CIAC 2019. LNCS, vol. 11485, pp. 75\u201386. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17402-6_7"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-030-59267-7_23","volume-title":"Theory and Applications of Models of Computation","author":"B Caskurlu","year":"2020","unstructured":"Caskurlu, B., Ekici, O., Erdem Kizilkaya, F.: On existence of equilibrium under social coalition structures. In: Chen, J., Feng, Q., Xu, J. (eds.) TAMC 2020. LNCS, vol. 12337, pp. 263\u2013274. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59267-7_23"},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"1686","DOI":"10.3906\/elk-1910-164","volume":"28","author":"B Caskurlu","year":"2020","unstructured":"Caskurlu, B., Ekici, \u00d6., Kizilkaya, F.E.: On efficient computation of equilibrium under social coalition structures. Turkish J. Electr. Eng. Comput. Sci. 28(3), 1686\u20131698 (2020)","journal-title":"Turkish J. Electr. Eng. Comput. Sci."},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1858948.1858952","volume":"1","author":"M Feldman","year":"2010","unstructured":"Feldman, M., Tennenholtz, M.: Structured coalitions in resource selection games. ACM Trans. Intell. Syst. Technol. 1(1), 1\u201321 (2010)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-10841-9_43","volume-title":"Internet and Network Economics","author":"T Harks","year":"2009","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.H.: Strong Nash equilibria in games with the lexicographical improvement property. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 463\u2013470. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_43"},{"key":"4_CR9","unstructured":"Hoefer, M., Penn, M., Polukarov, M., Skopalik, A., V\u00f6cking, B.: Considerate equilibrium. In: International Joint Conference on Artificial Intelligence (IJCAI). ACM Press (2011)"},{"issue":"1\u20132","key":"4_CR10","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 Econ. Behav. 21(1\u20132), 85\u2013101 (1997)","journal-title":"Games Econ. Behav."},{"key":"4_CR11","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: a simple class of congestion games. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI), vol. 2, pp. 489\u2013494. AAAI Press (2005)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.artint.2015.08.004","volume":"229","author":"T Rahwan","year":"2015","unstructured":"Rahwan, T., Michalak, T.P., Wooldridge, M., Jennings, N.R.: Coalition structure generation: a survey. Artif. Intell. 229, 139\u2013174 (2015)","journal-title":"Artif. Intell."},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2(1), 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"issue":"3","key":"4_CR14","first-page":"325","volume":"1","author":"JG Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Inst. Civ. Eng. 1(3), 325\u2013362 (1952)","journal-title":"Proc. Inst. Civ. Eng."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89543-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:05:57Z","timestamp":1634781957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","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":"131","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":"56","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":"43% - 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.1","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":"2.2","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)"}}]}}