Yasushi Kawase

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 78

Top Topics

Combinatorial Optimization

Subgame Perfect

Budget Constraints

Top Venues

Publications

Kenzo Imamura, Yasushi Kawase
Efficient matching under general constraints. Games Econ. Behav. 145 (2024)
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
Contiguous Allocation of Indivisible Items on a Path. CoRR (2024)
Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita
Fair division with two-sided preferences. Games Econ. Behav. 147 (2024)
Yasushi Kawase, Koichi Nishimura, Hanna Sumita
Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets. ICALP (2024)
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
Contiguous Allocation of Binary Valued Indivisible Items on a Path. AAMAS (2024)
Yasushi Kawase, Hanna Sumita
Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation. Algorithmica 86 (2) (2024)
Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo
Towards Optimal Subsidy Bounds for Envy-Freeable Allocations. AAAI (2024)
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 (2024)
Yasushi Kawase, Hanna Sumita, Yu Yokoi
Random Assignment of Indivisible Goods under Constraints. IJCAI (2023)
Yasushi Kawase, Koichi Nishimura, Hanna Sumita
Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods. CoRR (2023)
Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita
Fair Division with Two-Sided Preferences. IJCAI (2023)
Toru Yoshinaga, Yasushi Kawase
The Last Success Problem with a Single Sample. CoRR (2023)
Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. WSDM (2023)
Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo
Towards Optimal Subsidy Bounds for Envy-freeable Allocations. CoRR (2023)
Kazuki Koyama, Koya Narumi, Ken Takaki, Yasushi Kawase, Ari Hautasaari, Yoshihiro Kawahara
Reusing Cardboard for Packaging Boxes with a Computational Design System. UIST (Adjunct Volume) (2023)
Toru Yoshinaga, Yasushi Kawase
Size-stochastic Knapsack Online Contention Resolution Schemes. CoRR (2023)
Yasushi Kawase, Hanna Sumita, Yu Yokoi
Random Assignment of Indivisible Goods under Constraints. CoRR (2022)
Shunta Akiyama, Mitsuaki Obara, Yasushi Kawase
Optimal design of lottery with cumulative prospect theory. CoRR (2022)
Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. CoRR (2022)
Yasushi Kawase, Hanna Sumita
Online Max-min Fair Allocation. SAGT (2022)
Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita
Online Scheduling on Identical Machines with a Metric State Space. STACS (2022)
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)
Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita
Fair Division with Two-Sided Preferences. CoRR (2022)
Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono
Fair Ride Allocation on a Line. SAGT (2022)
Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
Additive approximation algorithms for modularity maximization. J. Comput. Syst. Sci. 117 (2021)
Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita
Optimal Matroid Partitioning Problems. Algorithmica 83 (6) (2021)
Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo
Fair and Truthful Mechanism with Limited Subsidy. CoRR (2021)
Yasushi Kawase, Keisuke Bando
Subgame perfect equilibria under the deferred acceptance algorithm. Int. J. Game Theory 50 (2) (2021)
Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Tight Approximation for Unconstrained XOS Maximization. Math. Oper. Res. 46 (4) (2021)
Yasushi Kawase, Hanna Sumita
Online Max-min Fair Allocation. CoRR (2021)
Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi
Subgame Perfect Equilibria of Sequential Matching Games. ACM Trans. Economics and Comput. 7 (4) (2020)
Yasushi Kawase
Approximately Stable Matchings with General Constraints. AAMAS (2020)
Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono
Fair Ride Allocation on a Line. CoRR (2020)
Jiyi Li, Yasushi Kawase, Yukino Baba, Hisashi Kashima
Performance as a Constraint: An Improved Wisdom of Crowds Using Performance Regularization. IJCAI (2020)
Yasushi Kawase, Hanna Sumita
On the Max-Min Fair Stochastic Allocation of Indivisible Goods. AAAI (2020)
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Finding a path with two labels forbidden in group-labeled graphs. J. Comb. Theory, Ser. B 143 (2020)
Yusei Fujimori, Yasushi Kawase, Tomomi Matsui, Akiyoshi Shioura
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption. Inf. Process. Lett. 162 (2020)
Yasushi Kawase, Xin Han, Kazuhisa Makino
Proportional cost buyback problem with weight bounds. Theor. Comput. Sci. 774 (2019)
Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. CoRR (2019)
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)
Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. CoRR (2019)
Yasushi Kawase, Yutaro Yamaguchi
Antimatroids induced by matchings. Discret. Appl. Math. 257 (2019)
Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. IJCAI (2019)
Yasushi Kawase, Kazuhisa Makino
Surrogate optimization for p-norms. Discret. Optim. 34 (2019)
Yasushi Kawase, Atsushi Iwasaki
Approximately Stable Matchings with General Constraints. CoRR (2019)
Yasushi Kawase, Hanna Sumita
Randomized Strategies for Robust Combinatorial Optimization. AAAI (2019)
Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
Submodular Maximization with Uncertain Knapsack Capacity. SIAM J. Discret. Math. 33 (3) (2019)
Yasushi Kawase, Xin Han, Kazuhisa Makino
Unit Cost Buyback Problem. Theory Comput. Syst. 63 (6) (2019)
Xin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku
Online Knapsack Problems with a Resource Buffer. ISAAC (2019)
Xin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku
Online Knapsack Problems with a Resource Buffer. CoRR (2019)
Yasushi Kawase, Kazuhisa Makino, Kento Seimi
Optimal Composition Ordering Problems for Piecewise Linear Functions. Algorithmica 80 (7) (2018)
Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
Submodular Maximization with Uncertain Knapsack Capacity. LATIN (2018)
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Tight Approximation for Unconstrained XOS Maximization. CoRR (2018)
Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
Submodular maximization with uncertain knapsack capacity. CoRR (2018)
Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. EC (2018)
Yasushi Kawase, Hanna Sumita
Randomized Strategies for Robust Combinatorial Optimization. CoRR (2018)
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. CoRR (2018)
Yasushi Kawase, Atsushi Iwasaki
Approximately Stable Matchings With Budget Constraints. AAAI (2018)
Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. CoRR (2018)
Yasushi Kawase, Atsushi Miyauchi
The Densest Subgraph Problem with a Convex/Concave Size Function. Algorithmica 80 (12) (2018)
Yasushi Kawase, Atsushi Miyauchi
The Densest Subgraph Problem with a Convex/Concave Size Function. CoRR (2017)
Yasushi Kawase, Atsushi Iwasaki
Approximately Stable Matchings with Budget Constraints. CoRR (2017)
Hanna Sumita, Yasushi Kawase, Sumio Fujita, Takuro Fukunaga
Online Optimization of Video-Ad Allocation. IJCAI (2017)
Yasushi Kawase, Atsushi Iwasaki
Near-Feasible Stable Matchings with Budget Constraints. IJCAI (2017)
Yasushi Kawase, Yutaro Yamaguchi
Antimatroids Induced by Matchings. CoRR (2017)
Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita
Optimal Matroid Partitioning Problems. CoRR (2017)
Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita
Optimal Matroid Partitioning Problems. ISAAC (2017)
Yasushi Kawase, Atsushi Iwasaki
Near-feasible stable matchings with budget constraints. CoRR (2017)
Yasushi Kawase
Stochastic Input Models in Online Computing. CoRR (2017)
Constantinos Daskalakis, Yasushi Kawase
Optimal Stopping Rules for Sequential Hypothesis Testing. ESA (2017)
Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi
Optimal Pricing for Submodular Valuations with Bounded Curvature. AAAI (2017)
Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
Additive Approximation Algorithms for Modularity Maximization. ISAAC (2016)
Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
Additive Approximation Algorithms for Modularity Maximization. CoRR (2016)
Yasushi Kawase, Atsushi Miyauchi
The Densest Subgraph Problem with a Convex/Concave Size Function. ISAAC (2016)
Yasushi Kawase, Kazuhisa Makino
Surrogate Optimization for p-Norms. ISAAC (2016)
Yasushi Kawase, Kazuhisa Makino, Kento Seimi
Optimal Composition Ordering Problems for Piecewise Linear Functions. ISAAC (2016)
Yasushi Kawase, Kazuhisa Makino, Kento Seimi
Optimal Composition Ordering Problems for Piecewise Linear Functions. CoRR (2016)
Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi
Optimal Pricing for Submodular Valuations with Bounded Curvature. CoRR (2016)
Yasushi Kawase, Xin Han, Kazuhisa Makino
Proportional Cost Buyback Problem with Weight Bounds. COCOA (2015)
Naoyuki Kamiyama, Yasushi Kawase
On packing arborescences in temporal networks. Inf. Process. Lett. 115 (2) (2015)
Xin Han, Yasushi Kawase, Kazuhisa Makino
Randomized algorithms for online knapsack problems. Theor. Comput. Sci. 562 (2015)
Atsushi Miyauchi, Yasushi Kawase
What Is a Network Community?: A Novel Quality Function and Detection Algorithms. CIKM (2015)
Atsushi Miyauchi, Yasushi Kawase
Z-score-based modularity for community detection in networks. CoRR (2015)
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. ICALP (1) (2015)
Yasushi Kawase
The Secretary Problem with a Choice Function. ISAAC (2015)
Yasushi Kawase, Takanori Maehara, Ken-ichi Kawarabayashi
Scalable sensor localization via ball-decomposition algorithm. Networking (2015)
Xin Han, Yasushi Kawase, Kazuhisa Makino, He Guo
Online removable knapsack problem under convex function. Theor. Comput. Sci. 540 (2014)
Xin Han, Yasushi Kawase, Kazuhisa Makino
Online Unweighted Knapsack Problem with Removal Cost. Algorithmica 70 (1) (2014)
Xin Han, Yasushi Kawase, Kazuhisa Makino
Randomized Algorithms for Removable Online Knapsack Problems. FAW-AAIM (2013)
Yasushi Kawase, Kazuhisa Makino
Nash equilibria with minimum potential in undirected broadcast games. Theor. Comput. Sci. 482 (2013)
Yasushi Kawase, Xin Han, Kazuhisa Makino
Unit Cost Buyback Problem. ISAAC (2013)
Yasushi Kawase, Kazuhisa Makino
Nash Equilibria with Minimum Potential in Undirected Broadcast Games. WALCOM (2012)
Xin Han, Yasushi Kawase, Kazuhisa Makino
Online Knapsack Problem with Removal Cost. COCOON (2012)