Algorithm for Optimal Winner Determination in Combinatorial Auctions Export

@inproceedings{Sandholm1999Algorithm, abstract = {Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-item auctions where the agents\&\#039; valuations of the items are not additive. However, determining the winners so as to maximize revenue is AfP-complete. First, we analyze existing approaches for tackling this problem: exhaustive enumeration, dynamic programming, and restricting the allowable combinations.}, author = {Sandholm, Tuomas}, booktitle = {Artificial Intelligence}, citeulike-article-id = {3907552}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.2028}, citeulike-linkout-1 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.2028}, keywords = {algorithm, combinatorial-auction}, pages = {542--547}, posted-at = {2009-01-19 10:46:47}, priority = {2}, title = {Algorithm for Optimal Winner Determination in Combinatorial Auctions}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.2028}, volume = {135}, year = {2001} }

TY - CONF ID - Sandholm1999Algorithm L3 - citeulike-article-id:3907552 N2 - Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-item auctions where the agents' valuations of the items are not additive. However, determining the winners so as to maximize revenue is AfP-complete. First, we analyze existing approaches for tackling this problem: exhaustive enumeration, dynamic programming, and restricting the allowable combinations. EP - 547 TI - Algorithm for Optimal Winner Determination in Combinatorial Auctions VL - 135 T2 - Artificial Intelligence SP - 542 KW - algorithm KW - combinatorial-auction AU - Sandholm, Tuomas PY - 2001/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.2028 ER -