Efficiently Generating k-Best Solutions to Procurement Auctions

DOI10.1007/978-3-642-02158-9_8zbMath1246.91053OpenAlexW2107375524MaRDI QIDQ3638445

Yunhong Zhou, Andrew Byde, Terence Kelly, Robert Endre 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

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The shortest path problem with forbidden paths
• The shortest path problem with two objective functions
• An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
• Computationally Manageable Combinational Auctions
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Finding the k Shortest Paths

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