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.
Combinatorial auctions with tractable winner determination / Gottlob, G; Greco, Gianluigi. - In: SIGECOM EXCHANGES. - ISSN 1551-9031. - 7:1(2007), pp. 15-18.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | Combinatorial auctions with tractable winner determination |
Autori: | |
Data di pubblicazione: | 2007 |
Rivista: | |
Citazione: | Combinatorial auctions with tractable winner determination / Gottlob, G; Greco, Gianluigi. - In: SIGECOM EXCHANGES. - ISSN 1551-9031. - 7:1(2007), pp. 15-18. |
Handle: | http://hdl.handle.net/20.500.11770/155931 |
Appare nelle tipologie: | 1.1 Articolo in rivista |