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

Georg Gottlob, Gianluigi Greco. On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition. In Jeffrey K. MacKie-Mason, David C. Parkes, Paul Resnick, editors, Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007. pages 152-161, ACM, 2007. [doi]

@inproceedings{GottlobG07,
  title = {On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition},
  author = {Georg Gottlob and Gianluigi Greco},
  year = {2007},
  doi = {10.1145/1250910.1250934},
  url = {http://doi.acm.org/10.1145/1250910.1250934},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GottlobG07},
  cites = {0},
  citedby = {0},
  pages = {152-161},
  booktitle = {Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007},
  editor = {Jeffrey K. MacKie-Mason and David C. Parkes and Paul Resnick},
  publisher = {ACM},
  isbn = {978-1-59593-653-0},
}