Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders

DOI10.1007/978-3-540-73556-4_19MaRDI QIDQ3611968zbMATH OpenOpenAlexFDO

Authors Wenbin Chen, Jiangtao Meng

Publication date 3 March 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73556-4_19

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Combinatorial games (91A46)

Recommendations

• Approximation algorithms for combinatorial auctions with complement-free bidders
• Approximation algorithms for combinatorial auctions with complement-free bidders
• Inapproximability results for combinatorial auctions with submodular utility functions
• scientific article; zbMATH DE number 1833405
• scientific article; zbMATH DE number 2080339
• Approximation algorithms for a winner determination problem of single-item multi-unit auctions
• Energy Prosumers : Profiling the Energy Microgeneration Market In Lower Silesia, Poland
• scientific article; zbMATH DE number 7703279
• A double-sided multiunit combinatorial auction for substitutes: Theory and algorithms
• An O(\log \log m) Prophet Inequality for Subadditive Combinatorial Auctions

Cited in

(2)

• Approximation algorithms for combinatorial auctions with complement-free bidders
• Approximation algorithms for combinatorial auctions with complement-free bidders

This page was built for publication: Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611968)