Hanna Sumita

東京科学大学（旧東京工業大学）　情報理工学院　数理・計算科学系
准教授

Department of Mathematical and Computing Science, School of Computing, Institute of Science Tokyo (formerly Tokyo Institute of Technology)
Associate Professor

Google Scholar

Journal Papers

Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura and Makoto Yokoo: Towards Optimal Subsidy Bounds for Envy-freeable Allocations.
Artificial Intelligence, 348, 104406, 2025. [Page]
Koichi Nishimura and Hanna Sumita: Envy-freeness and Maximum Nash Welfare for Mixed Divisible and Indivisible Goods.
Mathematical Social Sciences, 138, 102449, 2025. [Page]
Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita: Fair Division with Two-Sided Preferences.
Games and Economic Behavior, 147, pp. 268-287, 2024. [Page]
Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, and Makoto Yokoo: A Fair and Truthful Mechanism with Limited Subsidy.
Games and Economic Behavior, 144, pp. 49-70, 2024. [Page]
Yasushi Kawase and Hanna Sumita: Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation.
Algorithmica, 86, pp. 566–584, 2024. [Page]
Yasushi Kawase, Kei Kimura, Kazuhisa Makino, and Hanna Sumita: Optimal Matroid Partitioning Problems.
Algorithmica, 83, pp. 1653–1676, 2021. [Page]
Yasushi Kawase, Hanna Sumita, and Takuro Fukunaga: Submodular Maximization with Uncertain Knapsack Capacity.
SIAM Journal on Discrete Mathematics, 33(3), pp. 1121-1145, 2019. [Page]
Hanna Sumita, Naonori Kakimura and Kazuhisa Makino: Total Dual Integrality of the Linear Complementarity Problem.
Annals of Operations Research, 274(1–2), pp. 531–553, 2019. [Page]
Hanna Sumita, Naonori Kakimura and Kazuhisa Makino: Parameterized Complexity of Sparse Linear Complementarity Problems.
Algorithmica, 79(1), pp. 42-65, 2017. [Page]
Hanna Sumita, Naonori Kakimura and Kazuhisa Makino: The Linear Complementarity Problems with a Few Variables per Constraint.
Mathematics of Operations Research, 40(4), pp. 1015-1026, 2015. [Page]

Refereed Conference Proceedings

Ayumi Igarashi, Naoyuki Kamiyama, Yasushi Kawase, Warut Suksompong, Hanna Sumita, and Yu Yokoi: Two-Sided Fairness in Many-to-One Matching.
Proceedings of the 21st Conference on Web and Internet Economics (WINE 2025), accepted.
Yuni Iwamasa, Tomoki Matsuda, Shunya Morihira and Hanna Sumita: A general framework for finding diverse solutions via network flow and its applications.
Proceedings of the 36th International Symposium on Algorithms and Computation (ISAAC 2025), accepted.
Tsubasa Harada, Shinji Ito and Hanna Sumita: Bandit Max-Min Fair Allocation.
Proceedings of European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases 2025 (ECML PKDD 2025), pp. 380-397. [Page]
Yasushi Kawase, Vinh Long Phan, Kazuhisa Makino and Hanna Sumita: Scheduling on Identical Machines with Setup Time and Unknown Execution Time.
Proceedings of the 19th Algorithms and Data Structures Symposium (WADS 2025), pp. 41:1-41:16, 2025. [Page]
Yasushi Kawase, Koichi Nishimura and Hanna Sumita: Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets.
Proceedings of the 51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2024), pp. 96:1-96:19, 2024. [Page]
(preprint version: Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods [Page])
Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura and Makoto Yokoo: Towards Optimal Subsidy Bounds for Envy-freeable Allocations.
Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI-24), pp. 9824–9831. [Page]
Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi: New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem.
Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI-24), pp. 12708–12716. [Page]
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, and Ken-ichi Kawarabayashi: Bandit Task Assignment with Unknown Processing Time.
Proceedings of the 37th Annual Conference on Neural Information Processing Systems (NeurIPS 2023), pp. 8937–8957. [Page]
Yasushi Kawase, Hanna Sumita and Yu Yokoi: Random Assignment of Indivisible Goods under Constraints.
Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), pp. 2792–2799. [Page]
Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita: Fair Division with Two-Sided Preferences.
Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), pp. 2756–2764. [Page]
Yasushi Kawase, Atsushi Miyauchi and Hanna Sumita: Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks.
Proceedings of the 16th ACM International WSDM Conference (WSDM 2023), pp. 886–894. [Page]
Yasushi Kawase and Hanna Sumita: Online Max-min Fair Allocation.
Proceedings of the 15th International Symposium on Algorithmic Game Theory (SAGT 2022), pp. 526–543. [Page]
Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, and Hanna Sumita: Online Scheduling on Identical Machines with a Metric State Space.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), pp. 32:1–32:21. [Page]
Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, and Makoto Yokoo: Fair and Truthful Mechanism with Limited Subsidy.
Proceedings of the 21st International Conference on Autonomous Agents and Multi-Agent Systems 2022 (AAMAS 2022), pp. 534–542. [Page]
Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, and Ken-ichi Kawarabayashi: Online Task Assignment Problems with Reusable Resources.
Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI-22), pp. 5199–5207. [Page]
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, and Ken-ichi Kawarabayashi: A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics (AISTATS 2021), pp. 130:3367–3375. [Page]
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, and Ken-ichi Kawarabayashi: Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions.
Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI-21), pp. 9791–9798. [Page]
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, and Ken-ichi Kawarabayashi: Delay and Cooperation in Nonstochastic Linear Bandits.
Proceedings of the 34th Annual Conference on Neural Information Processing Systems (NeurIPS 2020), pp. 4872–4883. [Page]
Yasushi Kawase and Hanna Sumita: On the Max-min Fair Stochastic Allocation of Indivisible Goods.
Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI-20), pp. 2070–2078. [Paper]
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, and Ken-ichi Kawarabayashi: Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback.
Proceedings of the 33rd Annual Conference on Neural Information Processing Systems (NeurIPS 2019), pp. 10589–10598. [Page]
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, and Ken-ichi Kawarabayashi: Improved Regret Bounds for Bandit Combinatorial Optimization.
Proceedings of the 33rd Annual Conference on Neural Information Processing Systems (NeurIPS 2019), pp. 12027–12036. [Page]
Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, and Ken-ichi Kawarabayashi: Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising.
Proceedings of the 16th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2019), pp. 568–582. [Page]
Yasushi Kawase and Hanna Sumita: Randomized Strategies for Robust Combinatorial Optimization.
Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI-19), pp. 7876–7883. (acceptance ratio 1,150/7,095 = 16.2%) [Page]
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi: Regret Bounds for Online Portfolio Selection with a Cardinality Constraint.
Proceedings of the 32nd Annual Conference on Neural Information Processing Systems (NeurIPS 2018), pp. 10588–10597. [Page]
Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi: Causal Bandits with Propagating Inference.
Proceedings of the 35th International Conference on Machine Learning (ICML 2018), pp. 5512–5520. [Paper]
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi: Online Regression with Partial Information: Generalization and Linear Projection.
Proceedings of the 21st International Conference on Artificial Intelligence and Statistics (AISTATS 2018), pp. 1599–1607. [Paper]
Yasushi Kawase, Hanna Sumita and Takuro Fukunaga: Submodular maximization with uncertain knapsack capacity.
Proceedings of the 13th Latin American Theoretical Informatics (LATIN 2018), pp. 653–668. [Paper]
Yasushi Kawase, Kei Kimura, Kazuhisa Makino and Hanna Sumita: Optimal Matroid Partitioning Problems.
Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), pp. 51:1–51:13. [Paper]
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura and Ken-ichi Kawarabayashi: Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation.
Proceedings of the 31st Annual Conference on Neural Information Processing Systems (NIPS 2017), pp. 4102–4111. [Page]
Hanna Sumita, Yuma Yonebayashi, Naonori Kakimura and Ken-ichi Kawarabayashi: An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization.
Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 4412–4418. [Page]
Hanna Sumita, Yasushi Kawase, Sumio Fujita and Takuro Fukunaga: Online Optimization of Video-Ad Allocation.
Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 423–429. [Page]
Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono and Ken-ichi Kawarabayashi: Optimal Pricing for Submodular Valuations with Bounded Curvature.
Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI-17), pp. 622–628. [Page]
Hanna Sumita, Naonori Kakimura and Kazuhisa Makino: Parameterized Complexity of Sparse Linear Complementarity Problems.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), pp. 355–364. [Page]
Hanna Sumita, Naonori Kakimura and Kazuhisa Makino: Sparse Linear Complementarity Problems.
Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC 2013), pp. 358–369. [Page]

Preprints

Tsubasa Harada, Yasushi Kawase and Hanna Sumita: Online Algorithms for Repeated Optimal Stopping: Achieving Both Competitive Ratio and Regret Bounds.
arXiv:2511.04484, 2025. [Page]

Book

Advanced Mathematical Science for Mobility Society, Springer, 2024. (Editor and Chapter 9 author)

International Conference

Yasushi Kawase, Koichi Nishimura and Hanna Sumita: Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets.
The 13th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Tokyo, Japan, May 2025.
Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita: Fair Division with Two-Sided Preferences.
The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), Macao, August 2023.
Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, and Ken-ichi Kawarabayashi: Online Task Assignment Problems with Reusable Resources. (Oral and poster)
The 36th AAAI Conference on Artificial Intelligence (AAAI-22), virtual, February 2022.
Yasushi Kawase and Hanna Sumita: Randomized Strategies for Robust Combinatorial Optimization. (highlight and poster)
The 33rd AAAI Conference on Artificial Intelligence (AAAI 2019), Honolulu, USA, January 2019.
Hanna Sumita, Yuma Yonebayashi, Naonori Kakimura and Ken-ichi Kawarabayashi: An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization.
The 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia, August 2017.
Yasushi Kawase, Kei Kimura, Kazuhisa Makino and Hanna Sumita: Min-sum-max matroid partitioning problem.
The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, May 2017.
Hanna Sumita, Naonori Kakimura and Kazuhisa Makino: Parameterized Complexity of Sparse Linear Complementarity Problems.
The 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Patras, Greece, September 2015.
Hanna Sumita, Naonori Kakimura and Kazuhisa Makino: Total Dual Integrality of the Linear Complementarity Problem.
The 22nd International Symposium on Mathematical Programming (ISMP 2015), Pittsburgh, USA, July 2015.
Hanna Sumita, Naonori Kakimura and Kazuhisa Makino: Total Dual Integrality of the Linear Complementarity Problem.
The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Fukuoka, Japan, June 2015.
Hanna Sumita, Naonori Kakimura and Kazuhisa Makino: Sparse Linear Complementarity Problems.
The 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Veszprem, Hungary, June 2013.
Hanna Sumita, Naonori Kakimura and Kazuhisa Makino: Sparse Linear Complementarity Problems.
The 8th International Conference on Algorithms and Complexity (CIAC 2013), Barcelona, Spain, May 2013.

Domestic Conferences (in Japanese)

河瀬康志，西村康一，澄田範奈: 連続と離散のハイブリッド凸集合上の対称凸関数最小化，
2024年日本オペレーションズ・リサーチ学会秋季研究発表会，南山大学，2024年9月.
河瀬康志，澄田範奈: オンライン割当における最小効用最大化，
第21回情報科学技術フォーラム（FIT2022）, 慶應義塾大学（ハイブリッド）, 2022年9月.FIT論文賞
河瀬康志，澄田範奈，福永拓郎: 不確実なナップサック制約をもつ劣モジュラ関数最大化，
電子情報通信学会 COMP-ELC学生シンポジウム, 東京電機大学, 2018年3月. 招待講演
前原貴憲，河瀬康志，澄田範奈，東野克哉，河原林健一: 劣モジュラ評価関数をもつ最適価格付け問題，
2017年日本オペレーションズ・リサーチ学会春季研究発表会，沖縄県市町村自治会館，2017年3月.
澄田範奈，河瀬康志，藤田澄男，福永拓郎: 動画広告割当のオンライン最適化，
日本応用数理学会2016年年会，北九州国際会議場，2016年9月.
澄田範奈，河瀬康志，藤田澄男，福永拓郎: 動画広告割当のオンライン最適化，
日本オペレーションズ・リサーチ学会関西支部研究講演会，常翔学園大阪センター，2016年7月.
澄田範奈，垣村尚徳，牧野和久: 線形相補性問題のパラメータ化計算量，
2015年日本オペレーションズ・リサーチ学会春季研究発表会，東京理科大学，2015年3月.
澄田範奈，垣村尚徳，牧野和久: 線形相補性問題のパラメータ化計算量，
電子情報通信学会 COMP-ELC学生シンポジウム, 立命館大学, 2015年3月. 最優秀論文賞
澄田範奈，垣村尚徳，牧野和久: 方向つき線形相補性問題の計算複雑度，
2014年日本オペレーションズ・リサーチ学会秋季研究発表会，北海道科学大学，2014年8月.
澄田範奈，垣村尚徳，牧野和久: 線形相補性問題の完全双対整数性，
日本オペレーションズ・リサーチ学会「最適化の理論と応用」研究部会SOTA，筑波大学，2014年6月.
澄田範奈，垣村尚徳，牧野和久: 線形相補性問題の整数性，
研究集会「最適化：モデリングとアルゴリズム」, 政策研究大学院大学, 2014年3月.
澄田範奈，垣村尚徳，牧野和久: 線形相補性問題の完全双対整数性，
電子情報通信学会 COMP-ELC学生シンポジウム, 新潟大学, 2014年3月.
澄田範奈，垣村尚徳，牧野和久: 線形相補性問題の完全双対整数性，
2014年日本オペレーションズ・リサーチ学会春季研究発表会，大阪大学，2014年3月.
澄田範奈，垣村尚徳，牧野和久: 疎な線形相補性問題に対する組合せ的アルゴリズム，
電子情報通信学会 COMP学生シンポジウム, 岐阜大学, 2013年3月.
澄田範奈，垣村尚徳，牧野和久: 疎な線形相補性問題に対する組合せ的アルゴリズム，
2012年日本オペレーションズ・リサーチ学会秋季研究発表会，ウインクあいち，2012年9月.
澄田範奈，垣村尚徳，牧野和久: 疎な線形相補性問題の計算複雑度，
日本オペレーションズ・リサーチ学会「最適化の理論と応用」研究部会SOTA，筑波大学，2012年6-7月.

Talks in Workshops and Seminars

原田翼，伊藤伸志，澄田範奈: バンディット最大最小効用公平割当，
日本オペレーションズ・リサーチ学会研究部会「最適化の理論とアルゴリズム」（RAOTA）第9回研究会，国立情報学研究所，2025年3月10日. (in Japanese) [Page]
Hanna Sumita: Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods via Hybrid Convex Optimization.
Algorithmics of Fair Division and Social Choice, National University of Singapore, November 25 - December 13 , 2024. [Page]
Yasushi Kawase and Hanna Sumita: Randomized Strategies for Robust Combinatorial Optimization.
NeurIPS Meetup Japan 2020, online, December 9, 2020.
澄田範奈，河瀬康志，藤田澄男，福永拓郎: Online Optimization of Video-Ad Allocation.
ERATO感謝祭 SeasonIV，学術総合センター，2017年8月4日. (in Japanese)
Hanna Sumita, Naonori Kakimura and Kazuhisa Makino: The Linear Complementarity Problem: Sparsity and Integrality.
Mittagsseminar, ETH Zurich, March 19, 2015.

澄田範奈 (Hanna SUMITA)

Publications

Journal Papers

Refereed Conference Proceedings

Preprints

Book

Talks

Research Interest

Teaching

Activities

所属学会 (Domestic)

活動実績

アウトリーチ

CV

Degrees

Career

Award

Grants