Benchmark Problems for Totally Unimodular Set System Auction

Details Benchmark Problems for Totally Unimodular Set System Auction Benchmark Problems for Totally Unimodular Set System Auction

2011-02-17

arxiv.org/abs/1102.3499v1

Computer Science

Computer Science and Game Theory

Scientific paper

We consider a generalization of the $k$-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.

Affiliated with

Also associated with

No associations

Rating

Benchmark Problems for Totally Unimodular Set System Auction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Benchmark Problems for Totally Unimodular Set System Auction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Benchmark Problems for Totally Unimodular Set System Auction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380114