{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:13Z","timestamp":1750221193144,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"JSPS KAKENHI","award":["JP16K16005, JP16H06931, and JP18K18004"],"award-info":[{"award-number":["JP16K16005, JP16H06931, and JP18K18004"]}]},{"name":"JST ACT-I","award":["JPMJPR17U7"],"award-info":[{"award-number":["JPMJPR17U7"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,11]]},"DOI":"10.1145\/3219166.3219200","type":"proceedings-article","created":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T12:36:46Z","timestamp":1529411806000},"page":"131-148","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Computing a Subgame Perfect Equilibrium of a Sequential Matching Game"],"prefix":"10.1145","author":[{"given":"Yasushi","family":"Kawase","sequence":"first","affiliation":[{"name":"Tokyo Institute of Technology, Tokyo, Japan"}]},{"given":"Yutaro","family":"Yamaguchi","sequence":"additional","affiliation":[{"name":"Osaka University, Osaka, Japan"}]},{"given":"Yu","family":"Yokoi","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.1997.2447"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0743"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.econlet.2004.06.013"},{"volume-title":"International Symposium on Algorithmic Game Theory. Springer","author":"Avni G.","key":"e_1_3_2_2_4_1"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2014.05.009"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-1765(00)00263-9"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2006.03.006"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_3_2_2_9_1","unstructured":"M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman New York New York.   M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman New York New York."},{"key":"e_1_3_2_2_10_1","unstructured":"D. Gusfield and R. W. Irving. 1989. The Stable Marriage Problem: Structure and Algorithms. MIT Press Boston.   D. Gusfield and R. W. Irving. 1989. The Stable Marriage Problem: Structure and Algorithms. MIT Press Boston."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00182-009-0218-x"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Y. Kawase Y. Yamaguchi and Y. Yokoi. 2018. Computing a subgame perfect equilibrium of a sequential matching game. (2018). arXiv:1804.10353  Y. Kawase Y. Yamaguchi and Y. Yokoi. 2018. Computing a subgame perfect equilibrium of a sequential matching game. (2018). arXiv:1804.10353","DOI":"10.1145\/3219166.3219200"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1162\/qjec.2010.125.3.1297"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"A. Kloosterman and P. Troyan. 2016. Efficient and essentially stable assignments. Mimeo. (2016).  A. Kloosterman and P. Troyan. 2016. Efficient and essentially stable assignments. Mimeo. (2016).","DOI":"10.2139\/ssrn.2812217"},{"key":"e_1_3_2_2_15_1","unstructured":"D. E. Knuth. 1976. Marriage Stables. Montreal: Les Presses de l'Universite de Montreal.  D. E. Knuth. 1976. Marriage Stables. Montreal: Les Presses de l'Universite de Montreal."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090242"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"D. F. Manlove. 2013. Algorithmics of Matching under Preferences. World Scientific.  D. F. Manlove. 2013. Algorithmics of Matching under Preferences. World Scientific.","DOI":"10.1142\/8591"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934199"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/362619.362631"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"N. Nisan T. Roughgarden E. Tardos and V. V. Vazirani. 2007. Algorithmic Game Theory. Cambridge University Press Cambridge.   N. Nisan T. Roughgarden E. Tardos and V. V. Vazirani. 2007. Algorithmic Game Theory. Cambridge University Press Cambridge.","DOI":"10.1017\/CBO9780511800481"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2007.12.005"},{"volume-title":"Two-sided Matching: A Study in Game-Theoretic Modeling and Analysis","year":"1991","author":"Roth A. E.","key":"e_1_3_2_2_22_1"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"A. E. Roth and J. H. Vande Vate. 1991. Incentives in two-sided matching with random stable mechanisms. Economic theory 1 1 (1991) 31--44.  A. E. Roth and J. H. Vande Vate. 1991. Incentives in two-sided matching with random stable mechanisms. Economic theory 1 1 (1991) 31--44.","DOI":"10.1007\/BF01210572"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-007-0272-x"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2014.10.002"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9388-y"}],"event":{"name":"EC '18: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Ithaca NY USA","acronym":"EC '18"},"container-title":["Proceedings of the 2018 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219166.3219200","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219166.3219200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:16Z","timestamp":1750210756000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219166.3219200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":26,"alternative-id":["10.1145\/3219166.3219200","10.1145\/3219166"],"URL":"https:\/\/doi.org\/10.1145\/3219166.3219200","relation":{},"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"2018-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}