Benchmark Problems for Totally Unimodular Set System Auction
Computer Science and Game Theory
2011-02-18 v1 Discrete Mathematics
Abstract
We consider a generalization of the -flow set system auction where the set to be procured by a customer corresponds to a feasible solution to a linear programming problem where the coefficient matrix and right-hand-side together constitute a totally unimodular matrix. Our results generalize and strengthen bounds identified for several benchmarks, which form a crucial component in the study of frugality ratios of truthful auction mechanisms.
Keywords
Cite
@article{arxiv.1102.3499,
title = {Benchmark Problems for Totally Unimodular Set System Auction},
author = {Ilan Adler and Dorit S. Hochbaum},
journal= {arXiv preprint arXiv:1102.3499},
year = {2011}
}