Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions
From MaRDI portal
Publication:3010396
DOI10.1007/978-3-642-20877-5_15zbMath1331.68116OpenAlexW1487667821MaRDI QIDQ3010396
Shunya Suzuki, Akiyoshi Shioura
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_15
Analysis of algorithms and problem complexity (68Q25) Utility theory (91B16) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Unnamed Item
- Unnamed Item
- Inapproximability results for combinatorial auctions with submodular utility functions
- The ellipsoid method and its consequences in combinatorial optimization
- Walrasian equilibrium with gross substitutes
- \(M\)-convex functions and tree metrics
- Verifying gross substitutability.
- Bundling equilibrium in combinatorial auctions
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity
- Combinatorial auctions with decreasing marginal utilities
- Submodular functions and optimization.
- Approximation algorithms for classification problems with pairwise relationships
- Approximation Algorithms for Graph Homomorphism Problems
- Job Matching, Coalition Formation, and Gross Substitutes
- The Complexity of Multiterminal Cuts
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- An $o(n^3 )$-Time Maximum-Flow Algorithm
- A Note on Kelso and Crawford's Gross Substitutes Condition
- Algorithm for optimal winner determination in combinatorial auctions
