Pricing combinatorial auctions.

DOI10.1016/S0377-2217(02)00678-1zbMath1099.91054MaRDI QIDQ1420433

Mu Xia, Andrew B. Whinston, Gary J. Koehler

Publication date: 2 February 2004

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

zbMATH Keywords

PricingCombinatorial auctionIncentive compatibilityBidding

Mathematics Subject Classification ID

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

Related Items (11)

On the determination of European day ahead electricity prices: the Turkish case ⋮ Upgrade auctions in build-to-order manufacturing with loss-averse customers ⋮ Pricing combinatorial auctions by a set of linear price vectors ⋮ Pricing in multiple-item procurement auctions with a common to all items fixed cost ⋮ Combinatorial auctions ⋮ A trading mechanism contingent on several indices ⋮ A combinatorial double auction resource allocation model in cloud computing ⋮ Bayesian optimal knapsack procurement ⋮ Block order restrictions in combinatorial electric energy auctions ⋮ Exploring the VCG mechanism in combinatorial auctions: the threshold revenue and the threshold-price rule ⋮ Non-linear anonymous pricing combinatorial auctions

Uses Software

• CABOB

Cites Work

• Unnamed Item
• Unnamed Item
• The package assignment model.
• Computationally Manageable Combinational Auctions
• Optimal Investment in Knowledge Within a Firm Using a Market Mechanism
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• A New and Improved Design for Multiobject Iterative Auctions
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Incentives in Teams
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Resource Allocation in a Non-convex Economy
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems

This page was built for publication: Pricing combinatorial auctions.