Clock Auctions Augmented with Unreliable Advice
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910684664561664 |
|---|---|
| author | Gkatzelis, Vasilis Schoepflin, Daniel Tan, Xizhi |
| author_facet | Gkatzelis, Vasilis Schoepflin, Daniel Tan, Xizhi |
| contents | We provide the first analysis of (deferred acceptance) clock auctions in the learning-augmented framework. These auctions satisfy a unique list of appealing properties, including obvious strategyproofness, transparency, and unconditional winner privacy, making them particularly well-suited for real-world applications. However, early work that evaluated their performance from a worst-case analysis perspective concluded that no deterministic clock auction with $n$ bidders can achieve a $O(\log^{1-ε} n)$ approximation of the optimal social welfare for any $ε>0$, even in very simple settings. This overly pessimistic impossibility result heavily depends on the assumption that the designer has no information regarding the bidders' values. Leveraging the learning-augmented framework, we instead consider a designer equipped with some (machine-learned) advice regarding the optimal solution; this advice can provide useful guidance if accurate, but it may be unreliable.
Our main results are learning-augmented clock auctions that use this advice to achieve much stronger guarantees whenever the advice is accurate (consistency), while maintaining worst-case guarantees even if this advice is arbitrarily inaccurate (robustness). Our first clock auction achieves the best of both worlds: $(1+ε)$-consistency for any $ε>0$ and $O(\log{n})$ robustness; we also extend this auction to achieve error tolerance. We then consider a much stronger notion of consistency, which we refer to as consistency$^\infty$, and provide auctions that achieves a near-optimal trade-off between consistency$^\infty$ and robustness. Finally, using our impossibility results regarding this trade-off, we prove lower bounds on the ``cost of smoothness,'' i.e., on the achievable robustness if we also require that the performance of the auction degrades smoothly as a function of the prediction error. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_06483 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Clock Auctions Augmented with Unreliable Advice Gkatzelis, Vasilis Schoepflin, Daniel Tan, Xizhi Computer Science and Game Theory We provide the first analysis of (deferred acceptance) clock auctions in the learning-augmented framework. These auctions satisfy a unique list of appealing properties, including obvious strategyproofness, transparency, and unconditional winner privacy, making them particularly well-suited for real-world applications. However, early work that evaluated their performance from a worst-case analysis perspective concluded that no deterministic clock auction with $n$ bidders can achieve a $O(\log^{1-ε} n)$ approximation of the optimal social welfare for any $ε>0$, even in very simple settings. This overly pessimistic impossibility result heavily depends on the assumption that the designer has no information regarding the bidders' values. Leveraging the learning-augmented framework, we instead consider a designer equipped with some (machine-learned) advice regarding the optimal solution; this advice can provide useful guidance if accurate, but it may be unreliable. Our main results are learning-augmented clock auctions that use this advice to achieve much stronger guarantees whenever the advice is accurate (consistency), while maintaining worst-case guarantees even if this advice is arbitrarily inaccurate (robustness). Our first clock auction achieves the best of both worlds: $(1+ε)$-consistency for any $ε>0$ and $O(\log{n})$ robustness; we also extend this auction to achieve error tolerance. We then consider a much stronger notion of consistency, which we refer to as consistency$^\infty$, and provide auctions that achieves a near-optimal trade-off between consistency$^\infty$ and robustness. Finally, using our impossibility results regarding this trade-off, we prove lower bounds on the ``cost of smoothness,'' i.e., on the achievable robustness if we also require that the performance of the auction degrades smoothly as a function of the prediction error. |
| title | Clock Auctions Augmented with Unreliable Advice |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2408.06483 |