Communication complexity of combinatorial auctions with submodular valuations
From MaRDI portal
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Auctions, bargaining, bidding and selling, and other market models (91B26)
Recommendations
- Inapproximability results for combinatorial auctions with submodular utility functions
- The submodular welfare problem with demand queries
- An impossibility result for truthful combinatorial auctions with submodular valuations
- Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations
- On the complexity of computing an equilibrium in combinatorial auctions
Cited in
(11)- The submodular welfare problem with demand queries
- Submodular functions: learnability, structure, and optimization
- On simultaneous two-player combinatorial auctions
- Capturing complementarity in set functions by going beyond submodularity/subadditivity
- Almost envy-freeness with general valuations
- The one-way communication complexity of submodular maximization with applications to streaming and robustness
- From query complexity to computational complexity
- Sketching valuation functions
- Algorithms - ESA 2003
- Improved truthful mechanisms for combinatorial auctions with submodular bidders
- Inapproximability results for combinatorial auctions with submodular utility functions
This page was built for publication: Communication complexity of combinatorial auctions with submodular valuations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741796)
