Non-linear anonymous pricing combinatorial auctions

DOI10.1016/j.ejor.2008.11.029zbMath1176.91056MaRDI QIDQ1042137

Diether Knof, Andreas Drexl, Kurt O. Jørnsten

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11250/163567

zbMATH Keywords

set packing; combinatorial auctions; non-linear anonymous pricing; strong duality theory

Mathematics Subject Classification ID

91B26: Auctions, bargaining, bidding and selling, and other market models

Related Items

Pricing combinatorial auctions by a set of linear price vectors, Non-linear anonymous pricing combinatorial auctions, A pricing scheme for combinatorial auctions based on bundle sizes, Behavioral models for first-price sealed-bid auctions with the one-shot decision theory

Uses Software

• CABOB

Cites Work

• Unnamed Item
• Unnamed Item
• Non-linear anonymous pricing combinatorial auctions
• Decentralized computation procurement and computational robustness in a smart market
• GRASP for set packing problems.
• Pricing combinatorial auctions.
• A practical algorithm for computing a subadditive dual function for set partitioning
• The package assignment model.
• Computationally Manageable Combinational Auctions
• Combinatorial Auctions: A Survey
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
• Iterative Combinatorial Auctions with Bidder-Determined Combinations
• A New and Improved Design for Multiobject Iterative Auctions
• Integer Programming and Pricing
• Reflections about pseudo-dual prices in combinatorial auctions
• Integer programming duality: Price functions and sensitivity analysis
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms