Show simple item record

Optimizing Offer Sets in Sub-Linear Time

dc.contributor.authorFarias, Vivek
dc.contributor.authorLi, Andrew
dc.contributor.authorSinha, Deeksha
dc.date.accessioned2022-11-09T17:41:36Z
dc.date.available2022-11-09T17:41:36Z
dc.date.issued2020-07-13
dc.identifier.isbn978-1-4503-7975-5
dc.identifier.urihttps://hdl.handle.net/1721.1/146245
dc.publisherACM|Proceedings of the 21st ACM Conference on Economics and Computationen_US
dc.relation.isversionofhttps://doi.org/10.1145/3391403.3399544en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceACM|Proceedings of the 21st ACM Conference on Economics and Computationen_US
dc.titleOptimizing Offer Sets in Sub-Linear Timeen_US
dc.typeArticleen_US
dc.identifier.citationFarias, Vivek, Li, Andrew and Sinha, Deeksha. 2020. "Optimizing Offer Sets in Sub-Linear Time."
dc.contributor.departmentSloan School of Managementen_US
dc.identifier.mitlicensePUBLISHER_POLICY
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2022-11-02T20:33:11Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2022-11-02T20:33:11Z
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail
Name:
3391403.3399544.pdf
Size:
863.4Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record