Zobrazeno 1 - 10
of 766
pro vyhledávání: '"Miyazaki, Shuichi"'
Autor:
Kawase, Sota, Miyazaki, Shuichi
The Seat Arrangement Problem is a problem of finding a desirable seat arrangement for given preferences of agents and a seat graph that represents a configuration of seats. In this paper, we consider decision problems of determining if an envy-free a
Externí odkaz:
http://arxiv.org/abs/2411.10719
Autor:
Iwama, Kazuo, Miyazaki, Shuichi
This paper has two objectives. One is to give a linear time algorithm that solves the stable roommates problem (i.e., obtains one stable matching) using the stable marriage problem. The idea is that a stable matching of a roommate instance $I$ is a s
Externí odkaz:
http://arxiv.org/abs/2305.12841
In the online facility assignment problem OFA(k,\ell), there exist k servers with a capacity \ell \geq 1 on a metric space and a request arrives one-by-one. The task of an online algorithm is to irrevocably match a current request with one of the ser
Externí odkaz:
http://arxiv.org/abs/2207.05308
To mitigate the imbalance in the number of assignees in the Hospitals/Residents problem, Goko et al. [Goko et al., Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties, Proc. STACS 2022, pp. 31:1--31:20] studied the Hospital
Externí odkaz:
http://arxiv.org/abs/2203.06660
Autor:
Tasaki, Wataru, Nakano, Kenta, Sato, Yosuke, Koyano, Tamotsu, Miyazaki, Shuichi, Kim, Hee Young
Publikováno v:
In Materials Science & Engineering A August 2024 908
Autor:
Hamada, Koki, Miyazaki, Shuichi
The Hospitals/Residents problem (HR) is a many-to-one matching problem whose solution concept is stability. It is widely used in assignment systems such as assigning medical students (residents) to hospitals. To resolve imbalance in the number of res
Externí odkaz:
http://arxiv.org/abs/2107.03123
Autor:
Hamada, Koki, Miyazaki, Shuichi
Publikováno v:
In Theoretical Computer Science 21 March 2024 989
Motivated by the serious problem that hospitals in rural areas suffer from a shortage of residents, we study the Hospitals/Residents model in which hospitals are associated with lower quotas and the objective is to satisfy them as much as possible. W
Externí odkaz:
http://arxiv.org/abs/2105.03093
In this paper, we study two variants of the online metric matching problem. The first problem is the online metric matching problem where all the servers are placed at one of two positions in the metric space. We show that a simple greedy algorithm a
Externí odkaz:
http://arxiv.org/abs/2008.08415
In IWOCA 2019, Ruangwises and Itoh introduced stable noncrossing matchings, where participants of each side are aligned on each of two parallel lines, and no two matching edges are allowed to cross each other. They defined two stability notions, stro
Externí odkaz:
http://arxiv.org/abs/2001.08468