On the Greedy Algorithm for Combinatorial Auctions with a Random Order
Computer Science and Game Theory
2015-02-10 v1 Data Structures and Algorithms
Abstract
In this note we study the greedy algorithm for combinatorial auctions with submodular bidders. It is well known that this algorithm provides an approximation ratio of for every order of the items. We show that if the valuations are vertex cover functions and the order is random then the expected approximation ratio imrpoves to .
Keywords
Cite
@article{arxiv.1502.02178,
title = {On the Greedy Algorithm for Combinatorial Auctions with a Random Order},
author = {Shahar Dobzinski and Ami Mor},
journal= {arXiv preprint arXiv:1502.02178},
year = {2015}
}