Document Open Access Logo

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

Authors Yasushi Kawase , Koichi Nishimura, Hanna Sumita

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.96.pdf
  • Filesize: 0.83 MB
  • 19 pages

Document Identifiers

Author Details

Yasushi Kawase
  • University of Tokyo, Japan
Koichi Nishimura
  • CRESCO LTD., Japan
Hanna Sumita
  • Tokyo Institute of Technology, Japan

Funding

This work was partially supported by JSPS KAKENHI Grant Numbers JP20K19739, JP21K17708, and JP21H03397, Japan, by JST PRESTO Grant Number JPMJPR2122, Japan, by JST ERATO Grant Number JPMJER2301, Japan, and by Value Exchange Engineering, a joint research project between R4D, Mercari, Inc. and the RIISE.

Acknowledgements

We are grateful to Kazuo Murota, Warut Suksompong, and the anonymous reviewers for their helpful comments.

Cite AsGet BibTex

Yasushi Kawase, Koichi Nishimura, and Hanna Sumita. Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 96:1-96:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.96

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 emerges from the problem of 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. It is known that both an integral base-polyhedron and an M-convex set have similar and nice properties, and the non-hybrid case can be solved in polynomial time. While the hybrid case lacks some of these properties, we show the structure of an optimal solution. Moreover, we exploit a proximity inherent in the problem. 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.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Combinatorial optimization
  • Theory of computation → Algorithmic game theory
Keywords
  • Integral base-polyhedron
  • Fair allocation
  • Matroid

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Nima Anari, Tung Mai, Shayan Oveis Gharan, and Vijay V. Vazirani. Nash social welfare for indivisible items under separable, piecewise-linear concave utilities. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2274-2290, 2018. Google Scholar
  2. Moshe Babaioff, Tomer Ezra, and Uriel Feige. Fair and truthful mechanisms for dichotomous valuations. In Proceedings of the 35th AAAI Conference on Artificial Intelligence, pages 5119-5126, 2021. Google Scholar
  3. S Barman, A Krishna, Y Narahari, and S Sadhukan. Achieving envy-freeness with limited subsidies under dichotomous valuations. In Proceedings of the 31st International Joint Conference on Artificial Intelligence, pages 60-66, 2022. Google Scholar
  4. Siddharth Barman, Sanath Kumar Krishnamurthy, and Rohit Vaish. Greedy algorithms for maximizing Nash social welfare. In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, pages 7-13, 2018. Google Scholar
  5. Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, and Xinhang Lu. Fair division of mixed divisible and indivisible goods. Artificial Intelligence, 293(103436):1-17, 2021. Google Scholar
  6. Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, and Yair Zick. Finding fair and efficient allocations for matroid rank valuations. ACM Transactions on Economics and Computation, 9(4):21:1-21:41, 2021. Google Scholar
  7. Umang Bhaskar, AR Sricharan, and Rohit Vaish. On approximate envy-freeness for indivisible chores and mixed resources. In Proceedings of Approx, 2021. Google Scholar
  8. Johannes Brustle, Jack Dippel, Vishnu V Narayan, Mashbat Suzuki, and Adrian Vetta. One dollar each eliminates envy. In Proceedings of the 21st ACM Conference on Economics and Computation, pages 23-39, 2020. Google Scholar
  9. Ioannis Caragiannis and Stavros D. Ioannidis. Computing envy-freeable allocations with limited subsidies. In Proceedings of the 17th Conference on Web and Internet Economics, pages 522-539, 2022. Google Scholar
  10. Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, and Junxing Wang. The unreasonable fairness of maximum Nash welfare. ACM Transactions on Economics and Computation, 7(3):12:1-12:32, 2019. Google Scholar
  11. Richard Cole, Nikhil Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V. Vazirani, and Sadra Yazdanbod. Convex program duality, Fisher markets, and Nash social welfare. In Proceedings of the 18th ACM Conference on Economics and Computation, pages 459-460, 2017. Google Scholar
  12. Richard Cole and Vasilis Gkatzelis. Approximating the Nash social welfare with indivisible items. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing, pages 371-380, 2015. Google Scholar
  13. Richard Cole and Vasilis Gkatzelis. Approximating the Nash social welfare with indivisible items. SIAM Journal on Computing, 47(3):1211-1236, 2018. Google Scholar
  14. Andreas Darmann and Joachim Schauer. Maximizing Nash product social welfare in allocating indivisible goods. European Journal of Operational Research, 247(2):548-559, 2015. Google Scholar
  15. András Frank and Kazuo Murota. aDecreasing minimization on M-convex sets: background and structures. Mathematical Programming, 195(1-2):977-1025, 2022. Google Scholar
  16. András Frank and Kazuo Murota. bDecreasing minimization on M-convex sets: algorithms and applications. Mathematical Programming, 195(1-2):1027-1068, 2022. Google Scholar
  17. András Frank and Kazuo Murota. Decreasing minimization on base-polyhedra: Relation between discrete and continuous cases. Japan Journal of Industrial and Applied Mathematics, 40(1):183-221, 2023. Google Scholar
  18. Satoru Fujishige. Lexicographically optimal base of a polymatroid with respect to a weight vector. Mathematics of Operations Research, 5(2):186-196, 1980. Google Scholar
  19. Satoru Fujishige. Submodular Functions and Optimization. Elsevier, 2nd edition, 2005. Google Scholar
  20. Satoru Fujishige. Theory of principal partitions revisited. Research Trends in Combinatorial Optimization: Bonn 2008, pages 127-162, 2009. Google Scholar
  21. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman New York, 1979. Google Scholar
  22. Jugal Garg, Martin Hoefer, and Kurt Mehlhorn. Approximating the Nash social welfare with budget-additive valuations. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2326-2340, 2018. Google Scholar
  23. Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, and Makoto Yokoo. A fair and truthful mechanism with limited subsidy. Games and Economic Behavior, 144:49-70, 2024. Google Scholar
  24. Daniel Halpern, Ariel D. Procaccia, Alexandros Psomas, and Nisarg Shah. Fair division with binary valuations: One rule to rule them all. In Proceedings of the 16th International Conference on Web and Internet Economics, pages 370-383, 2020. Google Scholar
  25. Daniel Halpern and Nisarg Shah. Fair division with subsidy. In Proceedings of the 12th International Symposium on Algorithmic Game Theory, pages 374-389, 2019. Google Scholar
  26. Nicholas JA Harvey, Richard E Ladner, László Lovász, and Tami Tamir. Semi-matchings for bipartite graphs and load balancing. Journal of Algorithms, 59(1):53-78, 2006. Google Scholar
  27. Satoru Iwata, Lisa Fleischer, and Satoru Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM, 48(4):761-777, 2001. Google Scholar
  28. Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, and Makoto Yokoo. Towards optimal subsidy bounds for envy-freeable allocations. In Proceedings of the 38th AAAI Conference on Artificial Intelligence, pages 9824-9831, 2024. Google Scholar
  29. Yasushi Kawase, Koichi Nishimura, and Hanna Sumita. Fair allocation with binary valuations for mixed divisible and indivisible goods, 2023. URL: https://arxiv.org/abs/2306.05986.
  30. Euiwoong Lee. APX-hardness of maximizing Nash social welfare with indivisible items. Information Processing Letters, 122:17-20, 2017. Google Scholar
  31. Zihao Li, Shengxin Liu, Xinhang Lu, and Biaoshuai Tao. Truthful fair mechanisms for allocating mixed divisible and indivisible goods. In Proceedings of the 32nd International Joint Conference on Artificial Intelligence, pages 2808-2816, 2023. Google Scholar
  32. Shengxin Liu, Xinhang Lu, Mashbat Suzuki, and Toby Walsh. Mixed fair division: A survey. In Proceedings of the 38th AAAI Conference on Artificial Intelligence, volume 38, pages 22641-22649, 2024. Google Scholar
  33. Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, and Warut Suksompong. Approval-based voting with mixed goods. In Proceedings of the 37th AAAI Conference on Artificial Intelligence, pages 5781-5788, 2023. Google Scholar
  34. F. Maruyama. A unified study on problems in information theory via polymatroids (in Japanese), 1978. Graduation Thesis, University of Tokyo. Google Scholar
  35. Satoko Moriguchi, Shinji Hara, and Kazuo Murota. On continuous/discrete hybrid M^♮-convex functions (in Japanese). Transactions of the Institute of Systems, Control and Information Engineers, 20:84-86, 2007. Google Scholar
  36. Kazuo Murota. Discrete convex analysis. Mathematical Programming, 83(1-3):313-371, 1998. Google Scholar
  37. Kazuo Murota. Discrete Convex Analysis. Society for Industrial and Applied Mathematics, 2003. Google Scholar
  38. Kiyohito Nagano. On convex minimization over base polytopes. In Proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, pages 252-266. Springer, 2007. Google Scholar
  39. Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007. Google Scholar
  40. Koichi Nishimura and Hanna Sumita. Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods. arXiv:2302.13342, 2023. URL: https://arxiv.org/abs/2302.13342.
  41. James B. Orlin. Improved algorithms for computing Fisher’s market clearing prices: Computing Fisher’s market clearing prices. In Proceedings of the 42nd ACM Symposium on Theory of Computing, pages 291-300, 2010. Google Scholar
  42. Alexander Schrijver. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B, 80(2):346-355, 2000. Google Scholar
  43. Erel Segal-Halevi and Balázs R. Sziklai. Monotonicity and competitive equilibrium in cake-cutting. Economic Theory, 68(2):363-401, 2019. Google Scholar
  44. Yoshiro Takamatsu, Shinji Hgara, and Kazuo Murota. Continuous/discrete hybrid convex optimization and its optimality criterion (in Japanese). Transactions of the Institute of Systems, Control and Information Engineers, 17:409-411, 2004. Google Scholar
  45. Hal R. Varian. Equity, envy and efficiency. Journal of Economic Theory, 9:63-91, 1974. Google Scholar
  46. László A. Végh. A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. SIAM Journal on Computing, 45(5):1729-1761, 2016. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact