{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:22:35Z","timestamp":1743078155903,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496103"},{"type":"electronic","value":"9783031496110"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49611-0_14","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"196-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The MaxIS-Shapley Value in\u00a0Perfect Graphs"],"prefix":"10.1007","author":[{"given":"Junqi","family":"Tan","sequence":"first","affiliation":[]},{"given":"Dongjing","family":"Miao","sequence":"additional","affiliation":[]},{"given":"Pengyu","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Kolaitis, P.G.: Repair checking in inconsistent databases: algorithms and complexity. In: Proceedings of the 12th International Conference on Database Theory, pp. 31\u201341 (2009)","DOI":"10.1145\/1514894.1514899"},{"issue":"10","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1016\/j.jpdc.2011.06.004","volume":"71","author":"F Araujo","year":"2011","unstructured":"Araujo, F., Farinha, J., Domingues, P., Silaghi, G.C., Kondo, D.: A maximum independent set approach for collusion detection in voting pools. J. Parallel Distrib. Comput. 71(10), 1356\u20131366 (2011)","journal-title":"J. Parallel Distrib. Comput."},{"key":"14_CR3","unstructured":"Aziz, H., de Keijzer, B.: Shapley meets Shapley. In: 31st International Symposium on Theoretical Aspects of Computer Science, p. 99 (2014)"},{"issue":"1","key":"14_CR4","first-page":"19","volume":"14","author":"R Bacher","year":"2002","unstructured":"Bacher, R.: Determinants of matrices related to the Pascal triangle. J. de th\u00e9orie des nombres de Bordeaux 14(1), 19\u201341 (2002)","journal-title":"J. de th\u00e9orie des nombres de Bordeaux"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01294456","volume":"15","author":"CJ Colbourn","year":"1995","unstructured":"Colbourn, C.J., Provan, J.S., Vertigan, D.: The complexity of computing the Tutte polynomial on transversal matroids. Combinatorica 15, 1\u201310 (1995)","journal-title":"Combinatorica"},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X Deng","year":"1999","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24(3), 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.19.2.257","volume":"19","author":"X Deng","year":"1994","unstructured":"Deng, X., Papadimitriou, C.H.: On the complexity of cooperative solution concepts. Math. Oper. Res. 19(2), 257\u2013266 (1994)","journal-title":"Math. Oper. Res."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2851493","volume":"21","author":"A Gemsa","year":"2016","unstructured":"Gemsa, A., N\u00f6llenburg, M., Rutter, I.: Evaluation of labeling strategies for rotating maps. J. Exp. Algorithmics (JEA) 21, 1\u201321 (2016)","journal-title":"J. Exp. Algorithmics (JEA)"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Goldberg, M., Hollinger, D., Magdon-Ismail, M.: Experimental evaluation of the greedy and random algorithms for finding independent sets in random graphs. In: Nikoletseas, S.E. (eds.) Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, 10\u201313 May 2005, Proceedings 4, pp. 513\u2013523. Springer, Cham (2005). https:\/\/doi.org\/10.1007\/11427186_44","DOI":"10.1007\/11427186_44"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. In: North-Holland Mathematics Studies, vol. 88, pp. 325\u2013356. Elsevier (1984)","DOI":"10.1016\/S0304-0208(08)72943-8"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/1912573","volume":"57","author":"F Gul","year":"1989","unstructured":"Gul, F.: Bargaining foundations of Shapley value. Econometrica J. Econometric Soc. 57, 81\u201395 (1989)","journal-title":"Econometrica J. Econometric Soc."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Hartmanis, J.: Computers and intractability: a guide to the theory of np-completeness (Michael R. Garey and David S. Johnson). SIAM Rev. 24(1), 90 (1982)","DOI":"10.1137\/1024022"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Ieong, S., Shoham, Y.: Marginal contribution nets: a compact representation scheme for coalitional games. In: Proceedings of the 6th ACM Conference on Electronic Commerce, pp. 193\u2013202 (2005)","DOI":"10.1145\/1064009.1064030"},{"key":"14_CR15","unstructured":"Livshits, E., Bertossi, L., Kimelfeld, B., Sebag, M.: The Shapley value of tuples in query answering. arXiv preprint arXiv:1904.08679 (2019)"},{"issue":"1","key":"14_CR16","first-page":"71","volume":"43","author":"T Matsui","year":"2000","unstructured":"Matsui, T., Matsui, Y.: A survey of algorithms for calculating power indices of weighted majority games. J. Oper. Res. Soc. Japan 43(1), 71\u201386 (2000)","journal-title":"J. Oper. Res. Soc. Japan"},{"issue":"12","key":"14_CR17","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.14778\/3407790.3407809","volume":"13","author":"D Miao","year":"2020","unstructured":"Miao, D., Cai, Z., Li, J., Gao, X., Liu, X.: The computation of optimal subset repairs. Proc. VLDB Endow. 13(12), 2061\u20132074 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.jda.2006.07.006","volume":"6","author":"Y Okamoto","year":"2008","unstructured":"Okamoto, Y., Uno, T., Uehara, R.: Counting the number of independent sets in chordal graphs. J. Discrete Algorithms 6(2), 229\u2013242 (2008)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/S0165-1889(01)00053-7","volume":"27","author":"L Petrosjan","year":"2003","unstructured":"Petrosjan, L., Zaccour, G.: Time-consistent Shapley value allocation of pollution cost reduction. J. Econ. Dyn. Control 27(3), 381\u2013398 (2003)","journal-title":"J. Econ. Dyn. Control"},{"key":"14_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511528446","volume-title":"The Shapley Value: Essays in Honor of Lloyd S. Shapley","author":"AE Roth","year":"1988","unstructured":"Roth, A.E.: The Shapley Value: Essays in Honor of Lloyd S. Shapley. Cambridge University Press, Cambridge (1988)"},{"key":"14_CR21","unstructured":"Ueda, S., Kitaki, M., Iwasaki, A., Yokoo, M.: Concise characteristic function representations in coalitional games based on agent types. In: Twenty-Second International Joint Conference on Artificial Intelligence (2011)"},{"issue":"2","key":"14_CR22","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoret. Comput. Sci. 8(2), 189\u2013201 (1979)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR23","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-981-10-6753-2_13","volume-title":"Game Theory and Applications","author":"L Zhao","year":"2017","unstructured":"Zhao, L., Chen, X., Fang, Q.: Computing the Shapley value of threshold cardinality matching games. In: Li, D.-F., Yang, X.-G., Uetz, M., Xu, G.-J. (eds.) China-Dutch GTA\/China GTA -2016. CCIS, vol. 758, pp. 174\u2013185. Springer, Singapore (2017). https:\/\/doi.org\/10.1007\/978-981-10-6753-2_13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49611-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:07:43Z","timestamp":1707556063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49611-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496103","9783031496110"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49611-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","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":"73","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":"62% - 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":"6","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)"}}]}}