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

Bibliographic Details
Main Authors: Gottlob, G, Greco, G
Format: Conference item
Published: ACM 2007
_version_ 1797100180754923520
author Gottlob, G
Greco, G
author_facet Gottlob, G
Greco, G
author_sort Gottlob, G
collection OXFORD
description
first_indexed 2024-03-07T05:34:05Z
format Conference item
id oxford-uuid:e34287b8-07c5-4ace-91ae-768dbd21df03
institution University of Oxford
last_indexed 2024-03-07T05:34:05Z
publishDate 2007
publisher ACM
record_format dspace
spelling oxford-uuid:e34287b8-07c5-4ace-91ae-768dbd21df032022-03-27T10:07:52ZOn the complexity of combinatorial auctions: structured item graphs and hypertree decompositionConference itemhttp://purl.org/coar/resource_type/c_5794uuid:e34287b8-07c5-4ace-91ae-768dbd21df03Department of Computer ScienceACM2007Gottlob, GGreco, G
spellingShingle Gottlob, G
Greco, G
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
title On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
title_full On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
title_fullStr On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
title_full_unstemmed On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
title_short On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
title_sort on the complexity of combinatorial auctions structured item graphs and hypertree decomposition
work_keys_str_mv AT gottlobg onthecomplexityofcombinatorialauctionsstructureditemgraphsandhypertreedecomposition
AT grecog onthecomplexityofcombinatorialauctionsstructureditemgraphsandhypertreedecomposition