English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores

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.

Item is

Basic

show hide
Genre: Conference Paper

Files

show Files
hide Files
:
2107.06649.pdf (Preprint), 858KB
Name:
2107.06649.pdf
Description:
-
OA-Status:
Green
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Boodaghians, Shant1, Author
Ray Chaudhury, Bhaskar2, Author           
Mehta, Ruta1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2022
 Publication Status: Published online
 Pages: 23 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Boodaghians_SODA22b
DOI: 10.1137/1.9781611977073
 Degree: -

Event

show
hide
Title: Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Virtual
Start-/End Date: 2022-01-09 - 2022-01-12

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2022
Source Genre: Proceedings
 Creator(s):
Naor, Seffi1, Editor           
Buchbinder, Niv1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 2285 - 2302 Identifier: ISBN: 978-1-61197-707-3