Polynomial time algorithms to find an approximate competitive equilibrium for chores

DOI10.1137/1.9781611977073.92MaRDI QIDQ6575166zbMATH OpenFDO

Authors Shant Boodaghians, Bhaskar Chaudhury, Ruta Mehta

Publication date 19 July 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Polynomial time algorithms to find an approximate competitive equilibrium for chores

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575166)