On the Hardness of Truthful Online Auctions with Multidimensional Constraints
From MaRDI portal
Publication:3507437
DOI10.1007/978-3-540-69407-6_26zbMath1142.91481OpenAlexW1590497713MaRDI QIDQ3507437
Publication date: 19 June 2008
Published in: Logic and Theory of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_26
Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: On the Hardness of Truthful Online Auctions with Multidimensional Constraints
