• DOI:10.1007/978-3-030-36027-6_20
Corpus ID: 162168538

Efficient Multi-Resource, Multi-Unit VCG Auction

@article{Funaro2019EfficientMM,
  title={Efficient Multi-Resource, Multi-Unit VCG Auction},
  author={Liran Funaro and Orna Agmon Ben-Yehuda and A. Schuster},
  journal={ArXiv},
  year={2019},
  volume={abs/1905.09014}
}

• Liran Funaro, Orna Agmon Ben-Yehuda, A. Schuster
• Published 2019
• Computer Science
• ArXiv

We consider the optimization problem of a multi-resource, multi-unit VCG auction that produces an optimal, i.e., non-approximated, social welfare. We present an algorithm that solves this optimization problem with pseudo-polynomial complexity and demonstrate its efficiency via our implementation. Our implementation is efficient enough to be deployed in real systems to allocate computing resources in fine time-granularity. Our algorithm has a pseudo-near-linear time complexity on average (over… Expand

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed