2023年09月13日 / 最終更新日 : 2023年09月13日ワーキングペーパー

[UTMD-055] Decomposition of an Integrally Convex Set into a Minkowski Sum of Bounded and Conic Integrally Convex Sets (by Kazuo Murota, Akihisa Tamura)

Author

Kazuo Murota, Akihisa Tamura

Abstract

Every polyhedron can be decomposed into a Minkowski sum (or vector sum) of a bounded polyhedron and a polyhedral cone. This paper establishes similar statements for some classes of discrete sets in discrete convex analysis, such as integrally convex sets, L♮-convex sets, and M♮-convex sets.

PDF

カテゴリー: ワーキングペーパー

[UTMD-055] Decomposition of an Integrally Convex Set into a Minkowski Sum of Bounded and Conic Integrally Convex Sets (by Kazuo Murota, Akihisa Tamura)

Author

Abstract

[UTMD-054] Shapley–Folkman-type Theorem for Integrally Convex Sets (by Kazuo Murota, Akihisa Tamura)

[UTMD-056] Strategyproof Allocation Mechanisms with Endowments and M-convex Distributional Constraints (published in Artificial Intelligence, by Takamasa Suzuki, Akihisa Tamura, Kentaro Yahiro, Makoto Yokoo, Yuzhe Zhang)