The complexity of mixed multi-unit combinatorial auctions: tractability under structural and qualitative restrictions

DOI10.1016/J.ARTINT.2012.12.002zbMath1270.91026OpenAlexW2010557083WikidataQ57782844 ScholiaQ57782844MaRDI QIDQ360034

Valeria Fionda, Gianluigi Greco

Publication date: 23 August 2013

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S000437021200166X

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper) ⋮ Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems

This page was built for publication: The complexity of mixed multi-unit combinatorial auctions: tractability under structural and qualitative restrictions