{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:16:49Z","timestamp":1742995009244,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_29","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"360-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Gutin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip R.","family":"Neary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"Yeo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.jet.2006.06.006","volume":"135","author":"Y Bramoull\u00e9","year":"2007","unstructured":"Bramoull\u00e9, Y., Kranton, R.: Public goods in networks. J. Econ. Theory 135(1), 478\u2013494 (2007)","journal-title":"J. Econ. Theory"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"D Corneil","year":"1984","unstructured":"Corneil, D., Perl, Y.: Clustering and domination in perfect graphs. Discrete Appl. Math. 9, 27\u201339 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"23\u201324","key":"29_CR3","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1016\/j.ipl.2011.09.004","volume":"111","author":"M Cygan","year":"2011","unstructured":"Cygan, M., Pilipczuk, M., Wojtaszczyk, J.O.: Capacitated domination faster than $$O(2^n)$$. Inf. Process. Lett. 111(23\u201324), 1099\u20131103 (2011)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"29_CR4","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\u201315 (1962)","journal-title":"Am. Math. Mon."},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1111\/j.1467-937X.2009.00570.x","volume":"77","author":"A Galeotti","year":"2010","unstructured":"Galeotti, A., Goyal, S., Jackson, M.O., Vega-Redondo, F., Yariv, L.: Network games. Rev. Econ. Stud. 77(1), 218\u2013244 (2010)","journal-title":"Rev. Econ. Stud."},{"key":"29_CR6","unstructured":"Gerke, S., Gutin, G., Hwang, S.H., Neary, P.R.: Netflix games: local public goods with capacity constraints (2019). arXiv:1905.01693"},{"issue":"7","key":"29_CR7","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1016\/j.disc.2012.11.031","volume":"313","author":"W Goddard","year":"2013","unstructured":"Goddard, W., Henning, M.A.: Independent domination in graphs: a survey and recent results. Discrete Math. 313(7), 839\u2013854 (2013)","journal-title":"Discrete Math."},{"key":"29_CR8","unstructured":"Gutin, G., Hirano, T., Hwang, S.H., Neary, P.R., Toda, A.A.: The effect of social distancing on the reach of an epidemic in social networks (2020). arXiv:2005.03067"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Gutin, G., Neary, P.R., Yeo, A.: Uniqueness of DP-Nash subgraphs and D-sets in capacitated graphs of netflix games. arXiv:2003.07106 (2020)","DOI":"10.1007\/978-3-030-58150-3_29"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-013-9844-6","volume":"72","author":"M Kao","year":"2015","unstructured":"Kao, M., Chen, H., Lee, D.: Capacitated domination: problem complexity and approximation algorithms. Algorithmica 72(1), 1\u201343 (2015)","journal-title":"Algorithmica"},{"issue":"772","key":"29_CR11","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1098\/rspa.1927.0118","volume":"115","author":"WO Kermack","year":"1927","unstructured":"Kermack, W.O., McKendrick, A.G.: A contribution to the mathematical theory of epidemics. Proc. R. Soc. London. A 115(772), 700\u2013721 (1927). Containing Papers of a Mathematical and Physical Character. http:\/\/www.jstor.org\/stable\/94815","journal-title":"Proc. R. Soc. London. A"},{"issue":"3","key":"29_CR12","first-page":"587","volume":"88","author":"S Morris","year":"1998","unstructured":"Morris, S., Shin, H.S.: Unique equilibrium in a model of self-fulfilling currency attacks. Am. Econ. Rev. 88(3), 587\u2013597 (1998)","journal-title":"Am. Econ. Rev."},{"issue":"2","key":"29_CR13","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"JF Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in $$n$$-person games. Proc. Natl. Acad. Sci. U.S.A. 36(1), 48\u201349 (1950)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"3","key":"29_CR15","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00182-008-0117-6","volume":"36","author":"AE Roth","year":"2008","unstructured":"Roth, A.E.: Deferred acceptance algorithms: history, theory, practice, and open questions. Int. J. Game Theory 36(3), 537\u2013569 (2008)","journal-title":"Int. J. Game Theory"}],"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-58150-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:41:06Z","timestamp":1619242866000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","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":"Atlanta, GA","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"2.7","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":"10.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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}