default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHanna Sumita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Yasushi Kawase, Hanna Sumita:
Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation. Algorithmica 86(2): 566-584 (2024)- [j7]Hiromichi Goko, Ayumi Igarashi
, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
A fair and truthful mechanism with limited subsidy. Games Econ. Behav. 144: 49-70 (2024) - [j6]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair division with two-sided preferences. Games Econ. Behav. 147: 268-287 (2024) - [c30]Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo:
Towards Optimal Subsidy Bounds for Envy-Freeable Allocations. AAAI 2024: 9824-9831 - [c29]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. AAAI 2024: 12708-12716 - [c28]Yasushi Kawase, Koichi Nishimura, Hanna Sumita:
Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets. ICALP 2024: 96:1-96:19 - 2023
- [c27]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair Division with Two-Sided Preferences. IJCAI 2023: 2756-2764 - [c26]Yasushi Kawase, Hanna Sumita, Yu Yokoi:
Random Assignment of Indivisible Goods under Constraints. IJCAI 2023: 2792-2799 - [c25]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Bandit Task Assignment with Unknown Processing Time. NeurIPS 2023 - [c24]Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita:
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. WSDM 2023: 886-894 - [i17]Koichi Nishimura, Hanna Sumita:
Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods. CoRR abs/2302.13342 (2023) - [i16]Yasushi Kawase, Koichi Nishimura, Hanna Sumita:
Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods. CoRR abs/2306.05986 (2023) - [i15]Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo:
Towards Optimal Subsidy Bounds for Envy-freeable Allocations. CoRR abs/2308.11230 (2023) - [i14]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. CoRR abs/2312.12400 (2023) - 2022
- [c23]Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Online Task Assignment Problems with Reusable Resources. AAAI 2022: 5199-5207 - [c22]Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
Fair and Truthful Mechanism with Limited Subsidy. AAMAS 2022: 534-542 - [c21]Yasushi Kawase, Hanna Sumita:
Online Max-min Fair Allocation. SAGT 2022: 526-543 - [c20]Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita:
Online Scheduling on Identical Machines with a Metric State Space. STACS 2022: 32:1-32:21 - [i13]Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Online Task Assignment Problems with Reusable Resources. CoRR abs/2203.07605 (2022) - [i12]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair Division with Two-Sided Preferences. CoRR abs/2206.05879 (2022) - [i11]Yasushi Kawase, Hanna Sumita, Yu Yokoi:
Random Assignment of Indivisible Goods under Constraints. CoRR abs/2208.07666 (2022) - [i10]Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita:
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. CoRR abs/2211.03306 (2022) - 2021
- [j5]Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita:
Optimal Matroid Partitioning Problems. Algorithmica 83(6): 1653-1676 (2021) - [c19]Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. AAAI 2021: 9791-9798 - [c18]Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. AISTATS 2021: 3367-3375 - [i9]Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. CoRR abs/2101.07957 (2021) - [i8]Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
Fair and Truthful Mechanism with Limited Subsidy. CoRR abs/2105.01801 (2021) - [i7]Yasushi Kawase, Hanna Sumita:
Online Max-min Fair Allocation. CoRR abs/2111.07235 (2021) - 2020
- [c17]Yasushi Kawase, Hanna Sumita:
On the Max-Min Fair Stochastic Allocation of Indivisible Goods. AAAI 2020: 2070-2078 - [c16]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Delay and Cooperation in Nonstochastic Linear Bandits. NeurIPS 2020
2010 – 2019
- 2019
- [j4]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Total dual integrality of the linear complementarity problem. Ann. Oper. Res. 274(1-2): 531-553 (2019) - [j3]Yasushi Kawase, Hanna Sumita, Takuro Fukunaga:
Submodular Maximization with Uncertain Knapsack Capacity. SIAM J. Discret. Math. 33(3): 1121-1145 (2019) - [c15]Yasushi Kawase, Hanna Sumita:
Randomized Strategies for Robust Combinatorial Optimization. AAAI 2019: 7876-7883 - [c14]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. NeurIPS 2019: 10589-10598 - [c13]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Improved Regret Bounds for Bandit Combinatorial Optimization. NeurIPS 2019: 12027-12036 - [c12]Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi:
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. PRICAI (1) 2019: 568-582 - [i6]Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi:
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. CoRR abs/1906.05998 (2019) - 2018
- [c11]Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Online Regression with Partial Information: Generalization and Linear Projection. AISTATS 2018: 1599-1607 - [c10]Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi:
Causal Bandits with Propagating Inference. ICML 2018: 5508-5516 - [c9]Yasushi Kawase, Hanna Sumita, Takuro Fukunaga:
Submodular Maximization with Uncertain Knapsack Capacity. LATIN 2018: 653-668 - [c8]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. NeurIPS 2018: 10611-10620 - [i5]Yasushi Kawase, Hanna Sumita, Takuro Fukunaga:
Submodular maximization with uncertain knapsack capacity. CoRR abs/1803.02565 (2018) - [i4]Yasushi Kawase, Hanna Sumita:
Randomized Strategies for Robust Combinatorial Optimization. CoRR abs/1805.07809 (2018) - [i3]Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi:
Causal Bandits with Propagating Inference. CoRR abs/1806.02252 (2018) - 2017
- [j2]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Parameterized Complexity of Sparse Linear Complementarity Problems. Algorithmica 79(1): 42-65 (2017) - [c7]Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi:
Optimal Pricing for Submodular Valuations with Bounded Curvature. AAAI 2017: 622-628 - [c6]Hanna Sumita, Yasushi Kawase, Sumio Fujita, Takuro Fukunaga:
Online Optimization of Video-Ad Allocation. IJCAI 2017: 423-429 - [c5]Hanna Sumita, Yuma Yonebayashi, Naonori Kakimura, Ken-ichi Kawarabayashi:
An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. IJCAI 2017: 4412-4418 - [c4]Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita:
Optimal Matroid Partitioning Problems. ISAAC 2017: 51:1-51:13 - [c3]Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. NIPS 2017: 4099-4108 - [i2]Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita:
Optimal Matroid Partitioning Problems. CoRR abs/1710.00950 (2017) - 2016
- [i1]Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi:
Optimal Pricing for Submodular Valuations with Bounded Curvature. CoRR abs/1611.07605 (2016) - 2015
- [j1]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
The Linear Complementarity Problems with a Few Variables per Constraint. Math. Oper. Res. 40(4): 1015-1026 (2015) - [c2]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Parameterized Complexity of Sparse Linear Complementarity Problems. IPEC 2015: 355-364 - 2013
- [c1]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Sparse Linear Complementarity Problems. CIAC 2013: 358-369
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
