An improved approximation algorithm for combinatorial auctions with submodular bidders
From MaRDI portal
Publication:3581517
DOI10.1145/1109557.1109675zbMath1192.91102MaRDI QIDQ3581517
Michael Schapira, Shahar Dobzinski
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109675
91B26: Auctions, bargaining, bidding and selling, and other market models
91-04: Software, source code, etc. for problems pertaining to game theory, economics, and finance
Related Items
Scheduling to maximize participation, Inapproximability results for combinatorial auctions with submodular utility functions, Single-Parameter Combinatorial Auctions with Partially Public Valuations, Santa Claus Meets Hypergraph Matchings, Scheduling to Maximize Participation