On the complexity of combinatorial auctions: Structured item graphs and hypertree decomposition

EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce

Volumn , Issue , 2007, Pages 152-161

  Gottlob, Georg ^a   Greco, Gianluigi ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Combinatorial auctions; Hypergraphs; Hypertree decompositions

Indexed keywords

COMPUTATIONAL COMPLEXITY; DOMAIN DECOMPOSITION METHODS; GRAPH THEORY; IDENTIFICATION (CONTROL SYSTEMS); PROBLEM SOLVING; STRUCTURED PROGRAMMING;

COMBINATORIAL AUCTIONS; HYPERGRAPHS; HYPERTREE DECOMPOSITIONS;

DECISION TREES;

EID: 36448956049     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250910.1250934     Document Type: Conference Paper

References (23)

1. I. Adler, G. Gottlob, and M. Grohe. Hypertree-Width and Related Hypergraph Invariants. In Proc. of EUROCOMB'05, pages 5-10, 2005.
2. C. Boutilier. Solving Concisely Expressed Combinatorial Auction Problems. In Proc. of AAAI'02, pages 359-366, 2002.
3. V. Conitzer, J. Derryberry, and T. Sandholm. Combinatorial auctions with structured item graphs. In Proc. of AAAI'04, pages 212-218, 2004.
4. 2) algorithm for circular-arc graph recognition. In Proc. of SODA '93, pages 128-137, 1993.
5. Y. Fujishima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate. In Proc. of IJCAI'99, pages 548-553, 1999.
6. G. Gottlob, N. Leone, and F. Scarcello. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. Journal of Computer and System Sciences, 66(4): 775-808, 2003.
7. G. Gottlob, N. Leone, and S. Scarcello. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences, 63(3):579-627, 2002.
8. H. H. Hoos and C. Boutilier. Solving combinatorial auctions using stochastic local search. In Proc. of AAAI'00, pages 22-29, 2000.
9. D. Johnson. A Catalog of Complexity Classes. In P. Cramton, Y. Shoham, and R. Steinberg, editors, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pages 67-161. 1990.
10. N. Korte and R. H. Mohring. An incremental linear-time algorithm for recognizing interval graphs. SIAM Journal on Computing, 18(1):68-81, 1989.
11. D. Lehmann, R. Müller, and T. Sandholm. The Winner Determination Problem. In P. Cramton, Y. Shoham, and R. Steinberg, editors, Combinatorial Auctions. MIT Press, 2006.
12. D. Lehmann, L. I. O'Callaghan, and Y. Shoham. Truth revelation in approximately efficient combinatorial auctions. J. ACM, 49(5):577-602, 2002.
13. R. McAfee and J. McMillan. Analyzing the airwaves auction. Journal of Economic Perspectives, 10(1):159175, 1996.
14. J. McMillan. Selling spectrum rights. Journal of Economic Perspectives, 8(3): 145-62, 1994.
15. N. Nisan. Bidding and allocation in combinatorial auctions. In Proc. of EC'00, pages 1-12, 2000.
16. N. Robertson and P. Seymour. Graph minors ii. algorithmic aspects of tree width. Journal of Algorithms, 7:309-322, 1986.
17. M. H. Rothkopf, A. Pekec, and R. M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44:1131-1147, 1998.
18. T. Sandholm. An implementation of the contract net protocol based on marginal cost calculations. In Proc. of AAAI'93, pages 256-262, 1993.
19. T. Sandholm. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135(1-2):1-54, 2002.
20. T. Sandholm. Winner determination algorithms. In P. Cramton, Y. Shoham, and R. Steinberg, editors, Combinatorial Auctions. MIT Press, 2006.
21. T. Sandholm and S. Suri. Bob: Improved winner determination in combinatorial auctions and generalizations. Artificial Intelligence, 7:33-58, 2003.
22. M. Tennenholtz. Some tractable combinatorial auctions. In Proc. of AAAI'OO, pages 98-103, 2000.
23. E. Zurel and N. Nisan. An efficient approximate allocation algorithm for combinatorial auctions. In Proc. of EC'01, pages 125-136, 2001.