CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishMixed multi-unit combinatorial auctions (MMUCAs) are extensions of classical combinatorial auctions (CAs) where bidders trade transformations of goods rather than just sets of goods. Solving MMUCAs, i.e., determining the sequences of bids to be accepted by the auctioneer, is computationally intractable in general. However, differently from classical combinatorial auctions, little was known about whether polynomial-time solvable classes of MMUCAs can be singled out on the basis of their characteristics. The paper fills this gap, by studying the computational complexity of MMUCA instances under structural and qualitative restrictions, which characterize interactions among bidders and types of bids involved in the various transformations, respectively.
The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions / Fionda, Valeria; Greco, Gianluigi. - In: ARTIFICIAL INTELLIGENCE. - ISSN 0004-3702. - 196(2013), pp. 1-25.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
| Titolo: | The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions |
| Autori: | |
| Data di pubblicazione: | 2013 |
| Rivista: | |
| Citazione: | The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions / Fionda, Valeria; Greco, Gianluigi. - In: ARTIFICIAL INTELLIGENCE. - ISSN 0004-3702. - 196(2013), pp. 1-25. |
| Handle: | http://hdl.handle.net/20.500.11770/139064 |
| Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
http://hdl.handle.net/20.500.11770/139064
Copyright © 2021