Paper 2024/1750
Robust Double Auctions for Resource Allocation
Abstract
In a zero-knowledge proof market, we have two sides. On one side, bidders with proofs of different sizes and some private value to have this proof computed. On the other side, we have distributors (also called sellers) which have compute available to process the proofs by the bidders, and these distributors have a certain private cost to process these proofs (dependent on the size). More broadly, this setting applies to any online resource allocation where we have bidders who desire a certain amount of a resource and distributors that can provide this resource. In this work, we study how to devise double auctions for this setting which are truthful for users, weak group strategy proof, weak budget balanced, computationally efficient, and achieve a good approximation of the maximum welfare possible by the set of bids. We denote such auctions as $\textit{robust}$.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- Auctions
- Contact author(s)
-
arthur lazzaretti @ yale edu
charalampos papamanthou @ yale edu
ismael @ lagrange dev - History
- 2024-10-28: approved
- 2024-10-26: received
- See all versions
- Short URL
- https://ia.cr/2024/1750
- License
-
CC BY-NC
BibTeX
@misc{cryptoeprint:2024/1750,
author = {Arthur Lazzaretti and Charalampos Papamanthou and Ismael Hishon-Rezaizadeh},
title = {Robust Double Auctions for Resource Allocation},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1750},
year = {2024},
url = {https://eprint.iacr.org/2024/1750}
}
