Analysis of unbounded scheduling problems
| Project/Area Number |
17K19960
|
|---|
| Research Category |
Grant-in-Aid for Challenging Research (Exploratory)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Information science, computer engineering, and related fields
|
|---|
| Research Institution | Kyoto University (2019-2022)
Kyushu University (2017-2018) |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
小野 廣隆 名古屋大学, 情報学研究科, 教授 (00346826)
小林 佑輔 京都大学, 数理解析研究所, 准教授 (40581591)
|
|---|
| Project Period (FY) |
2017-06-30 – 2023-03-31
|
| Project Status |
Completed (Fiscal Year 2022)
|
| Budget Amount *help |
¥6,500,000 (Direct Cost: ¥5,000,000、Indirect Cost: ¥1,500,000)
Fiscal Year 2019: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
Fiscal Year 2018: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
Fiscal Year 2017: ¥2,600,000 (Direct Cost: ¥2,000,000、Indirect Cost: ¥600,000)
|
|---|
| Keywords | スケジューリング / 遷移可能性 / ヘドニックゲーム / 仕事割当 / 警邏問題 / ナッシュ均衡 / 詰込問題 / 最適化 / 周期性 / 資源配置 / マルチエージェント / 無羨望性 / 提携構造形成 / 近似率 / 被覆問題 / グラフ探索 / 計算幾何 / 貪慾法 / 算法設計 |
|---|
| Outline of Final Research Achievements |
We studied algorithmic techniques and hardness of several problems related to infinite scheduling, covering problems, and optimization in multi-party settings. We obtained some new algorithms and theoretical bounds for problems of the following types: searching problems on graphs, patrolling problems on graphs, games between the patrollers and the intruder on graphs, competitive diffusion on networks, hedonic games on graphs, reconfiguration problems on graphs, and periodic scheduling of jobs.
|
| Academic Significance and Societal Importance of the Research Achievements |
本研究では、問題設定の記述そのものは単純だが、満すべき目標として「恒常的に保守する」「連続的に漏れなくカバーする」といった安全・安定の要求を課する問題、あるいは多主体がおのおの自己の利益を求めて行動することが最適化に新たな複雑さを呈する問題について、理論的分析を行った。現実的な状況を含んでいると考えられるこれらの問題のいくつかについて、計算手法と困難さの両面から解明が進んだ。
|
Report
(7 results)
Research Products
(28 results)
-
-
-
-
-
[Journal Article] Hedonic Seat Arrangement Problems2020
Author(s)
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
-
Journal Title
Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems
Volume: -
Pages: 1777-1779
Related Report
Peer Reviewed / Int'l Joint Research
-
-
-
-
-
[Journal Article] The perfect matching reconfiguration problem2019
Author(s)
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Muhlenthaler, and Kunihiro Wasa
-
Journal Title
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) / Leibniz International Proceedings in Informatics (LIPIcs)
Volume: 138
Related Report
Peer Reviewed / Open Access / Int'l Joint Research
-
[Journal Article] Computational Complexity of Hedonic Games on Sparse Graphs2019
Author(s)
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
-
Journal Title
Proceedings of the International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2019) / Lecture Notes in Computer Science (LNCS)
Volume: 11873
Pages: 576-584
DOI
ISBN
9783030337919, 9783030337926
Related Report
Peer Reviewed
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
