DP-BASED ALGORITHM AND FPTAS FOR THE KNAPSACK SHARING AND RELATED PROBLEMS
-
- Kataoka Seiji
- National Defense Academy
-
- Yamada Takeo
- National Defense Academy, Emeritus
この論文をさがす
説明
<p>In the knapsack sharing problem (KSP), formulated previously, we considered a game-theoretic situation in which two or more players (agents) compete for their share of capacity in a knapsack with their respective sets of items. As an extension of this problem, we formulate the extended knapsack sharing problem (XKSP). This is actually a family of KSP-like problems, and we present a dynamic programming-based (DP-based), pseudo-polynomial time algorithm to solve XKSP to optimality in a unified way. XKSP is shown to be {\cal NP}-hard, but due to the existence of this pseudo-polynomial time algorithm, it is only weakly {\cal NP}-hard. Next, we develop an algorithm to solve the problem approximately in polynomial time by decomposing it into a series of subproblems. Furthermore, we introduce a scaling factor into the DP computation to obtain a fully polynomial time approximation scheme (FPTAS) for XKSP with two agents. Extension to the case of more than two agents is discussed, together with a non-DP-based PTAS.</p>
収録刊行物
-
- 日本オペレーションズ・リサーチ学会論文誌
-
日本オペレーションズ・リサーチ学会論文誌 62 (1), 1-14, 2019-01-31
公益社団法人 日本オペレーションズ・リサーチ学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390282763097091072
-
- NII論文ID
- 130007584395
-
- NII書誌ID
- AA00703935
-
- ISSN
- 21888299
- 04534514
-
- NDL書誌ID
- 029474262
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可