Combinatorial auctions with tractable winner determination


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… (More)
DOI: 10.1145/1345037.1345040

1 Figure or Table


  • Presentations referencing similar topics