4 citations · 12 across the 21 of their papers we have counts for
3 papers · 1 filter
Tight Approximation for Unconstrained XOS Maximization
Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi +1
A set function is called XOS if it can be represented by the maximum of additive functions. When such a representation is fixed, the number of additive functions required to define…
Finding a Path with Two Labels Forbidden in Group-Labeled Graphs
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
The parity of the length of paths and cycles is a classical and well-studied topic in graph theory and theoretical computer science. The parity constraints can be extended to label…
Subgame Perfect Equilibria of Sequential Matching Games
Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi
We study a decentralized matching market in which firms sequentially make offers to potential workers. For each offer, the worker can choose "accept" or "reject," but the decision…