Combinatorial auctions with tractable winner determination

Authors:
Georg Gottlob;Gianluigi Greco
Affiliations:
University of Oxford, UK;Università della Calabria, Italy
Venue:
ACM SIGecom Exchanges
Year:
2007

Citing 8
Cited 1

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Computationally Manageable Combinational Auctions

Management Science
A comparison of structural CSP decomposition methods

Artificial Intelligence
Algorithm for optimal winner determination in combinatorial auctions

Artificial Intelligence
Conjunctive Query Containment Revisited

ICDT '97 Proceedings of the 6th International Conference on Database Theory
BOB: improved winner determination in combinatorial auctions and generalizations

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

Proceedings of the 8th ACM conference on Electronic commerce
Combinatorial auctions with structured item graphs

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence

Computing optimal outcomes under an expressive representation of settings with externalities

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some recent advances in the identification of tractable classes of combinatorial auctions are discussed. In particular, the work of [Gottlob and Greco 2007] is illustrated, where a research question raised in [Conitzer et al. 2004] is solved by showing that the class of structured item graphs is not efficiently recognizable (i.e., deciding the membership of instances is NP-hard), and where this difficulty is overcome trough a different approach based on the notion of hypertree decomposition.