Efficiently Generating k-Best Solutions to Procurement Auctions

DOI10.1007/978-3-642-02158-9_8zbMATH Open1246.91053OpenAlexW2107375524MaRDI QIDQ3638445FDOQ3638445

Authors: Andrew Byde, Terence Kelly, Yunhong Zhou, Robert E. Tarjan 

Publication date: 2 July 2009

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_8

Recommendations

• Efficient generation of top-\(k\) procurements in a multi-item auction
• Bid evaluation in procurement auctions with piecewise linear supply curves
• Branch-and-cut algorithms for winner determination in discount auctions
• Multiple unit auctions with economies and diseconomies of scale
• On heuristics for solving winner determination problem in combinatorial auctions

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• The shortest path problem with forbidden paths
• A note on two problems in connexion with graphs
• Title not available (Why is that?)
• Finding the k Shortest Paths
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Computationally manageable combinational auctions
• Combinatorial auctions. Foreword by Vernon L. Smith.
• The shortest path problem with two objective functions
• An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions

Cited In (4)

• An approximate winner determination algorithm for hybrid procurement mechanisms in logistics
• Recent Advances in Constraints
• Efficient generation of top-\(k\) procurements in a multi-item auction
• Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions

This page was built for publication: Efficiently Generating k-Best Solutions to Procurement Auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638445)