Efficient generation of top-k procurements in a multi-item auction

DOI10.1007/978-3-319-30139-6_15MaRDI QIDQ2803822zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Biswajit Sanyal, Subhashis Majumder, Wing-Kai Hon

Publication date 3 May 2016

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-30139-6_15

Mathematics Subject Classification ID

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

Recommendations

• Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions
• Efficiently Generating k-Best Solutions to Procurement Auctions
• Vickrey-Dutch procurement auction for multiple items
• Bid evaluation in procurement auctions with piecewise linear supply curves
• Optimal auctions for multi-unit procurement with volume discount bids

Cites work

• $$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking
• Efficiently Generating k-Best Solutions to Procurement Auctions
• Finding the k Shortest Paths
• Introduction to algorithms.

Cited in

(3)

• Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions
• Bid evaluation in procurement auctions with piecewise linear supply curves
• Efficiently Generating k-Best Solutions to Procurement Auctions

This page was built for publication: Efficient generation of top-\(k\) procurements in a multi-item auction

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