← Search

Yusuke Kobayashi

2 accepted papers

2023

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems

AAAI 2023technical

Finding a \emph{single} best solution is the most common objective in combinatorial optimization problems. However, such a single solution may not be applicable to real-world problems as objective functions and constraints are only ``approximately'' formulated for original real-world problems. To so…

Cited by 26SourcePDFScholar
2022

Reforming an Envy-Free Matching

AAAI 2022technical

We consider the problem of reforming an envy-free matching when each agent is assigned a single item. Given an envy-free matching, we consider an operation to exchange the item of an agent with an unassigned item preferred by the agent that results in another envy-free matching. We repeat this opera…

Cited by 5SourcePDFScholar