{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,4]],"date-time":"2022-12-04T06:05:22Z","timestamp":1670133922627},"reference-count":10,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2022,12,1]]},"DOI":"10.1587\/transinf.2022edp7039","type":"journal-article","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T22:18:28Z","timestamp":1669846708000},"page":"2085-2091","source":"Crossref","is-referenced-by-count":0,"title":["Bounded Approximate Payoff Division for MC-nets Games"],"prefix":"10.1587","volume":"E105.D","author":[{"given":"Katsutoshi","family":"HIRAYAMA","sequence":"first","affiliation":[{"name":"Graduate School of Maritime Sciences, Kobe University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tenda","family":"OKIMOTO","sequence":"additional","affiliation":[{"name":"Graduate School of Maritime Sciences, Kobe University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] J. Chen, G.Q. Huang, J-Q. Wang, and C. Yang, \u201cA cooperative approach to service booking and scheduling in cloud manufacturing,\u201d European Journal of Operational Research, no.3, vol.273, pp.861-873, 2019. DOI: 10.1016\/j.ejor.2018.09.007. 10.1016\/j.ejor.2018.09.007","DOI":"10.1016\/j.ejor.2018.09.007"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] F. Bistaffa, A. Farinelli, G. Chalkiadakis, and S.D. Ramchurn, \u201cA cooperative game-theoretic approach to the social ridesharing problem,\u201d Artificial Intelligence, vol.246, pp.86-117, 2017. DOI: 10.1016\/j.artint.2017.02.004. 10.1016\/j.artint.2017.02.004","DOI":"10.1016\/j.artint.2017.02.004"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] S. Ieong and Y. Shoham, \u201cMarginal contribution nets: a compact representation scheme for coalitional games,\u201d Proc. 6th ACM Conference on Electronic Commerce (EC-2005), pp.193-202, 2005. DOI: 10.1145\/1064009.1064030. 10.1145\/1064009.1064030","DOI":"10.1145\/1064009.1064030"},{"key":"4","unstructured":"[4] S. Ueda, T. Hasegawa, N. Hashimoto, N. Ohta, A. Iwasaki, and M. Yokoo, \u201cHandling negative value rules in MC-net-based coalition structure generation,\u201d Proc. 11th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2012), pp.795-802, 2012. https:\/\/dl.acm.org\/doi\/abs\/10.5555\/2343776.2343810."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] X. Liao, M. Koshimura, K. Nomoto, S. Ueda, Y. Sakurai, and M. Yokoo, \u201cImproved WPM encoding for coalition structure generation under MC-nets,\u201d Constraints, vol.24, no.1, pp.25-55, 2019. DOI: 10.1007\/s10601-018-9295-4. 10.1007\/s10601-018-9295-4","DOI":"10.1007\/s10601-018-9295-4"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] G. Greco, E. Malizia, L. Palopoli, and F. Scarcello, \u201cOn the complexity of core, kernel, and bargaining set,\u201d Artificial Intelligence, vol.175, no.12-13, pp.1877-1910, 2011. DOI: 10.1016\/j.artint.2011.06.002. 10.1016\/j.artint.2011.06.002","DOI":"10.1016\/j.artint.2011.06.002"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] K. Hirayama, K. Hanada, S. Ueda, M. Yokoo, and A. Iwasaki, \u201cComputing a payoff division in the least core for MC-nets coalitional games,\u201d Proc. 17th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2014), pp.319-332, 2014. DOI: 10.1007\/978-3-319-13191-7_26. 10.1007\/978-3-319-13191-7_26","DOI":"10.1007\/978-3-319-13191-7_26"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] X. Deng and C.H. Papadimitriou, \u201cOn the complexity of cooperative solution concepts,\u201d Mathematics of Operations Research, vol.19, no.2, pp.257-266, 1994. http:\/\/www.jstor.org\/stable\/3690220.","DOI":"10.1287\/moor.19.2.257"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] V. Conitzer and T. Sandholm, \u201cComplexity of constructing solutions in the core,\u201d Artificial Intelligence, vol.170, pp.607-619, 2006. DOI: 10.1016\/j.artint.2006.01.005. 10.1016\/j.artint.2006.01.005","DOI":"10.1016\/j.artint.2006.01.005"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] T. Sandholm, \u201cAlgorithm for optimal winner determination in combinatorial auctions,\u201d Artificial Intelligence, vol.135, no.1-2, pp.1-54, 2002. DOI: 10.1016\/S0004-3702(01)00159-X. 10.1016\/s0004-3702(01)00159-x","DOI":"10.1016\/S0004-3702(01)00159-X"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/12\/E105.D_2022EDP7039\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T04:10:40Z","timestamp":1670040640000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/12\/E105.D_2022EDP7039\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,1]]},"references-count":10,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2022edp7039","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,1]]},"article-number":"2022EDP7039"}}