Ex-Post IR Dynamic Auctions with Cost-per-Action Payments

Abstract

Motivated by online ad auctions, we consider a repeated auction between one seller and many buyers, where each buyer only has an estimation of her value in each period until she actually receives the item in that period. The seller is allowed to conduct a dynamic auction but must guarantee ex-post individual rationality. In this paper, we use a structure that we call credit accounts to enable a general reduction from any incentive compatible and ex-ante individual rational dynamic auction to an approximate incentive compatible and ex-post individually rational dynamic auction with credit accounts. Our reduction obtains stronger individual rationality guarantees at the cost of weaker incentive compatibility. Surprisingly, our reduction works without any common knowledge assumption. Finally, as a complement to our reduction, we prove that there is no non-trivial auction that is exactly incentive compatible and ex-post individually rational under this setting.

Cite

Text

Shen et al. "Ex-Post IR Dynamic Auctions with Cost-per-Action Payments." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/70

Markdown

[Shen et al. "Ex-Post IR Dynamic Auctions with Cost-per-Action Payments." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/shen2018ijcai-ex/) doi:10.24963/IJCAI.2018/70

BibTeX

@inproceedings{shen2018ijcai-ex,
  title     = {{Ex-Post IR Dynamic Auctions with Cost-per-Action Payments}},
  author    = {Shen, Weiran and Wang, Zihe and Zuo, Song},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2018},
  pages     = {505-511},
  doi       = {10.24963/IJCAI.2018/70},
  url       = {https://mlanthology.org/ijcai/2018/shen2018ijcai-ex/}
}