File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: Learning Optimal Reserve Price against Non-myopic Bidders
Title | Learning Optimal Reserve Price against Non-myopic Bidders |
---|---|
Authors | |
Issue Date | 2018 |
Publisher | Neural Information Processing Systems Foundation, Inc. The Proceedings' web site is located at https://papers.nips.cc/ |
Citation | Thirty-second Conference on Neural Information Processing Systems, Montréal, Canada, 3-8 December 2018. In Bengio, S ... et al (eds.), Advances in Neural Information Processing Systems 31 (NIPS 2018 Proceedings) How to Cite? |
Abstract | We consider the problem of learning optimal reserve price in repeated auctions against non-myopic bidders, who may bid strategically in order to gain in future rounds even if the single-round auctions are truthful. Previous algorithms, e.g., empirical pricing, do not provide non-trivial regret rounds in this setting in general. We introduce algorithms that obtain small regret against non-myopic bidders either when the market is large, i.e., no bidder appears in a constant fraction of the rounds, or when the bidders are impatient, i.e., they discount future utility by some factor mildly bounded away from one. Our approach carefully controls what information is revealed to each bidder, and builds on techniques from differentially private online learning as well as the recent line of works on jointly differentially private algorithms. |
Description | Poster Session A |
Persistent Identifier | http://hdl.handle.net/10722/273021 |
ISSN | 2020 SCImago Journal Rankings: 1.399 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Huang, Z | - |
dc.contributor.author | Liu, J | - |
dc.contributor.author | Wang, X | - |
dc.date.accessioned | 2019-08-06T09:21:03Z | - |
dc.date.available | 2019-08-06T09:21:03Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | Thirty-second Conference on Neural Information Processing Systems, Montréal, Canada, 3-8 December 2018. In Bengio, S ... et al (eds.), Advances in Neural Information Processing Systems 31 (NIPS 2018 Proceedings) | - |
dc.identifier.issn | 1049-5258 | - |
dc.identifier.uri | http://hdl.handle.net/10722/273021 | - |
dc.description | Poster Session A | - |
dc.description.abstract | We consider the problem of learning optimal reserve price in repeated auctions against non-myopic bidders, who may bid strategically in order to gain in future rounds even if the single-round auctions are truthful. Previous algorithms, e.g., empirical pricing, do not provide non-trivial regret rounds in this setting in general. We introduce algorithms that obtain small regret against non-myopic bidders either when the market is large, i.e., no bidder appears in a constant fraction of the rounds, or when the bidders are impatient, i.e., they discount future utility by some factor mildly bounded away from one. Our approach carefully controls what information is revealed to each bidder, and builds on techniques from differentially private online learning as well as the recent line of works on jointly differentially private algorithms. | - |
dc.language | eng | - |
dc.publisher | Neural Information Processing Systems Foundation, Inc. The Proceedings' web site is located at https://papers.nips.cc/ | - |
dc.relation.ispartof | Advances in Neural Information Processing Systems (NIPS) | - |
dc.relation.ispartof | 32nd Conference on Neural Information Processing Systems (NIPS 2018) | - |
dc.title | Learning Optimal Reserve Price against Non-myopic Bidders | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Huang, Z: zhiyi@cs.hku.hk | - |
dc.identifier.authority | Huang, Z=rp01804 | - |
dc.identifier.hkuros | 300035 | - |
dc.identifier.volume | 31 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 1049-5258 | - |