arbiter
JournalsAccount

Minimizing Symmetric Convex Functions over a Hybrid of Continuous and Discrete Convex Sets

Yasushi Kawase et al.

Mathematics of Operations Research2026https://doi.org/10.1287/moor.2024.0659article
AJG 3ABDC A
Weight
0.50

Abstract

We study the problem of minimizing a given symmetric strictly convex function over the Minkowski sum of an integral base-polyhedron and an M-convex set. This problem has a hybrid of continuous and discrete structures. This relates to allocating mixed goods, consisting of both divisible and indivisible goods, to agents with binary valuations so that the fairness measure, such as the Nash welfare, is maximized. Integral base-polyhedra and M-convex sets have similar and nice properties, and the nonhybrid case can be solved in polynomial time. Whereas the hybrid case lacks some of these properties, we show structures of an optimal solution. Through our findings, we demonstrate that our problem is NP-hard even in the fair allocation setting where all indivisible goods are identical. Moreover, we provide a polynomial-time algorithm for the fair allocation problem when all divisible goods are identical. Funding: This work was supported by Precursory Research for Embryonic Science and Technology (JST PRESTO) [Grant JPMJPR2122], Exploratory Research for Advanced Technology (JST ERATO) [Grant JPMJER2301], the Japan Society for the Promotion of Science (JSPS KAKENHI) [Grants JP20K19739, JP21H03397, JP21K17708, and JP25K00137], and Value Exchange Engineering, a joint research project between R4D, Mercari, Inc., and the RIISE.

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1287/moor.2024.0659

Or copy a formatted citation

@article{yasushi2026,
  title        = {{Minimizing Symmetric Convex Functions over a Hybrid of Continuous and Discrete Convex Sets}},
  author       = {Yasushi Kawase et al.},
  journal      = {Mathematics of Operations Research},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1287/moor.2024.0659},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Minimizing Symmetric Convex Functions over a Hybrid of Continuous and Discrete Convex Sets

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.