Yasushi Kawase | DeepAI

AI Chat

Featured Co-authors

Warut Suksompong
55 publications
Yusuke Kobayashi
36 publications
Ken-ichi Kawarabayashi
33 publications
Ayumi Igarashi
26 publications
Naonori Kakimura
18 publications
Hirotaka Ono
18 publications
Yu Yokoi
17 publications
Kazuhisa Makino
17 publications
Yutaro Yamaguchi
16 publications
Hanna Sumita
14 publications
Atsushi Miyauchi
11 publications

∙ 08/22/2023

Towards Optimal Subsidy Bounds for Envy-freeable Allocations

We study the fair division of indivisible items with subsidies among n a...

0 Yasushi Kawase, et al. ∙

∙ 08/18/2023

The Last Success Problem with a Single Sample

The last success problem is an optimal stopping problem that aims to max...

0 Toru Yoshinaga, et al. ∙

∙ 06/09/2023

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods

The fair allocation of mixed goods, consisting of both divisible and ind...

0 Yasushi Kawase, et al. ∙

∙ 05/15/2023

Size-stochastic Knapsack Online Contention Resolution Schemes

Online contention resolution schemes (OCRSs) are effective rounding tech...

0 Toru Yoshinaga, et al. ∙

∙ 11/07/2022

Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks

Network analysis has played a key role in knowledge discovery and data m...

0 Yasushi Kawase, et al. ∙

∙ 09/02/2022

Optimal design of lottery with cumulative prospect theory

A lottery is a popular form of gambling between a seller and multiple bu...

0 Shunta Akiyama, et al. ∙

∙ 08/16/2022

Random Assignment of Indivisible Goods under Constraints

We consider the problem of random assignment of indivisible goods, in wh...

0 Yasushi Kawase, et al. ∙

∙ 06/13/2022

Fair Division with Two-Sided Preferences

We study a fair division setting in which a number of players are to be ...

0 Ayumi Igarashi, et al. ∙

∙ 11/14/2021

Online Max-min Fair Allocation

We study an online version of the max-min fair allocation problem for in...

0 Yasushi Kawase, et al. ∙

∙ 05/05/2021

Fair and Truthful Mechanism with Limited Subsidy

The notion of envy-freeness is a natural and intuitive fairness requirem...

0 Hiromichi Goko, et al. ∙

∙ 07/16/2020

Fair Ride Allocation on a Line

With the advent of the ride-sharing platform, the carpooling has become ...

0 Yuki Amano, et al. ∙

∙ 09/22/2019

Online Knapsack Problems with a Resource Buffer

In this paper, we introduce online knapsack problems with a resource buf...

0 Xin Han, et al. ∙

∙ 07/09/2019

Approximately Stable Matchings with General Constraints

This paper focuses on two-sided matching where one side (a hospital or f...

0 Yasushi Kawase, et al. ∙

∙ 06/14/2019

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

Computational advertising has been studied to design efficient marketing...

0 Daisuke Hatano, et al. ∙

∙ 05/17/2019

Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation

Aggregating responses from crowd workers is a fundamental task in the pr...

0 Yasushi Kawase, et al. ∙

∙ 11/22/2018

Tight Approximation for Unconstrained XOS Maximization

A set function is called XOS if it can be represented by the maximum of ...

0 Yasushi Kawase, et al. ∙

∙ 06/30/2018

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

The parity of the length of paths and cycles is a classical and well-stu...

0 Yasushi Kawase, et al. ∙

∙ 05/20/2018

Randomized Strategies for Robust Combinatorial Optimization

In this paper, we study the following robust optimization problem. Given...

0 Yasushi Kawase, et al. ∙

∙ 04/27/2018

Subgame Perfect Equilibria of Sequential Matching Games

We study a decentralized matching market in which firms sequentially mak...

0 Yasushi Kawase, et al. ∙

∙ 04/27/2018

Computing a Subgame Perfect Equilibrium of a Sequential Matching Game

We study a decentralized matching market in which each firm sequentially...

0 Yasushi Kawase, et al. ∙

∙ 03/07/2018

Submodular maximization with uncertain knapsack capacity

We consider the maximization problem of monotone submodular functions un...

0 Yasushi Kawase, et al. ∙

∙ 11/17/2017

Approximately Stable Matchings with Budget Constraints

This paper considers two-sided matching with budget constraints where on...

0 Yasushi Kawase, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world