Optimal allocation in combinatorial auctions with quadratic utility functions
DOI10.1007/978-3-642-20877-5_15zbMATH Open1331.68116OpenAlexW1487667821MaRDI QIDQ3010396FDOQ3010396
Authors: Akiyoshi Shioura, Shunya Suzuki 
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
Recommendations
- Optimal allocation problem with quadratic utility functions and its relationship with graph cut problem
- Inapproximability results for combinatorial auctions with submodular utility functions
- Combinatorial auctions with decreasing marginal utilities
- Combinatorial auctions
- Bidder optimal assignments for general utilities
Analysis of algorithms and problem complexity (68Q25) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Utility theory (91B16)
Cites Work
- Network flows. Theory, algorithms, and applications.
- The ellipsoid method and its consequences in combinatorial optimization
- Walrasian equilibrium with gross substitutes
- Submodular functions and optimization.
- The Complexity of Multiterminal Cuts
- Title not available (Why is that?)
- Job Matching, Coalition Formation, and Gross Substitutes
- Combinatorial auctions with decreasing marginal utilities
- Algorithm for optimal winner determination in combinatorial auctions
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
- A Note on Kelso and Crawford's Gross Substitutes Condition
- Verifying gross substitutability.
- Bundling equilibrium in combinatorial auctions
- \(M\)-convex functions and tree metrics
- Inapproximability results for combinatorial auctions with submodular utility functions
- Approximation Algorithms for Graph Homomorphism Problems
- An $o(n^3 )$-Time Maximum-Flow Algorithm
Cited In (4)
- Optimal allocation problem with quadratic utility functions and its relationship with graph cut problem
- Quadratic core-selecting payment rules for combinatorial auctions
- On the optimal allocation of prizes in best-of-three all-pay auctions
- Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support
This page was built for publication: Optimal allocation in combinatorial auctions with quadratic utility functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3010396)
