A new paradigm of game analyses

• Project/Area Number: 24650006
• Research Category: Grant-in-Aid for Challenging Exploratory Research
• Allocation Type: Multi-year Fund
• Research Field: Fundamental theory of informatics
• Research Institution: The University of Electro-Communications
• Principal Investigator: Ito Hiro 電気通信大学, 情報理工学(系)研究科, 教授 (50283487)
• Project Period (FY): 2012-04-01 – 2016-03-31
• Project Status: Completed (Fiscal Year 2015)
• Budget Amount: ¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000); Fiscal Year 2014: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000); Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000); Fiscal Year 2012: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
• Keywords: 組合せゲーム・パズル / 劣線形時間アルゴリズム / 離散アルゴリズム / グラフ理論 / 定数時間アルゴリズム / 公平分割 / ケーキ分割問題 / 一般化将棋問題 / じゃんけん / 川渡り問題 / 組合せゲーム / 一般化将棋 / ジャンケン / 三並べ / グラフ / 連結性 / エクスパンション / 多項式時間アルゴリズム

Outline of Final Research Achievements

We considered new frameworks on algorithms mainly on puzzles and games, and have obtained the following results: (I) For the cake-cutting problem, we presented a framework on sublinear-time algorithms and gave some algorithms in the framework. (II) For the generalized shogi problem, we presented a constant-time algorithm, i.e., we showed that it is constant-time solvable. (III) For river crossing problems, we presented a new formulation that requires prohibited states for inputs and gave a polynomial-time algorithms by using expanders. (IV) For generalized shogi with n signs, we considered jankens in which draws between different signs are allowed, and found some properties, e.g., tight upper and lower bounds of the number of draws.

Research Products

• [Int'l Joint Research] MIT(米国)
• [Int'l Joint Research] Univ. Libre de Bruxelles(ベルギー)
• [Journal Article] Folding a Paper Strip to Minimize Thickness (2016)
  • Author(s): Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, and Yushi Uno
  • Journal Title: Journal of Discrete Algorithms Volume: 36 Pages: 18-26
  • DOI: 10.1016/j.jda.2015.09.003
  • NAID: 120006380546
  • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] How to solve the cake-cutting problem in sublinear time (2016)
  • Author(s): Hiro Ito and Takahiro Ueda
  • Journal Title: Proceedings of the 8th International Conference on Fun with Algorithms (FUN2016) Volume: 未定
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] A Much Faster Algorithm for Finding a Maximum Clique (2016)
  • Author(s): Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito and Mitsuo Wakatsuki
  • Journal Title: roceedings of the 10th International Frontiers of Algorithmics Workshop (FAW2016) Volume: 未定 Pages: 215-226
  • DOI: 10.1007/978-3-319-39817-4_21
  • ISBN: 9783319398167, 9783319398174
  • Peer Reviewed / Open Access
• [Journal Article] Number of ties and undefeated signs on a generalized janken (2016)
  • Author(s): Hiro Ito and Yoshinao Shiono
  • Journal Title: Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015), LNCS, Springer Volume: 未定
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Single-Player and Two-Player Buttons & Scissors Games (2016)
  • Author(s): Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffman, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Loffler, Christiane Schmidt, Ryuhei Uehara, Yushi Uno and Aaron Williams
  • Journal Title: Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015), LNCS, Springer Volume: 未定
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Cannibal Animal Games: a new variant of Tic-Tac-Toe (2015)
  • Author(s): J. Cardinal, S. Collette, H. Ito, H. Sakaidani, M. Korman, S. Langerman, and P. Taslakian.
  • Journal Title: Journal of Information Processing Volume: 23 Issue: 3 Pages: 265-271
  • DOI: 10.2197/ipsjjip.23.265
  • NAID: 130005070057
  • ISSN: 1882-6652
  • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] Generalized River Crossing Problems (2015)
  • Author(s): Hiro Ito, Stefan Langerman, and Yuichi Yoshida
  • Journal Title: Theory of Computing Systems Volume: 56 Issue: 2 Pages: 418-435
  • DOI: 10.1007/s00224-014-9562-8
  • Peer Reviewed / Open Access
• [Journal Article] Generalized shogi and chess are constant-time tastable (2015)
  • Author(s): Hiro Ito, Atsuki Nagao, and Teagun Park
  • Journal Title: roceedings of the 12th International Symposium on Operations Research & Its Applications (ISORA 2015), IET Digital Library Volume: なし Pages: 1-6
  • DOI: 10.1049/cp.2015.0601
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] Computational complexity of inverse word search problem (2015)
  • Author(s): Hiro Ito and Shinnosuke Seki
  • Journal Title: Proceedings of the 12th International Symposium on Operations Research & Its Applications (ISORA 2015), IET Digital Library Volume: なし Pages: 41-44
  • DOI: 10.1049/cp.2015.0607
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] Cannibal animal games: a new variant of tic-tac-toe (2015)
  • Author(s): Jean CARDINAL, Sebastien COLETTE, ITO Hiro, Matias KORMAN, Stefan LANGERMAN, SAKIDANI Hikaru, Perouz TASLAKIAN
  • Journal Title: Journal of Information Processing Volume: 掲載予定
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Folding a Paper Strip to Minimizing Thickness (2015)
  • Author(s): Erik D. DEMAINE, David EPPSTEIN, Adam HESTERBERG, Hiro ITO, Anna LUBIW, Ryuhei UEHARA, Yushi UNO
  • Journal Title: Proceeding of Workshop on Algorithms and Computation 2015 (WALCOM 2015) Volume: 8973 Pages: 113-124
  • DOI: 10.1007/978-3-319-15612-5_11
  • ISBN: 9783319156118, 9783319156125
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] How to solve the cake-cutting problem in sublinear time (2015)
  • Author(s): Hiro Ito and Takahiro Ueda
  • Journal Title: arXiv Volume: なし
  • Open Access / Acknowledgement Compliant
• [Journal Article] Bumpy Pyramid Folding (2014)
  • Author(s): Zachary ABEL, Erik D. DEMAINE, Martin DEMAINE, Hiro ITO, Jack SNOEYINK and Ryuhei UEHARA
  • Journal Title: The 26th Canadian Conference on Computational Geometry (CCCG 2014) Volume: なし Pages: 258-266
  • Peer Reviewed / Open Access
• [Journal Article] Helly numbers of polyominoes (2013)
  • Author(s): Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
  • Journal Title: Graphs and Combinatorics Volume: 29 Pages: 1221-1234
  • Peer Reviewed
• [Journal Article] How to generalize janken --- rock-paper-scissors-king-flea (2013)
  • Author(s): Hiro Ito
  • Journal Title: Proceedings of TJJCCGG 2012, LNCS, Springer Volume: 8296 Pages: 85-94
  • DOI: 10.1007/978-3-642-45281-9_8
  • ISBN: 9783642452802, 9783642452819
  • Peer Reviewed
• [Journal Article] Complexity of the stamp folding problem, (2013)
  • Author(s): Takuya Umesao, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto
  • Journal Title: Theoretical Computer Science Volume: 未定
  • NAID: 110008583107
  • Peer Reviewed
• [Journal Article] On computational complexity of graph inference from counting (2013)
  • Author(s): Szilard Zsolt Fazekas, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, and Kei Taneishi
  • Journal Title: Natural Computing Volume: 未定
  • Peer Reviewed
• [Journal Article] Algorithms and complexity of generalized river crossing problems (2012)
  • Author(s): Hiro Ito, Stefan Langerman, Yuichi Yoshida
  • Journal Title: Proc. of The 6th International Conference on Fun with Algorithms (FUN2012), LNCS, Springer Volume: 7288
  • Peer Reviewed
• [Journal Article] Constant-time algorithms for sparsity matroids (2012)
  • Author(s): Hiro Ito, Shin-ichi Tanigawa, Yuich Yoshida
  • Journal Title: Proc. of The 39th International Colloquium on Automata, Language and Programming (ICALP 2012) (1), LNCS, Springer Volume: 7391
  • Peer Reviewed
• [Journal Article] Constant-time approximation algorithms for the optimum branching problem on sparse graphs, (2012)
  • Author(s): Mitsuo Kusumoto, Yuichi Yoshida, Hiro Ito
  • Journal Title: Proceedings of ICNC'12 Volume: なし
  • Peer Reviewed
• [Presentation] Generalized shogi and chess are constant-time tastable (2015)
  • Author(s): Hiro Ito, Atsuki Nagao, and Teagun Park
  • Organizer: The 12th International Symposium on Operations Research & Its Applications (ISORA 2015)
  • Place of Presentation: 龍門, 中国
  • Year and Date: 2015-08-21
  • Int'l Joint Research / Invited
• [Presentation] Algorithms for Sublinear-Time Assignment for the Cake Cutting Problem (2014)
  • Author(s): Takahiro Ueda and Hiro Ito
  • Organizer: AAAC2014 (The 7th Annual Meeting of Asian Association for Algorithms and Computation)
  • Place of Presentation: 杭州市, 中国
• [Presentation] 劣線形時間ケーキ分割アルゴリズム (2013)
  • Author(s): 上田孝弘, 伊藤大雄
  • Organizer: 電子情報通信学会 コンピューテーション研究会
  • Place of Presentation: 沖縄産業支援センター（那覇市）
• [Presentation] On a generalization of river crossing problems (2013)
  • Author(s): Hiro Ito, Stefan Langerman, Yuichi Yoshida
  • Organizer: The 6th International Meeting of Asian Association for Algorithms and Computation (AAAC2013)
  • Place of Presentation: 松島（宮城県）
• [Presentation] サブリニアタイムアルゴリズムの基礎技術 (2012)
  • Author(s): 伊藤大雄
  • Organizer: RAMPシンポジウム
  • Place of Presentation: 東北大学
  • Invited
• [Presentation] ビッグデータ時代の高速アルゴリズムと計算限界の理論
  • Author(s): 伊藤大雄
  • Organizer: 情報オリンピック夏季セミナー
  • Place of Presentation: 国立女性教育会館（埼玉県比企郡）
• [Presentation] 異なる手の間に引分けのある一般化ジャンケンにおける引分け数と不敗手数
  • Author(s): 伊藤大雄, 塩野芳直
  • Organizer: 組合せゲーム・パズル 第９回ミニ研究集会
  • Place of Presentation: 北陸先端科学技術大学院大学
• [Presentation] 一般化川渡り問題のアルゴリズムと計算量
  • Author(s): 伊藤大雄, Stefan LANGERMAN, 吉田悠一
  • Organizer: 離散数学1日研究集会 --- 秋山仁先生 東京理科大学着任記念
  • Place of Presentation: 東京理科大学
• [Presentation] 一般化川渡り問題の多項式時間可解性
  • Author(s): 伊藤大雄, Stefan Langerman, 吉田悠一
  • Organizer: 組合せゲーム・パズル 第8回ミニ研究集会
  • Place of Presentation: 電気通信大学
• [Book] ビッグデータ・マネジメント～データサイエンティストのためのデータ利活用術と事例 (2014)
  • Author(s): 伊藤大雄 他35名
  • Total Pages: 240
  • Publisher: NTS