Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores

Shant Boodaghians, Bhaskar Ray Chaudhury, Ruta Mehta. Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 2285-2302, SIAM, 2022. [doi]

Abstract

Abstract is missing.