English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores

MPS-Authors
/persons/resource/persons225687

Ray Chaudhury,  Bhaskar
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

2107.06649.pdf
(Preprint), 858KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Boodaghians, S., Ray Chaudhury, B., & Mehta, R. (2022). Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores. In S. Naor, & N. Buchbinder (Eds.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2285-2302). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977073.


Cite as: https://hdl.handle.net/21.11116/0000-000C-A3BB-9
Abstract
There is no abstract available