Yasushi Kawase

Algorithmica, February, 2024

Efficient matching under general constraints.

[BibT_eX]

[DOI]

Kenzo Imamura

Games Econ. Behav., 2024

Fair division with two-sided preferences.

[BibT_eX]

[DOI]

Games Econ. Behav., 2024

A fair and truthful mechanism with limited subsidy.

[BibT_eX]

[DOI]

Games Econ. Behav., 2024

Online Matching with Delays and Size-based Costs.

[BibT_eX]

[DOI]

Tomohiro Nakayoshi

CoRR, 2024

Contiguous Allocation of Indivisible Items on a Path.

[BibT_eX]

[DOI]

Mohammad Azharuddin Sanpui

Bodhayan Roy

CoRR, 2024

Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets.

[BibT_eX]

[DOI]

Koichi Nishimura

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

The Last Success Problem with Samples.

[BibT_eX]

[DOI]

Toru Yoshinaga

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Contiguous Allocation of Binary Valued Indivisible Items on a Path.

[BibT_eX]

[DOI]

Mohammad Azharuddin Sanpui

Bodhayan Roy

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Towards Optimal Subsidy Bounds for Envy-Freeable Allocations.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

The Last Success Problem with a Single Sample.

[BibT_eX]

[DOI]

Toru Yoshinaga

CoRR, 2023

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods.

[BibT_eX]

[DOI]

Koichi Nishimura

CoRR, 2023

Size-stochastic Knapsack Online Contention Resolution Schemes.

[BibT_eX]

[DOI]

Toru Yoshinaga

CoRR, 2023

Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023

Reusing Cardboard for Packaging Boxes with a Computational Design System.

[BibT_eX]

[DOI]

Proceedings of the Adjunct Proceedings of the 36th Annual ACM Symposium on User Interface Software and Technology, 2023

Random Assignment of Indivisible Goods under Constraints.

[BibT_eX]

[DOI]

Yu Yokoi

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Optimal design of lottery with cumulative prospect theory.

[BibT_eX]

[DOI]

Shunta Akiyama

Mitsuaki Obara

CoRR, 2022

Online Scheduling on Identical Machines with a Metric State Space.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Online Max-min Fair Allocation.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Fair Ride Allocation on a Line.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

2021

Tight Approximation for Unconstrained XOS Maximization.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

Additive approximation algorithms for modularity maximization.

[BibT_eX]

[DOI]

Tomomi Matsui

J. Comput. Syst. Sci., 2021

Subgame perfect equilibria under the deferred acceptance algorithm.

[BibT_eX]

[DOI]

Keisuke Bando

Int. J. Game Theory, 2021

Optimal Matroid Partitioning Problems.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Subgame Perfect Equilibria of Sequential Matching Games.

[BibT_eX]

[DOI]

Yu Yokoi

ACM Trans. Economics and Comput., 2020

Finding a path with two labels forbidden in group-labeled graphs.

[BibT_eX]

[DOI]

Yusuke Kobayashi

J. Comb. Theory B, 2020

A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Performance as a Constraint: An Improved Wisdom of Crowds Using Performance Regularization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Approximately Stable Matchings with General Constraints.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

On the Max-Min Fair Stochastic Allocation of Indivisible Goods.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Proportional cost buyback problem with weight bounds.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Submodular Maximization with Uncertain Knapsack Capacity.

[BibT_eX]

[DOI]

Takuro Fukunaga

SIAM J. Discret. Math., 2019

Unit Cost Buyback Problem.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Surrogate optimization for p-norms.

[BibT_eX]

[DOI]

Discret. Optim., 2019

Antimatroids induced by matchings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Approximately Stable Matchings with General Constraints.

[BibT_eX]

[DOI]

Atsushi Iwasaki

CoRR, 2019

Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Proceedings of the PRICAI 2019: Trends in Artificial Intelligence, 2019

Online Knapsack Problems with a Resource Buffer.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation.

[BibT_eX]

[DOI]

Yuko Kuroki

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Randomized Strategies for Robust Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Tight Approximation for Unconstrained XOS Maximization.

[BibT_eX]

[DOI]

Yusuke Kobayashi

CoRR, 2018

Optimal Composition Ordering Problems for Piecewise Linear Functions.

[BibT_eX]

[DOI]

Kento Seimi

Algorithmica, 2018

The Densest Subgraph Problem with a Convex/Concave Size Function.

[BibT_eX]

[DOI]

Algorithmica, 2018

Computing a Subgame Perfect Equilibrium of a Sequential Matching Game.

[BibT_eX]

[DOI]

Yu Yokoi

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Approximately Stable Matchings With Budget Constraints.

[BibT_eX]

[DOI]

Atsushi Iwasaki

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Stochastic Input Models in Online Computing.

[BibT_eX]

[DOI]

CoRR, 2017

Online Optimization of Video-Ad Allocation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Near-Feasible Stable Matchings with Budget Constraints.

[BibT_eX]

[DOI]

Atsushi Iwasaki

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Optimal Stopping Rules for Sequential Hypothesis Testing.

[BibT_eX]

[DOI]

Constantinos Daskalakis

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Optimal Pricing for Submodular Valuations with Bounded Curvature.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2015

Randomized algorithms for online knapsack problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On packing arborescences in temporal networks.

[BibT_eX]

[DOI]

Naoyuki Kamiyama

Inf. Process. Lett., 2015

Z-score-based modularity for community detection in networks.

[BibT_eX]

[DOI]

CoRR, 2015

Scalable sensor localization via ball-decomposition algorithm.

[BibT_eX]

[DOI]

Takanori Maehara

Ken-ichi Kawarabayashi

Proceedings of the 14th IFIP Networking Conference, 2015

The Secretary Problem with a Choice Function.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Finding a Path in Group-Labeled Graphs with Two Labels Forbidden.

[BibT_eX]

[DOI]

Yusuke Kobayashi

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

What Is a Network Community?: A Novel Quality Function and Detection Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014

Online removable knapsack problem under convex function.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Online Unweighted Knapsack Problem with Removal Cost.

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

Nash equilibria with minimum potential in undirected broadcast games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Randomized Algorithms for Removable Online Knapsack Problems.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

Online Knapsack Problem with Removal Cost.

[BibT_eX]

[DOI]